Bertrand With Capacity Constraint
Bertrand With Capacity Constraint
• Static games with firms competing over prices are called Bertrand games; those
firms are Bertrand competitors; and price competition is often referred to as
Bertrand competition.
• Bertrand paradox: the Nash equilibrium results when price equals marginal cost,
but we do not expect oligopoly pricing to yield the competitive outcome.
• There are 2 firms. Their per unit cost is c, and there is no constraint on capacity (how much
they can produce).
• The firms compete over prices just once and they make their pricing decision simultaneously.
The Nash equilibrium to this game is a pair of prices such that given the Nash equilibrium
price of its rival, a firm has no incentive to unilaterally deviate.
1( 1 , 2 )≥ 1( 1, 2 ) for any 1
2( 1 , 2 )≥ 2( 1 , 2) for any 2
𝜋
𝑝
𝑝
𝜋
𝑝
𝑝
𝜋
𝑝
𝑝
𝜋
𝑝
𝑝
𝑝
𝑝
𝐵
𝐵
𝐵
𝐵
𝐵
𝐵
Assumptions:
• Consumers will buy from the low-price firm.
• When prices are the same, the demand will be split evenly.
( ) < ( ) <
( , )= ( , )=
1 1
Firm i’s demand is: 2
( ) = Firm j’s demand is: 2
( ) =
0 > 0 >
i. 1 > 2 > .
ii. 1 > 2 = .
iii. 1 = 2 > .
iv. 1 = 2 = . These are the Nash equilibrium strategies.
• The Nash equilibrium to this simple Bertrand game has two significant features:
𝑖
𝑗
𝑗
𝑖
𝑖
𝑖
𝑓
𝑓
𝑝
𝑝
𝑝
𝑝
i. Two firms are enough to eliminate market power.
𝑖
𝑗
𝑖
𝑗
𝑗
𝑖
𝑖
𝑗
𝑖
𝑗
𝑗
𝑖
𝐷
𝐷
𝑝
𝑝
𝑖
𝑖
𝑓
𝑓
𝑝
𝑝
𝑝
𝑝
𝐷
𝐷
𝑝
𝑝
𝑝
𝑝
ii. Competition between two firms results in complete disipation of profits.
𝑖
𝑗
𝑖
𝑗
𝑗
𝑖
𝑝
𝑝
𝑝
𝑝
𝑝
𝑝
𝑐
𝑐
𝑐
𝐷
𝐷
𝑝
𝑝
𝑖
𝑖
𝑓
𝑓
𝑝
𝑝
𝑝
𝑝
𝑝
𝑝
𝑐
Source:: Fernández-Baca (2006)
b. Variants of the Bertrand model
Capacity constraint
• Edgeworth (1897): up to capacity, firms can produce output at unit cost
c, but they cannot produce more than their capacities.
• Assumptions:
➢ c = 0.
➢ k1 and k2 : capacities of firm 1 and firm 2, respectively.
➢ The demand function: Q = D(p) and its inverse is P = P(Q)
➢ 2 > 1, but ( 1) > 1.
• “Efficient rationing” rule: those who value the good the most are served
first by the low-price supplier.
[ ( ) ]
If = we assume that = , ( )
➢ +
𝑖
𝑗
𝑘
𝑘
Source: Church and Ware (2000)
𝑖
𝑖
𝑞
𝑚
𝑖
𝑛
𝑘
𝐷
𝑝
𝑖
𝑖
𝑖
𝑖
𝑖
𝑖
𝑖
𝑗
𝑘
𝑖
𝑖
𝑖
𝑗
𝑗
𝑗
𝐷
𝑞
𝑞
𝑝
𝑘
𝐷
𝑘
𝐷
𝑝
𝑝
𝑘
𝑘
𝑝
𝑝
𝑝
𝑝
𝑝
𝑝
𝑝
𝑝
Capacity constraint
i. p1 = p 2 = c
ii. p1 = p2 = p > c and demand < aggregate capacity
iii. p1 = p2 = p > c and demand > aggregate capacity
iv. pi > p j > c