MNSC 2021 4241
MNSC 2021 4241
Management Science
Publication details, including instructions for authors and subscription information:
http://pubsonline.informs.org
This article may be used only for the purposes of research, teaching, and/or private study. Commercial use
or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher
approval, unless otherwise noted. For more information, contact permissions@informs.org.
The Publisher does not warrant or guarantee the article’s accuracy, completeness, merchantability, fitness
for a particular purpose, or non-infringement. Descriptions of, or references to, products or publications, or
inclusion of an advertisement in this article, neither constitutes nor implies a guarantee, endorsement, or
support of claims made of that product, publication, or service.
With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.)
and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual
professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to
transform strategic visions and achieve better outcomes.
For more information on INFORMS, its publications, membership, or meetings visit http://www.informs.org
MANAGEMENT SCIENCE
Vol. 68, No. 9, September 2022, pp. 6889–6906
http://pubsonline.informs.org/journal/mnsc ISSN 0025-1909 (print), ISSN 1526-5501 (online)
Received: February 26, 2021 Abstract. A third party developer designs and sells a pricing algorithm that enhances a
Revised: July 19, 2021 firm’s ability to tailor prices to a source of demand variation, whether high-frequency de-
Accepted: October 4, 2021 mand shocks or market segmentation. The equilibrium pricing algorithm is characterized
Published Online in Articles in Advance: that maximizes the third party’s profit given firms’ optimal adoption decisions. Outsourc-
January 31, 2022 ing the pricing algorithm does not reduce competition but does make prices more sensitive
https://doi.org/10.1287/mnsc.2021.4241 to the demand variation, and this is shown to decrease consumer welfare and increase in-
dustry profit. This effect is larger when products are more substitutable.
Copyright: © 2022 INFORMS
History: Accepted by Joshua Gans, business strategy.
6889
Harrington: Outsourcing Pricing Algorithms and Market Competition
6890 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
Although, in practice, there are many developers of et al. 2021), and how firms learn the best pricing algo-
pricing algorithms, it makes sense to first explore the rithms (Salcedo 2015, Calvano et al. 2020b, Asker et al.
monopoly case before examining the additional implica- 2021, Klein 2021). All of those studies assume the pric-
tions of competition among developers. The setting is ing algorithm is designed by the firm itself and thus
one where the pricing algorithm’s comparative advan- do not consider the implications of it being designed
tage is allowing price to condition on a source of de- by a third party with different incentives than that of
mand variation such as high-frequency demand shocks the firm. For a more detailed literature review, the
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
differentiable though all analysis goes through if in- is Subgame Perfect Equilibrium. In that final stage, if
stead Λ is a finite set.6 both firms did not adopt the pricing algorithm, then
Let us initially suppose the demand shock a equilibrium prices are pN (h). If both firms adopted,
occurs at a higher frequency than a firm’s pricing then they price at φ(a, h). If one firm adopted and the
decisions (or, when G represents a collection of mar- other firm did not adopt, then the former prices at
ket segments, the firm cannot distinguish among φ(a, h) and the latter, which cannot condition its price
them). In that case, a firm is incapable of condition- on a, chooses a best response to φ(a, h) given its beliefs
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
ing price on it and, therefore, its price depends only G on a. The assumption that φ(·) is public information
on G. A symmetric Nash equilibrium price pN (h) is is clearly stylized but allows firms to form accurate be-
defined by: liefs on the profit associated with adoption and for a
nonadopting firm to form accurate beliefs on an adopt-
pN (h) ≡ arg max (p − ch )D1 p, pN (h), a, h G (a, h)da: ing firm’s price.10
p∈R+
Before moving on, it is worth noting that an adopt-
As a convention, G (a, h) ≡ ∂G(a, h)=∂a: ing firm is unable to modify the pricing algorithm. I
The comparative advantage of the third party de- am presuming the pricing algorithm is a “black box”
veloper is that it can offer a pricing algorithm capable to the firm so it cannot disentangle the demand state
of tracking the high-frequency demand shock (or mar- and start changing the price attached to it. Although I
ket segment) a so a firm’s price can then condition on believe there are situations where such an assumption
it. This algorithm is denoted φ : Λ × H → R+ : When a is appropriate (as the firm lacks the necessary knowl-
is a demand shock then φ assigns a price to each pos- edge), there are also situations where some modifica-
sible demand shock in Λ, and when a is a market seg- tion would be possible. In exploring the latter, one
ment then {φ}a∈Λ is the vector of prices assigned to would want to consider the constraints on a firm’s
the set of market segments Λ. Once adopted by a firm, ability to modify the algorithm lest one trivializes the
the algorithm is assumed to “learn” the firm’s de- role of a third party developer. This extension of the
mand parameters, while a firm can program in its model is left for future research.
cost. As a result, φ conditions on h even though the
third party may not know a particular market’s type. 2.2. Equilibrium Conditions
Let Φ denote the space of mappings from Λ × H into Toward specifying the conditions defining the equi-
the price space R+ . librium pricing algorithm, we will begin by charac-
The third party chooses a fee f, which a firm pays in terizing the market demand for pricing algorithms.
order to adopt φ. As the fee is set ex ante, it is uniform For that purpose, let V(Ii , Ij , φ, h) denote gross profit
across markets. For reasons of competition law, the (before netting out the third party’s fee) for a firm
fee is not tied to an adopting firm’s profit. Given that with adoption decision Ii ∈ {A, NA} given the other
both firms may adopt the algorithm, a third party that firm’s adoption decision Ij ∈ {A, NA}, where A refers
was compensated based on competitors’ profits could to adoption and NA to no adoption. The explicit ex-
effectively act as a cartel manager and coordinate pressions for V(Ii , Ij , φ, h) are provided later. A firm’s
firms’ prices. It is also for this reason that the algo- total cost of adoption is f + ε where f is the fee
rithm is not permitted to condition on the adoption charged by the third party and ε is a market-specific
decision of another firm in the market. If that were adoption cost, which is observable to the firms but
allowed, the algorithms could be programmed to not to the third party. ε is introduced so the proba-
“communicate” and coordinate their prices in the bility of adoption is a smooth function of φ and
event that both adopted, which the third party may be f. ε has a continuously differentiable cdf K : R+ →
inclined to do in order to generate more value for [0, 1] and K puts sufficient mass near zero so that, at
firms, which would then allow it to charge a higher the equilibrium design and fee, there is positive ex-
fee.7, 8 As I’ll later show, in spite of these restrictions, pected demand.11
outsourcing can cause consumer harm. Derivation of the demand for pricing algorithms re-
Next to be described is the sequence of moves and quires characterizing equilibrium adoption decisions.
what agents know. In the first stage, the third party It is an equilibrium for a market to have zero adop-
designs the pricing algorithm and sets the fee; that is, tions when:
it chooses (φ(·), f ) ∈ Φ × R+ : In the second stage,
(φ(·), f ) is publicly revealed and firms make simulta- V(NA, NA, φ, h) ≥ V(A, NA, φ, h) − ( f + ε) ⇐
⇒
neous adoption decisions. After adoption decisions
f + ε ≥ V(A, NA, φ, h) − V(NA, NA, φ, h);
are made and publicly observed, the third stage has
the high-frequency demand shock realized and firms that is, the incremental value of adoption conditional
make simultaneous price decisions.9 The solution concept on the rival firm not adopting is less than the cost of
Harrington: Outsourcing Pricing Algorithms and Market Competition
6892 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
adoption. It is an equilibrium for a market to have one adoptions, an equilibrium selection is made that both
adoption when: adopt.12
The market demand for the third party’s pricing
V(A, NA, φ, h) − ( f + ε) ≥ V(NA, NA, φ, h) and
algorithm is composed of those markets for which
V(NA, A, φ, h) ≥ V(A, A, φ, h) − ( f + ε), one firm adopts—(3) is satisfied—and those for which
where the first inequality says it is optimal for a firm two firms adopt—so (2) is satisfied. The resulting de-
to adopt given the rival firm does not adopt and the mand is
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
V(A, A, φ, h) − V(NA, A, φ, h) > V(A, NA, φ, h) D1 (φ(a, h), p∗ (φ, h), a, h)G (a, h)da
− V(NA, NA, φ, h),
V(NA, A, φ, h) p∗ (φ, h) − ch
so adoptions are strategic complements, then the equi-
librium number of adoptions is zero or two. If V(A, D1 (p∗ (φ, h), φ(a, h), a, h)G (a, h)da
NA, φ, h) − V(NA, NA, φ, h) > f + ε then the market has V(NA, NA, φ, h) pN (h) − ch
two adoptions, and if
V(A, A, φ, h) − V(NA, A, φ, h) ≥ f + ε ≥ V(A, NA, φ, h) D1 pN (h), pN (h), a, h G (a, h)da
− V(NA, NA, φ, h)
p∗ (φ, h) arg max (p − ch )D1 (p, φ(a, h), a, h)G (a, h)da
p
then the market has either zero or two adoptions.
When it is an equilibrium to have either zero or two (7)
Harrington: Outsourcing Pricing Algorithms and Market Competition
Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS 6893
Using the expression for market demand in (4), (5) is because a firm is able to raise price when demand is
expected revenue. Given its rival adopts φ, the opti- stronger (and more price-inelastic) and lower price
mal price for a firm that does not adopt is p∗ (φ, h) as when demand is weaker (and more price-elastic). By
defined in (7). p∗ (φ, h) along with φ are used to define comparing the third party’s equilibrium pricing algo-
firms’ values when one adopts and the other firm rithm φ∗ with φI , we will identify the difference due
does not—V(A, NA, φ, h) and V(NA, A, φ, h)—as pro- to outsourcing or, alternatively stated, to the pricing
vided in (6). Equation (6) also defines a firm’s value algorithm having been designed to maximize the
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
when both adopt, V(A, A, φ, h), and when neither profit from selling the algorithm (i.e., the developer’s
adopts, V(NA, NA, φ, h). We next turn to deriving a profit) rather than from using the algorithm (i.e., a
closed-form solution for (5). firm’s profit).
It is straightforward to show that the pricing algo- only one firm to adopt and accordingly the third party
rithm commits the adopter to a higher average price designs the pricing algorithm to take advantage of the
than when pricing algorithms are not adopted: commitment that adoption delivers.
Although the preceding analysis is interesting, the
(b + d)(2cb2 − cdb + dμ) 1
pl
E[φ (a)] − p N
+ μ more relevant setting is when σ2 is not low so high-
b(4b2 − 2d2 ) 2b
frequency demand shocks are a significant factor in
μ + bc the market. That is the setting that is made more com-
−
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
rival’s price to be lower; hence, it raises the incremental and, at the equilibrium pricing algorithm, V(A, A, φ)−
value of adoption. Consequently, the third party’s de- V(NA, A, φ) ≤ 0, which implies expected demand sim-
sign will have the pricing algorithm price below that plifies from (9) to K(V(A, NA, φ) − V(NA, NA, φ) − f ).
which maximizes joint profit. Thus, when the demand variance is low, the equilib-
Although the price level is less than the monopoly rium price algorithm maximizes the incremental value
price, the sensitivity of the pricing algorithm to the de- of adoption given the rival firm does not adopt,
mand shock is the same as for the monopoly price, V(A, NA, φ) − V(NA, NA, φ). When the demand vari-
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
∂φsc (a) 1 ∂pM (a) ance is neither low nor high, it is possible the third
: party chooses the pricing algorithm so adoptions are
∂a 2(b − d) ∂a
strategic substitutes and V(A, A, φ) − V(NA, A, φ) > 0,
Thus, the third party’s pricing algorithm shifts down which means the solution that maximizes (9) will de-
the pricing rule that maximizes the profit of both firms pend on K. That is why equilibrium has only been
adopting: characterized when demand variance is low or high
d(μ − (b − d)c) and not for the intermediate case.18 However, if the
φsc (a) pM (a) − : fee (as well as the design) is tailored to the market
2(2b − d)(b − d)
type and the adoption cost shock ε is eliminated, then
Toward understanding the optimality of this rule, the equilibrium pricing algorithm can be character-
consider how changing the pricing algorithm affects ized for all demand variances. That is what we do in
the incremental value of adoption, V(A, A, φ) − V(NA, this section.
A, φ). Given that a nonadopting firm does not condi- Without the adoption cost shock, the third party
tion on the high-frequency demand shock, the ex- will know exactly how many firms will adopt depend-
pected profit of a nonadopter V(NA, A, φ) depends ing on φ and f, where both are now set for a market
only on the expected price of its adopting rival, which type. Thus, we can think of the third party deciding to
is the expectation of φ: In contrast, given adoption sell the pricing algorithm to one firm or two firms. If it
means conditioning price on the realization of the decides to sell it to two firms, then the optimal design
demand shock, V(A, A, φ) depends on the entire distri- is φsc as that maximizes the WTP and thus maximizes
bution of price (based on φ). Making the responsive- the fee that can be charged. In that case, the WTP is
ness of φ to a closer to the responsiveness of the the incremental value of adoption conditional on the
monopoly price, while keeping the expectation of φ rival firm adopting, which (as shown in the proof of
fixed, raises the expected profit from adopting with- Lemma B.1) is 4(b−d)σ2 σ2
so the optimal fee is f 4(b−d) . The
out affecting the expected profit from not adopting; third party’s revenue from selling φsc to two firms
hence, the incremental value from adoption increases. σ2
at that fee is 2(b−d) : If it decides to sell the pricing algo-
This explains why ∂φsc (a)=∂a ∈ (∂pN (a)=∂a, ∂pM (a)=∂a],
and it may be due to linearity that it results in a corner rithm to only one firm, then it will want the design to
solution with ∂φsc (a)=∂a ∂pM (a)=∂a. This simple maximize the incremental value of adoption condi-
tional on the rival firm not adopting, as again that will
modification of the monopoly price yields high profit
maximize the fee that can be charged. The solution to
when both firms adopt without creating high profit
for a firm foregoing adoption and pricing competi- that problem is φpl , and the WTP (and fee) can be
d4 (μ−(b−d)c)2
tively against a rival firm that did adopt. shown to be +σ ,
2
which is also the third
8b(2b−d)2 (2b2 −d2 ) 4b
party’s revenue.
3.3. Market-Specific Fee
The difference between the revenue from selling
When the demand variance is high, the third party
two units of φsc and one unit of φpl is
optimally designs the pricing algorithm so that adop-
tions are strategic complements (Theorem 2). Thus, σ2 d4 (μ − (b − d)c)2 σ2
expected demand is 2 × K(V(A, A, φ) − V(NA, A, φ) − − +
2(b − d) 8b(2b − d) (2b2 − d2 ) 4b
2
f ) and the equilibrium price algorithm is that which
maximizes the incremental value of adoption given
the rival firm adopts, V(A, A, φ) − V(NA, A, φ). When (b + d)σ2 d4 (μ − (b − d)c)2
− :
the demand variance is low, the third party opti- 4b(b − d) 8b(2b − d)2 (2b2 − d2 )
mally designs the pricing algorithm so that adop-
It is then optimal for the third party to choose φsc (φpl )
tions are strategic substitutes (Theorem 1). Expected
and sell to two firms (one firm) when
demand is
K(V(A, NA, φ) − V(NA, NA, φ) − f ) (b − d)d4 (μ − (b − d)c)2
σ2 > (<) :
+ K(V(A, A, φ) − V(NA, A, φ) − f ) (9) 2(2b − d)2 (2b2 − d2 )(b + d)
Harrington: Outsourcing Pricing Algorithms and Market Competition
6896 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
third party’s pricing algorithm φsc with φI , which is the In response to stronger demand, a firm raises its price
pricing algorithm that conditions on the demand shock
but φI limits the amount of that price increase because of
but is internally developed by the firm so as to maxi-
the prospect of losing demand to the other firm. How-
mize its expected profit. In that way, the effect of out-
ever, the third party’s pricing algorithm internalizes that
sourcing is disentangled from the effect of third-degree
effect—as it responds to demand variation as would a
price discrimination. Our primary goal is to shed light
monopolist—and, consequently, price rises more in re-
on the structure of the pricing algorithm, which is at-
sponse to stronger demand. Outsourcing the pricing
tributable to it being developed by a third party.
algorithm then results in greater price sensitivity to de-
mand shocks and, therefore, greater price volatility.
4.1. Sensitivity of Price to Demand Shocks
A numerical example illustrates the effect of out-
It will prove instructive to rearrange the equilibrium
sourcing on price variability. Assume μ 100, b 1,
pricing algorithm into the following expression:
c 10, d 0:6: In the proof of Theorem 2, it is shown
a + bc d(a − μ) that a sufficient (but not necessary) condition for φsc
φsc (a) + : (10) to be the equilibrium pricing algorithm is
2b − d 2(b − d)(2b − d)
b(μ − (b − d)c)2 σ2
+
(2b − d)2 4(b − d)
effect of one’s firm price on the other’s demand and conduct, which would harm consumers. First, the fee
profit. Even if firms are capable of developing their was not allowed to be tied to an adopting firm’s profit.
own pricing algorithms at a comparable cost to the Without that restriction, the third party could claim a
third party, it is collectively advantageous to have share of firms’ profit and thus be incentivized to have
the third party design them.19, 20 the pricing algorithm charge the monopoly price so as to
maximize industry profit. Second, the pricing algorithm
4.2. Consumer Welfare was not allowed to condition on how many firms
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
To analyze the consumer welfare effects of a third adopted. Without that restriction, the third party could
party’s provision of a pricing algorithm, I draw on some design the algorithm to price at the monopoly level but
standard methods developed for third-degree price dis- only when both firms adopted, and otherwise price
crimination. The price discrimination literature has competitively. In spite of those efforts to prevent out-
shown that a sufficient condition for third-degree price sourcing from causing consumer harm, we see that
discrimination to lower consumer welfare, relative to a harm still occurs though it is not through higher prices
uniform price, is that total supply does not increase but rather more volatile prices.
(Varian 1989). Intuitively, for a given aggregate total
supply, consumer welfare is maximized by equating 4.3. Product Differentiation
marginal utility across markets (or, in the current model, In order to consider the effect of product differentia-
equating it across demand states), which can only be tion, assume a representative agent’s utility function:
achieved with a uniform price. Thus, holding total sup-
1
ply constant across price regimes, price discrimination θ1 q1 + θ2 q2 − (β1 q21 + β2 q22 + 2ηq1 q2 )
2
lowers consumer (and total) welfare compared with a
uniform price. If total supply is lower under price dis- where η is the degree of product similarity. Firms’
crimination, then consumer (and total) welfare is even products are independent when η 0 and identical
less. A corollary of that general finding is that, when when η β. Solving
comparing two price discrimination schemes that pro-
1
duce the same total supply, the one with more price dis- max θ1 q1 + θ2 q2 − (β1 q21 + β2 q22 + 2ηq1 q2 ) − p1 q1 − p2 q2
(q1 , q2 ) 2
persion across markets has lower consumer welfare.
Toward applying that insight, consider the three yields firm 1’s demand function (with firm 2’s de-
pricing rules: (1) uniform price (which does not condi- mand function analogously defined):
tion on the demand shock); (2) internally developed
pricing algorithm, which conditions on the demand 1
D1 (p1 , p2 ) 2 (θ(β − η) − βp1 + ηp2 ) a − bp1 + dp2
shock; and (3) externally developed pricing algorithm, β − η2
which conditions on the demand shock. Letting p(a)
represent a generic pricing rule, all three pricing rules where
have the same expected quantity (the analogue to θ β η μ
“total supply”), which follows from them having the a ,b 2 ,d 2 ,μ θ , (13)
β+η β −η 2 β −η 2 β +η
same expected price:
and μθ is the mean of θ. Substituting (13) into
(a − (b − d)p(a)))G (a)da μ − (b − d)E[p(a)] (10)–(11):
(2β − η)(θ + c) − η(μθ − c) θ + c η(μθ − c)
μ + bc b(μ − (b − d)c) φsc (a) −
μ − (b − d) : 2(2β − η) 2 2(2β − η)
2b − d 2b − d
(14)
Of course, price dispersion is greater with the inter- (β − η)θ + βc θ + c η(θ − c)
nally developed pricing algorithm than the uniform φI (a) − (15)
2β − η 2 2(2β − η)
price, so consumer welfare is lower with internal de-
velopment. Furthermore, price dispersion with an ex- Differentiating (14)–(15) with respect to the degree of
ternally developed algorithm exceeds that when it is product similarity parameter η yields:22
internally developed:
∂φsc (a) −β(μθ − c) ∂2 φsc (a)
d(a − μ) < 0 ; 0
φsc (a) − φI (a) 0 as a μ: ∂η (2β − η)2 ∂η∂θ
2(2b − d)(b − d)
∂φI (a) β(θ − c) ∂2 φI (a) β
Therefore, outsourcing reduces consumer welfare as it exac- − < 0, − < 0:
∂η (2β − η)2 ∂η∂θ (2β-η)2
erbates the harm from third-degree price discrimination.21
Recall from Section 2 that the design and fee structure Figure 2 depicts the change in the two pricing algo-
were restricted in order not to facilitate coordinated rithms when products are less differentiated. For all
Harrington: Outsourcing Pricing Algorithms and Market Competition
6898 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
Figure 2. (Color online) Interaction Between Outsourcing role for third party developers, and little is understood
and Product Differentiation about the implications of a firm using a pricing algo-
rithm whose design was outsourced. With that moti-
vation, this paper investigated how design incentives
differ between a firm interested in selling the pricing
algorithm and a firm interested in using the pricing algo-
rithm, and what this means for consumers. In conclud-
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
competition in the market for pricing algorithms and Appendix A. Literature Review
increasing competition in the product market? The theoretical literature examining the implications of Big
A more fundamental extension is to specify a dif- Data and algorithmic pricing can be categorized along two
ferent space of pricing algorithms. In this paper, a dimensions: 1) the space of pricing algorithms and 2) the cri-
pricing algorithm conditions on market-specific cost terion for selecting a pricing algorithm. The first dimension
pertains to how Big Data and algorithmic pricing enrich the
and demand parameters, and that could be extended
feasible set of pricing algorithms. One branch is behavior-
to condition on rival firms’ prices, either prices from
based pricing, which allows price to condition on a custom-
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
past periods (as in Calvano et al. 2020b) or where er’s history of purchases (or some other behavior such as
there is a sequentiality to pricing (as in Brown and clickstream activity). A second branch focuses on how Big
MacKay 2022). Third party development is very Data and algorithmic pricing allows a firm to be more in-
likely to affect the design of pricing algorithms. For formed of demand when it sets price. This can mean using
example, a firm might design its pricing algorithm to data to have a more accurate demand forecast or more finely
search for the lowest price among its competitors segment the market or better tailor price to current market
and charge a price just below that level.24 However, conditions. A third branch examines how pricing algorithms
a third party’s pricing algorithm is unlikely to have affect the way in which a firm’s price responds to competi-
that property for it would result in a downward spi- tors’ prices in terms of either the speed of response or com-
mitting to a particular response. This review focuses on the
ral of prices should competitors adopt it. The ques-
latter two branches, whereas behavior-based pricing is sur-
tion then is exactly how a third party developer’s
veyed in Fudenberg and Villas Boas (2007, 2012).
pricing algorithm will differ from that which a firm The second dimension is how a firm selects a pricing
itself would design. algorithm. The conventional approach characterizes equi-
Within this broader class of pricing algorithms, one librium pricing algorithms for a well-defined game. An
could also explore whether it is possible to prevent col- alternative approach specifies a learning algorithm; that
lusive pricing when competitors adopt pricing algo- is, how past data (prices, sales, profits) are used to iden-
rithms from the same third party. In the model of this tify a better performing pricing algorithm.25 Two classes
paper, it was prevented by constraining the pricing al- of learning algorithms have been considered: estimation-
gorithm so that it does not condition on another firm’s optimization learning and reinforcement learning. The
adoption decision. One could impose an analogous former embodies two distinct modules. The estimation
constraint on this richer space of pricing algorithms by module estimates the firm’s environment and delivers
predictions as to how the firm’s price or quantity deter-
requiring, conditional on the history, the pricing algo-
mines its profit or revenue. In particular, past prices and
rithm to produce the same price regardless of rival sales are used to estimate a firm’s demand function
firms’ adoption decisions. We already know from (where various papers have used OLS, Maximum Likeli-
Calvano et al. (2020b) that collusion can emerge, but hood, and an artificial neural network), and thereby have
there is the question of whether it becomes easier or an estimate of how price affects a firm’s profit (or reve-
more likely under third party development. A chal- nue). With that estimated environment, the optimization
lenge to the prevention of collusion is that the price his- module selects price to maximize profit (or revenue) us-
tory will vary with rival firms’ adoption decisions and ing the estimated demand function, while adding some
that could provide a path to circumventing the con- randomness to generate experimentation. An example
straint. For example, the algorithms could be pro- discussed below is Cooper et al. (2015), whereas den
grammed to have a pattern in the last two digits of a Boer (2015) provides an overview of this work.
An estimation-optimization learning algorithm separately
price and to shift to “collusive” mode when it observes
estimates the environment and then optimizes in the selection
that pattern in a rival’s prices. of an action for the estimated environment. In comparison, re-
It seems clear there are many fascinating questions inforcement learning fuses estimation and optimization by
associated with the third party development of pric- learning directly over actions; it seeks to identify the best action
ing algorithms and a considerable need for more re- for a particular state based on how various actions have per-
search to address them. formed in the past for that state. Its approach is model-free in
that it operates without any prior knowledge of the environ-
Acknowledgments ment. One common method of reinforcement learning is
The comments of four referees, the associate editor, and the Q-learning. With this approach, there is a value assigned to
editor are gratefully acknowledged. I also appreciate the each action-state pair (e.g., an action is a price and a state is a
comments of seminar participants at Queen’s University, history of prices) and these values are updated based on real-
Düsseldorf Institute for Competition Economics (DICE), ized profit. Given the current collection of values and the
and Norwegian School of Economics (NHH) and the re- current state, the action is chosen that yields the highest value.
search assistance of Haoxiang (Harry) Hou. This paper Recent papers using Q-learning are Calvano et al (2020b),
supersedes Harrington (2020). On the latter paper, I appreci- Asker et al. (2021), and Klein (2021).26 Hansen et al. (2021) uses
ate the comments of Ai Deng, Timo Klein, Jeanine Miklós- the Upper Confidence Bound algorithm that, for each price,
Thal, and participants in the Notre Dame Theory Seminar. keeps track of the empirical average of the profit for that price
Harrington: Outsourcing Pricing Algorithms and Market Competition
6900 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
and the number of times it was chosen. There is an index that demand forecasting though under imperfect monitoring.
is increasing in the empirical average profit and decreasing in Without Big Data, demand is affected by two unobserv-
the number of times a price was chosen. In any period, the able demand shocks. With Big Data, one of those demand
price with the highest index is chosen, so a price is more likely shocks is observed so price can condition on that shock.
to be selected when it has performed better and has been cho- As with Miklós-Thal and Tucker (2019), the deviation pay-
sen less frequently. off is higher because of the improved demand information
Let me now turn to reviewing those papers that most that makes collusion harder, but monitoring is more effec-
directly examine how Big Data and algorithmic pricing af- tive, which makes collusion easier. The net effect on prices
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
are its own past prices and profits, which means, in estimat- which is φsc . Referring to the objective in (B.3) as W,
ing the relationship between its price and profit, the firm has second-order conditions are satisfied:
a misspecified model that does not take account of the other
firm’s price. With an omitted variable that is endogenous to ∂2 W (2b − d)2 ∂2 W (4b(b − d)(σ2 + μ2 ) + d2 μ2 )
− < 0, − <0
what the pricing algorithm does, estimates will be biased. For ∂α2 2b ∂γ2 2b
example, if, when a firm raises its price, the other firm also
happens to raise its price, then the firm’s demand will be esti- 2
mated to be less price-elastic than it actually is. Underestimat- ∂2 W ∂2 W ∂2 W σ2 (b − d)(2b − d)2
− > 0:
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
ing the price elasticity of demand would cause firms to set ∂α 2 ∂γ2 ∂γ∂α b
higher prices than would be achieved for a full-information
equilibrium. Both papers find that this misspecification re- The final step is to show that φsc satisfies (B.2). It is
sults in supracompetitive prices. Cooper et al. (2015) assumes straightforward to show:
prices are set optimally given an OLS-estimated demand
curve. Hansen et al. (2021) view it as a multiarmed bandit b(μ − (b − d)c)2 σ2
V(A, A, φsc ) +
problem where a pricing algorithm is chosen to minimize sta- (2b − d) 2 4(b − d)
tistical regret (i.e., the difference between average profit
achieved with the algorithm and ex-post optimal profit). b(μ − (b − d)c)2
They find that when the signal-to-noise ratio for sales is high V(NA, A, φsc ) ,
(2b − d)2
(i.e., sales are relatively more responsive to price changes
than to demand shocks), firms’ prices are supracompetitive so the incremental value of adoption when the other firm
and positively correlated. It is when learning results in a high adopts is
positive correlation that a firm finds a high price relatively
profitable because the rival also tends to set a high price. σ2
V(A, A, φsc ) − V(NA, A, φsc ) : (B.4)
4(b − d)
Appendix B. Proofs
Analogously, it can be shown the incremental value of
Lemma B.1. The unique affine solution to adoption when the other firm does not adopt is
max V(A, A, φ) − V(NA, A, φ) (B.1) (b − 2d)σ2
φ∈Φ
V(A, NA, φsc ) − V(NA, NA, φsc ) : (B.5)
4(b − d)2
s:t: V(A, A, φ) − V(NA, A, φ)
(B.2)
≥ V(A, NA, φ) − V(NA, NA, φ) Inserting (B.4) and (B.5) into (B.2),
is σ2 (b − 2d)σ2
V(A, A, φsc ) − V(NA, A, φsc ) ≥
2bc(b − d) − dμ a 4(b − d) 4(b − d)2
φsc + :
4b(b − d) − 2d(b − d) 2(b − d) V(A, NA, φsc ) − V(NA, NA, φsc )
Proof. Our approach is to solve the unconstrained problem which holds because
(B.1) and then show the solution satisfies the constraint
(B.2). Given linear demand and cost and affine pricing algo- σ2 (b − 2d)σ2 dσ2
rithms, (B.1) takes the form: − > 0: w
4(b − d) 4(b − d)2 4(b − d)2
max (α + γa − c)(a − (b − d)(α + γa))G (a)da
(α, γ) Lemma B.2 The unique affine solution to
μ + bc + d(α + γμ) max V(A, NA, φ) − V(NA, NA, φ)
− −c φ∈Φ
2b
μ + bc + d(α + γμ) is
a−b + d(α + γa) G (a)da:
2b
(b + d)(2cb2 − cdb + dμ) a
Taking the integral in the first term and simplifying the φpl + :
second term yields: b(4b2 − 2d2 ) 2b
max(α − c)μ − (α − c)(b − d)(α + γμ) − γμ(b − d)α Proof. First note that maxφ∈Φ V(A, NA, φ) − V(NA, NA, φ) is
(α, γ)
equivalent to maxφ∈Φ V(A, NA, φ) given that φ does not ap-
(μ − bc + d(α + γμ))2 pear in V(NA, NA, φ). With affine pricing algorithms,
+γ (1 − γ(b − d))(μ2 + σ2 ) − : (B.3)
4b maxφ∈Φ V(A, NA, φ) takes the form:
Solving the first-order conditions to (B.3) yields:
μ + bc + d(α + γμ)
max (α + γa − c) a − b(α + γa) + d G (a)da:
2bc(b − d) − dμ 1 (α, γ) 2b
α ,γ
4b(b − d) − 2d(b − d) 2(b − d) (B.6)
Harrington: Outsourcing Pricing Algorithms and Market Competition
6902 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
Taking the integral yields: strictly higher expected demand than φo (σ2 ): This contra-
diction will prove the result.
μ + bc + d(α + γμ) First suppose limσ2 →0 φo (a, σ2 ) φpl (a) pointwise in a for
(α − c) μ − b(α + γμ) + d
2b all but a set of measure zero. Thus, φo (σ2 ) is close to φpl
μ + bc + d(α + γμ) when σ2 is close to zero. Note that
+ γ(μ2 + σ2 )(1 − bγ) + γμ −bα + d :
2b
0 > V(A, A, φpl , 0) − V(NA, A, φpl , 0) (B.9)
Solving the first-order conditions delivers:
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
max 1 × max{K(V(A, NA, φ, σ2 ) − V(NA, NA, φ, σ2 ) − f ) (B.7) and, equivalently, maximizes V(A, NA, φ, σ2 ) − V(NA, NA,
φ
φ, σ2 ):29 However, φo (σ2 ) ≠ φpl for a set of positive mea-
− K(V(A, A, φ, σ2 ) − V(NA, A, φ, σ2 ) − f ), 0} sure delivers a contradiction because φpl is the unique (af-
fine) maximum of V(A, NA, φ, σ2 ) − V(NA, NA, φ, σ2 ). This
+ 2 × K(V(A, A, φ, σ2 ) − V(NA, A, φ, σ2 ) − f ):
completes the proof that, for σ2 close to zero, there cannot
Consider σ2 0: It is shown in the proof of Lemma B.1 be a solution to (B.7) in a neighborhood of φpl that is dif-
that (for affine pricing algorithms): ferent from φpl .
σ2 Now suppose limσ2 →0 φo (a, σ2 ) ≠ φpl (a) for a set of posi-
max V(A, A, φ, σ2 ) − V(NA, A, φ, σ2 ) (B.8) tive measure of values for a so the claimed optimum is
φ 4(b − d)
not in a neighborhood of φpl . We know that
which implies maxφ V(A, A, φ, 0) − V(NA, A, φ, 0) 0. Hence,
at the solution to (B.7) for σ2 0, lim V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 ) > 0,
σ2 →0
V(A, A, φ, 0) − V(NA, A, φ, 0) − f −f ≤ 0 while
which implies
lim V(A, A, φpl , σ2 ) − V(NA, A, φpl , σ2 ) < 0 (B.10)
σ2 →0
K(V(A, A, φ, 0) − V(NA, A, φ, 0) − f ) 0:
Thus, the solution to (B.7) maximizes which follows from (B.9) and continuity of V(A, A, φpl , σ2 ) −
V(NA, A, φpl , σ2 ) in σ2 . As σ2 → 0, we then have30
K(V(A, NA, φ, 0) − V(NA, NA, φ, 0) − f )
K(V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 ) − f ) > 0
or, equivalently, maximizes V(A, NA, φ, 0) − V(NA, NA, φ, 0):
It is shown in Lemma B.2 that the (affine) solution to maxφ K(V(A, A, φpl , σ2 ) − V(NA, A, φpl , σ2 ) − f ): (B.11)
V(A, NA, φ, σ ) − V(NA, NA, φ, σ ) is φ . Hence, if σ 0,
2 2 pl 2
Given that φo (σ2 ) is bounded away from φpl as σ2 → 0
then the equilibrium pricing algorithm is φpl .
then, given φpl is the unique maximum of V(A, NA, φ,
Now suppose σ2 is close to zero. Define φo (a, σ2 ) as the
σ2 ) − V(NA, NA, φ, σ2 ),
solution to (B.7) for a sequence of values for σ2 that go to
zero: {φo (a, σ2 )}σ2 →0 . As σ2 → 0, assume φo (a, σ2 ) differs lim V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 )
σ2 →0
from φpl (a) for a set of positive measure of values for a.28
> lim V(A, NA, φo (σ2 ), σ2 ) − V(NA, NA, φo (σ2 ), σ2 ): (B.12)
I will show ∃η > 0 such that if σ2 ∈ (0, η], then φpl yields a σ2 →0
Harrington: Outsourcing Pricing Algorithms and Market Competition
Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS 6903
(B.13) φ∈Φ
that the second term in (B.7) is higher with φo than φpl : which means 2K(V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 ) − f ) is
an upper bound on the LHS of (B.16). Hence,
lim K(V(A, A, φo (σ2 ), σ2 ) − V(NA, A, φo (σ2 ), σ2 ) − f )
σ2 →0 2K(V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 ) − f )
> lim K(V(A, A, φ , σ ) − V(NA, A, φ , σ ) − f ):
pl 2 pl 2
(B.14) > K(V(A, NA, φss , σ2 ) − V(NA, NA, φss , σ2 ) − f )
σ2 →0
+ K(V(A, A, φss , σ2 ) − V(NA, A, φss , σ2 ) − f ): (B.17)
However, given (B.8) then
In sum, 2K(V(A, NA, φ , σ ) − V(NA, NA, φ , σ ) − f ) is an
pl 2 pl 2
lim K(V(A, A, φo (σ2 ), σ2 ) − V(NA, A, φo (σ2 ), σ2 )) 0 upper bound on the expected demand from any φ ∈ Φss .
σ2 →0
To complete the proof, we want to show: if σ2 is suffi-
which implies (B.14) cannot be true. In sum, if φo (σ2 ) is ciently high, then the expected demand from φsc exceeds
bounded away from φpl then, for σ2 close to zero, φpl has the expected demand from φss ,
higher expected demand. Again, we have a contradiction
to the claim that φo (σ2 ) is optimal. 2K(V(A, A, φsc , σ2 ) − V(NA, A, φsc , σ2 ) − f )
We conclude ∃η > 0 such that if σ2 ∈ [0, η] then the solu- > K(V(A, NA, φss , σ2 ) − V(NA, NA, φss , σ2 ) − f )
tion to (B.7) is φpl . w
+ K(V(A, A, φss , σ2 ) − V(NA, A, φss , σ2 ) − f ), (B.18)
Proof of Theorem 2. For the ensuing analysis, we will
break the third party’s optimization problem into two so φsc is the equilibrium pricing algorithm. Given (B.17), a
subproblems. Partition the set of pricing algorithms into sufficient condition for (B.18) is
those that result in adoptions being strategic comple-
ments—call that subset of pricing algorithms Φsc —and 2K(V(A, A, φsc , σ2 ) − V(NA, A, φsc , σ2 ) − f )
those for which adoptions are strategic substitutes, Φss . ≥ 2K(V(A, NA, φpl , σ2 ) − V(NA, NA, φpl , σ2 ) − f )
Φsc ≡ {φ ∈ Φ : V(A, A, φ, σ2 ) − V(NA, A, φ, σ2 )
or, equivalently,
≥ V(A, NA, φ, σ2 ) − V(NA, NA, φ, σ2 )}:
Φss ≡ {φ ∈ Φ : V(A, A, φ, σ2 ) − V(NA, A, φ, σ2 ) V(A, A, φsc , σ2 ) − V(NA, A, φsc , σ2 ) ≥ V(A, NA, φpl , σ2 )
< V(A, NA, φ, σ2 ) − V(NA, NA, φ, σ2 )}: − V(NA, NA, φpl , σ2 ): (B.19)
We have already shown φsc is the solution when the choice One can show the RHS of (B.19) is
set is Φsc . Note that the associated expected demand is
2
d4 μ − (b − d)c
σ 2
+
1 2
σ :
2K(V(A, A, φsc , σ2 ) − V(NA, A, φsc , σ2 ) − f ) 2K −f :
4(b − d) 8b(2b − d)2 (2b2 − d2 ) 4b
Harrington: Outsourcing Pricing Algorithms and Market Competition
6904 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
Using (B.4), (B.19) takes the form: Given that the quantity is chosen to maximize net sur-
plus U(q, a) − p(a) then ∂U(q(a), a)=∂q p(a): As a result,
2
(C.1) becomes:
σ2 d4 μ − (b − d)c σ2
≥ +
m
m
4(b − d) 8b(2b − d) (2b2 − d2 ) 4b
2
ρ(aj )U(q (aj ), aj ) ≤ ρ(aj )U(q (aj ), aj )
j1 j1
or
m
+ ρ(aj )p (aj )(q (aj ) − q (aj )),
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
2 j1
d (b − d)(μ − (b − d)c)
3
σ2 ≥ : (B.20)
2(2b − d)2 (2b2 − d2 ) which delivers an upper bound on the change in con-
sumer welfare:
Thus, a sufficient condition for φsc to be the equilibrium
m
m
pricing algorithm is that σ2 satisfies (B.20). w ρ(aj )U(q (aj ), aj ) − ρ(aj )U(q (aj ), aj )
j1 j1
quantities satisfy the relationship implied by these price − p (ao ))(q (aj ) − q (aj )) (C.4)
vectors under decreasing demand, and the expected quan-
tities are equal in the two configurations: The RHS of (C.4) is negative because p (aj ) − p (ao ) < 0 and
q (aj ) − q (aj ) > 0 when aj < ao , and p (aj ) − p (ao ) > 0 and
p (a) p (a) as a ao q (aj ) − q (aj ) < 0 when aj > ao .
It has then been shown that consumer welfare is highest
with the uniform price, next highest with the internally
q (a) q (a) as a ao
developed pricing algorithm, and lowest with the exter-
m
m
nally developed pricing algorithm. Given constant and
ρ(aj )q (aj ) ρ(aj )q (aj ):
j1 j1
common marginal cost, the same ordering applies to total
welfare (consumer welfare plus industry profit).
Assuming the quantities correspond to the associated de-
mands, note that these three properties hold when: 1) p is
Endnotes
the uniform price pN and p is the internally developed 1
Some of that discussion can be found in Mehra (2016), Ezrachi and
pricing algorithm φI ; and 2) p is the internally developed Stucke (2017), Johnson (2017), Oxera (2017), Deng (2018), Harring-
pricing algorithm and p is the externally developed pric- ton (2018), Gal (2019), Schwalbe (2019), and Calvano et al (2020a).
ing algorithm φsc . 2
Outsourcing does result in higher average prices in Harrington
By concavity, (2020) where it is assumed adoption is exogenous and the third
party designs the pricing algorithm to maximize the expected profit
m
m
of an adopter. Here we show that higher prices do not emerge
ρ(aj )U(q (aj ), aj ) ≤ ρ(aj )U(q (aj ), aj )
j1 j1 when adoption is endogenous and the third party designs the pric-
ing algorithm to maximize its expected profit.
m ∂U(q (aj ), aj )
+ ρ(aj ) (q (aj ) − q (aj )): 3
There is a small empirical literature comprising Chen et al. (2016),
j1 ∂q Assad et al (2020), Brown and MacKay (2022), and Leisten (2021).
4
(C.1) For a survey, see Stole (2007).
Harrington: Outsourcing Pricing Algorithms and Market Competition
Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS 6905
5 18
The duopoly case reduces the notational burden and is not essen- This is also the analytical impediment to allowing for firm-
tial to the paper’s main insight. specific adoption costs as then either one or two firms may adopt in
6
For the welfare analysis, Λ is a finite set so that some previous re- equilibrium, which causes the characterization of the pricing algo-
sults in the literature can be used. rithm to depend on K.
19
7
This restriction is motivated by concerns expressed by various This finding offers an interesting contrast from Corts (1998). In the
authorities. The German Monopolies Commission (2018, p. 23) has setting of Corts (1998), price discrimination lowers firms’ profits and
warned that a third party, in its design of a pricing algorithm, “could that creates an incentive for firms to adopt practices—such as every-
contribute to a collusive market outcome [and] it is even conceivable day low prices—so as make price less variable across demand states.
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
that [they] see such a contribution as an advantage, as it makes the al- We have a setting whereby price discrimination raises firms’ profits
gorithm more attractive for users interested in profit maximization.” and that creates an incentive for them to outsource their pricing algo-
While the OECD (2017, p. 27) has warned: “concerns of coordination rithms so as to make price more variable across demand states.
20
would arise if firms outsourced the creation of algorithms to the same If a firm is given the option to develop its own pricing algorithm,
IT companies and programmers. This might create a sort of ‘hub and it remains an open question whether a firm would do so or instead
spoke’ scenario where co-ordination is, willingly or not, caused by purchase the third party’s. That question is left to future research.
competitors using the same ‘hub’ for developing their pricing algo- The maintained assumption of this paper is that the third party is
rithms and end up relying on the same algorithms.” the sole innovator of a pricing algorithm that can condition on this
8
Given the private information in the market, the third party might source of demand variation.
want to offer a menu of algorithms and fees so that firms from dif- 21
A more detailed proof of this result is provided in Appendix C.
ferent market types could self-select. That possibility is left to future As we know from the price discrimination literature, welfare results
research. can be sensitive to properties of the demand function; see, for exam-
9 ple, Cowan (2016). Thus, it is an open question as to whether this
Even if adoption decisions are not observed, a firm could eventu-
ally infer that the other firm adopted from its high-frequency price finding extends to some nonlinear demand functions.
changes. φ (a) and φI (a) are derived assuming an interior solution, and
22 sc
10
The assumption that φ(·) is observed should not be taken too lit- that condition is violated when η is close enough to β. Thus, in re-
erally and instead seen as a proxy for the steady-state information ducing the degree of product differentiation, it is assumed products
that firms would have. For example, a firm that adopts would even- remain sufficiently differentiated.
tually learn the profit from adoption. A firm that does not adopt 23
Useful starting references for this immense literature are Wald-
would eventually learn the distribution of a rival firm’s price that man and Johnson (2007) and Özalp and Phillips (2012).
did adopt, which is what a nonadopting firm needs to know to set 24
Such a rule was used by a poster seller on Amazon Marketplace
its optimal price and to know the profit from nonadoption.
(U.S. v. Topkins, U.S. Department of Justice, 2015). That there was
11
Obviously, the third party will set f so that expected demand is collusion in that case is not relevant to the point being made.
positive. 25
Almost exclusively, the behavior-based pricing literature is based
12
Our later analysis will show that this is part of the Pareto domi- on the equilibrium approach.
nant equilibrium. It is generally in the interests of the third party to 26
Earlier papers using Q-learning in an environment where multi-
persuade firms to coordinate on the equilibrium with two adop-
ple firms choose prices or quantities include Tesauro and Kephart
tions as it prefers positive demand to zero demand. As shown in
(2002), Xie and Chen (2004), Waltman and Kaymak (2008), Dogan
Sections 3 and 4 when there is linear product demand, a firm’s gross
and Güner (2015), and Hilsen (2016).
equilibrium profit is higher when both adopt than when neither
adopts. As a firm’s net profit (gross profit less the equilibrium fee)
27
“Collusion is when firms use history-dependent strategies to sus-
must be at least as great as the profit from not adopting and that tain supracompetitive outcomes through a reward-punishment
profit will be shown to exceed the Nash equilibrium profit when scheme that rewards a firm for abiding by the supracompetitive
neither adopts then firms’ net profit from adoption is higher com- outcome and punishes it for departing from it.” Harrington (2017),
pared with when both do not adopt. In sum, the third party and the p. 1.
28
two firms prefer the equilibrium when both firms adopt. Actually, they must differ by all but a set of measure zero since
13
Without ε, there could be many equilibrium designs only because algorithms are limited to affine functions.
there are many designs sufficient to result in the incremental profit 29
This equivalence does require ∃φ such that K(V(A, A, φo (σ2 ), σ2 ) −
from adoption exceeding f. Introducing ε rids the model of this V(NA, A, φo (σ2 ), σ2 ) − f ) > 0, which is presumed to be true. Other-
indeterminacy. wise, expected demand is zero ∀φ in which case any φ is a solution.
14
The design cost of the pricing algorithm is assumed to be indepen- 30
This does presume f is small enough that K(V(A, NA, φpl , σ2 ) −
dent of the design. The cost is also assumed to be sufficiently small V(NA, NA, φpl , σ2 ) − f ) > 0. Otherwise, there is a degenerate solution
so it is exceeded by the equilibrium revenue. Otherwise, the third as expected demand is zero for all φ.
party would not be in the market of supplying pricing algorithms.
15
Although it has not been shown that a solution must be an affine
function, it would be surprising if that were not the case.
References
Asker J, Fershtman C, Pakes A (2021) Artificial intelligence and pric-
16
For Theorems 1 and 2, the uniqueness of the solution assumes ∃φ ing: The impact of algorithm design. Working paper, University
such that expected demand is positive. That is always true when f of California–Los Angeles, Los Angeles, CA.
0: Of course, in equilibrium, f > 0 in which case it is possible ex- Assad S, Clark R, Ershov D, Xu L (2020) Algorithmic pricing and
pected demand is zero ∀φ for some market types. In that case, any competition: Empirical evidence from the German Retail Gaso-
φ is a trivial solution. The proofs are for the case when ∃φ such that line Market. Working paper, Queen’s University, Kingston,
expected demand is positive. Ontario, Canada.
17
In another context, Brown and MacKay (2022) examine commit- Brown ZY, MacKay A (2022) Competition in pricing algorithms.
ment with regards to the frequency with which price changes. Amer. Econom. J. Microeconomics. Forthcoming.
Harrington: Outsourcing Pricing Algorithms and Market Competition
6906 Management Science, 2022, vol. 68, no. 9, pp. 6889–6906, © 2022 INFORMS
Calvano E, Calzolari G, Denicolò V, Pastorello S (2020b) Artificial Hilsen HOØ (2016) Simulating dynamic pricing algorithm perfor-
intelligence, algorithmic pricing and collusion. Amer. Econom. mance in heterogeneous markets. Thesis, Norwegian University
Rev. 110:3267–3297. of Science and Technology.
Calvano E, Calzolari G, Denicolò V, Harrington JE Jr, Pastorello S Johnson PA (2017) Should we be concerned that data and algo-
(2020a) Protecting consumers from collusive prices due to AI. rithms will soften competition? CPI Antitrust Chronicle 2:10–15.
Science 370:1040–1042. Klein T (2021) Autonomous algorithmic collusion: Q-learning under
Chen L, Mislove A, Wilson C (2016) An empirical analysis of algo- sequential pricing. RAND J. Econom. 52:538–558.
rithmic pricing on Amazon Marketplace. Proc. 25th Internat. Leisten M (2021) Algorithmic competition, with humans. Working
Conf. World Wide Web, April 2016 (Association for Computing paper, Federal Trade Commission, Washington, D.C.
Downloaded from informs.org by [103.197.36.6] on 20 August 2023, at 09:33 . For personal use only, all rights reserved.
Machinery, New York), 1339–1349. Mehra SK (2016) Antitrust and the Robo-Seller: Competition in the
Cooper WL, Homen-de-Mello T, Kleywegt AJ (2015) Learning and time of algorithms. Minn. Law Rev. 100:1323–1375.
pricing with models that do not explicitly incorporate competi- Miklós-Thal J, Tucker C (2019) Collusion by algorithm: Does better
tion. Oper. Res. 63:86–103. demand prediction facilitate coordination between sellers? Man-
Corts KS (1998) Third-degree price discrimination in oligopoly: All- agement Sci. 4:1552–1561.
out competition and strategic commitment. RAND J. Econom. O’Connor J, Wilson NE (2022) Reduced demand uncertainty and
29:306–323. the sustainability of collusion: How AI could affect collusion.
Cowan S (2016) Welfare-increasing third-degree price discrimina- Inform. Econom. Policy 54. Forthcoming.
tion. RAND J. Econom. 47:326–340. OECD (Organisation for Economic Co-operation and Development)
den Boer AV (2015) Dynamic pricing and learning: Historical ori- (2017) Algorithms and collusion—Background note by the sec-
gins, current research, and new directions. Surveys in Oper. Res. retariat. DAF/COMP(2017)4, Paris, France.
and Management Sci. 20:1–18. Oxera (2017) When algorithms set prices: Winners and losers. Discus-
Deng A (2018) What do we know about algorithmic tacit collusion? sion paper, Oxera Consulting LLP, Oxford, UK.
Antitrust 33:88–95. Özalp Ö, Phillips R, eds. (2012) The Oxford Handbook of Pricing Man-
Dogan I, Güner AR (2015) A reinforcement learning approach to agement (Oxford University Press, Oxford).
competitive ordering and pricing problem. Expert Systems 32: Salcedo B (2015) Pricing algorithms and tacit collusion. Working paper,
39–47. Western University, London, Ontario, Canada.
Ezrachi A, Stucke ME (2017) Artificial intelligence and collusion: Schwalbe U (2019) Algorithms, machine learning, and collusion.
When computers inhibit competition. Univ. Ill. Law Rev. 2017: J. Compet. Law Econom. 14:568–607.
1775–1810. Stole L (2007) Price discrimination and competition. Armstrong M,
Fudenberg D, Miguel Villas Boas J (2012) Price discrimination in the Porter RH, eds. Handbook of Industrial Organization, vol. 3 (Elsevier,
digital economy. Peitz M, Waldfogel J, eds. Oxford Handbook of Amsterdam), 2221–2299.
the Digital Economy (Oxford University Press, Oxford and New Tesauro G, Kephart JO (2002) Pricing in agent economics using
York), 254–272. multi-agent Q-learning. Autonomous Agents and Multi-Agent Sys-
Fudenberg D, Villas-Boas MJ (2007) Behavior-based price discrim- tems 5:289–304.
ination and customer recognition. Hendershott TJ, ed. Eco- U.S. Department of Justice (2015) Office of Public Affairs, April 6,
nomics and Information Systems (Emerald, Elsevier, Bingley, 2015. Former e-commerce executive charged with price fixing
UK), 377–436. in the Antitrust Division’s first online marketplace prosecution.
Gal MS (2019) Algorithms as facilitating practices. Berkeley Technol. United Kingdom Competition & Markets Authority (2018) Pricing
Law J. 34:67–118. algorithms: Economic working paper on the use of algorithms to
German Monopolies Commission, XXII (2018) Biennial Report, Chapter facilitate collusion and personalised pricing. Working paper.
on Algorithms and Collusion (German Monopolies Commission). Varian HR (1989) Price discrimination. Schmalensee R, Willig RD,
Hansen K, Misra K, Pai M (2021) Algorithmic collusion: Supra-competitive eds. Handbook of Industrial Organization, vol. 1 (Elsevier, Amster-
prices via independent algorithms. Marketing Sci. 40:1–12. dam), 597–654.
Harrington JE Jr (2017) The Theory of Collusion and Competition Policy Waldman M, Johnson J, eds. (2007) Pricing Tactics, Strategies, and
(The MIT Press, Cambridge, MA). Outcomes (Edward Elgar, Cheltenham).
Harrington JE Jr (2018) Developing competition law for collusion by au- Waltman L, Kaymak U (2008) Q-learning agents in a Cournot oli-
tonomous artificial agents. J. Compet. Law Econom. 14:331–363. gopoly model. J. Econom. Dynam. Control 32:3275–3293.
Harrington JE Jr (2020) Third party pricing algorithms and the in- Xie M, Chen J (2004) Studies on horizontal competition among ho-
tensity of competition. Working paper, The Wharton School, mogeneous retailers through agent-based simulations. J. Sys-
University of Pennsylvania, Philadelphia. tems Sci. Systems Engrg. 13:490–505.