• Aucun résultat trouvé

Optimal Collusion with Limited Liability and Policy Implications

N/A
N/A
Protected

Academic year: 2022

Partager "Optimal Collusion with Limited Liability and Policy Implications"

Copied!
30
0
0

Texte intégral

(1)

Optimal Collusion with Limited Liability and Policy Implications

Etienne Billette de Villemeur (Toulouse School of Economics, GREMAQ, IDEI) Laurent Flochel (Charles River Associates International)

Bruno Versaevel (EMLYON Business School, GATE)

June 2011

(2)

Objectives

Our objectives are:

1) to characterize the ability of oligopolistic …rms to implement a collusive strategy when their ability to punish deviations over one or several periods is limited;

2) to draw policy implications.

The limited liability constraint formalizes:

structural conditions (e.g., …nite demand);

a regulatory mechanism (e.g., prudential ratio);

…nancial market pressure (e.g., pro…tability target).

(3)

Objectives

Our objectives are:

1) to characterize the ability of oligopolistic …rms to implement a collusive strategy when their ability to punish deviations over one or several periods is limited;

2) to draw policy implications.

The limited liability constraint formalizes:

structural conditions (e.g., …nite demand);

a regulatory mechanism (e.g., prudential ratio);

…nancial market pressure (e.g., pro…tability target).

(4)

Objectives

Our objectives are:

1) to characterize the ability of oligopolistic …rms to implement a collusive strategy when their ability to punish deviations over one or several periods is limited;

2) to draw policy implications.

The limited liability constraint formalizes:

structural conditions (e.g., …nite demand);

a regulatory mechanism (e.g., prudential ratio);

…nancial market pressure (e.g., pro…tability target).

(5)

The Main Results

When the limited liability constraint binds:

there exists an in…nity of optimal multi-period punishment paths that permit …rms to implement a given collusive strategy;

the lowest discount factor for a collusive strategy to be implementable can always be reached with a …nite number of punishment periods;

this discount threshold is strictly lower with a multi-period punishment pro…le than with a single-period punishment scheme;

a longer punishment is only an imperfect substitute for more immediate severity.

As a policy implication, a well-adjusted limited liability constraint can restore competition

by iteration.

(6)

The Main Results

When the limited liability constraint binds:

there exists an in…nity of optimal multi-period punishment paths that permit …rms to implement a given collusive strategy;

the lowest discount factor for a collusive strategy to be implementable can always be reached with a …nite number of punishment periods;

this discount threshold is strictly lower with a multi-period punishment pro…le than with a single-period punishment scheme;

a longer punishment is only an imperfect substitute for more immediate severity.

As a policy implication, a well-adjusted limited liability constraint can restore competition

by iteration.

(7)

The Main Results

When the limited liability constraint binds:

there exists an in…nity of optimal multi-period punishment paths that permit …rms to implement a given collusive strategy;

the lowest discount factor for a collusive strategy to be implementable can always be reached with a …nite number of punishment periods;

this discount threshold is strictly lower with a multi-period punishment pro…le than with a single-period punishment scheme;

a longer punishment is only an imperfect substitute for more immediate severity.

As a policy implication, a well-adjusted limited liability constraint can restore competition

by iteration.

(8)

The Main Results

When the limited liability constraint binds:

there exists an in…nity of optimal multi-period punishment paths that permit …rms to implement a given collusive strategy;

the lowest discount factor for a collusive strategy to be implementable can always be reached with a …nite number of punishment periods;

this discount threshold is strictly lower with a multi-period punishment pro…le than with a single-period punishment scheme;

a longer punishment is only an imperfect substitute for more immediate severity.

As a policy implication, a well-adjusted limited liability constraint can restore competition

by iteration.

(9)

The Model

Symmetric …rms in N = f 1, . . . , n g play a repeated stage-game over t = 1, 2, . . . , ∞.

Initially all …rms play a

m

2 A R

+

for an individual payo¤ π

m

π ( a

m

) in each period.

If a …rm deviates from a

m

in period t, all …rms switch to the punishment action a

P,k

, and earn π ( a

P,k

) π

m

, in period(s) t + 1, . . . , t + k, . . . , t + l , with l 1.

If a …rm deviates from a

P,k

in period t + k, with k = 1, . . . , l , the l-period punishment phase restarts.

Otherwise after l punishment periods all …rms switch back to a

m

.

(10)

The Model

The main assumptions:

(A1) Firms incur a …xed cost f 0, and a variable cost c ( q

i

) 0, to sell substitutable goods (possibly di¤erentiated), with either price (a = p) or quantity (a = q) as a strategic variable;

(A2) Each …rm i ’s inverse demand function p

i

: R

+n

! R

+

is non-increasing and continuous;

(A3) p

i

( 0 ) > c and lim

qi!∞

p

i

( q

i

, q

i

) = 0, any q

i

in R

+n 1

.

(11)

The Model

To compare, the main assumptions in Abreu (1986) are:

(e A1) Firms sell a homogeneous good at constant marginal cost c > 0, and their strategic variable is quantity;

(e A2) The market inverse demand function p ( q ) : R

+

! R

+

is strictly decreasing and continuous in q =

i2N

q

i

;

(e A3) p ( 0 ) > c and lim

q!∞

p ( q ) = 0.

)

q

lim

i!∞

( p ( q ) c ) q

i

= ∞

(12)

The Model

The notation:

a

m

: collusive action

a

NE

: stage-game Nash equilibrium action a

P,k

: punishment action in period k = 1, . . . , l

π ( a ) : stage pro…t when all …rms play the same a (with π

m

π ( a

m

) )

π

di

( a ) : …rm i’s one-shot best reply bene…ts to a as played by all rivals in N nf i g

δ 2 ( 0, 1 ) : discount factor

(13)

The Benchmark

Incentive constraint (no deviation from collusion):

π

di

( a

m

) π

m

δ [ π

m

π ( a

P

)] (IC0 ) Incentive constraint (no deviation from punishment):

π

di

( a

P

) π ( a

P

) δ [ π

m

π ( a

P

)] (IC1) Participation constraint:

( 1 δ ) [ π

m

π ( a

P

)] π

m

(PC )

Limited Liability constraint:

π ( a

P

) π, (LLC)

with π π ( a

P

) .

(14)

The Benchmark

Given a

m

, the single-period punisment δ-minimization problem in a

P

is

a

min

P2A

δ

s.t. IC 0, IC 1, PC, LLC

(15)

The Benchmark

Proposition 1

The collusive action a

m

a

m

is implementable with a single-period punishment if and only if δ δ

1

, with

δ

1

= 8 >

> >

<

> >

> :

δ

π

d i(am) πm

πm π(aP)

if a

P

a

P

, a

P

(regime 1);

δ

π

d i(am) πm

πm π

if a

P

a

P

, a

P

(regime 2);

δ

π

di(am) πm

πm π

if a

P

a

P

, a

P

(regime 3).

(1)

If π > π

m

π

di

( a

m

) π

m

then δ > 1 and a

m

cannot be implemented for any δ.

Remark 1

If a

P

a

P

, a

P

, so that regime 1 applies, δ δ, δ.

(16)

The Multi-Period Setup

If a …rm does not deviate from the punishment path, the continuation pro…ts it earns from period s + 1 onward is

V

s

( a

P

, δ ) =

l k=s+1

δ

k s 1

π ( a

P,k

) +

∞ k=l+1

δ

k s 1

π

m

.

(17)

The Multi-Period Setup

Multi-period Incentive constraints:

π

di

( a

m

) π

m

δ [ V

0

( a

m

, δ ) V

0

( a

P

, δ )] , (MIC 0) and

π

di

( a

P,1

) π ( a

P,1

) δ [ V

1

( a

P

, δ ) V

0

( a

P

, δ )] , . . .

π

di

( a

P,s

) π ( a

P,s

) δ [ V

s

( a

P

, δ ) V

0

( a

P

, δ )] , . . .

π

di

( a

P,l

) π ( a

P,l

) δ [ V

l

( a

P

, δ ) V

0

( a

P

, δ )] ,

(MIC 1, ..., l )

with 1 s l .

(18)

The Multi-Period Setup

Multi-period Participation constraint:

( 1 δ ) [ V

0

( a

m

, δ ) V

s

( a

P

, δ )] π

m

, (MPC) all s = 0, 1, . . . , l.

Multi-period Limited Liability constraint:

π ( a

P,k

) π, (MLLC )

with 1 k l , all l 2, and π π ( a

P

) .

(19)

The Multi-Period Setup

Given all constraints, the multi-period punishment problem is

(aP,1,...,a

min

P,l)2Al

δ

s.t. ( MIC 0 MIC l ) ; MPC; MLLC

(20)

The Multi-Period Setup

Lemma 2

Given a

P,1

, the lowest discount factor δ verifying (MIC 0) and (MIC 1) results from punishment actions a

P,k

, with k > 1, such that these two multi-period incentive constraints bind.

Proposition 2

In the multi-period punishment scheme, if a

P

a

P

, a

P

the collusive action a

m

a

m

is

implementable if and only if δ δ , and a

P

( a

P

, a

m

, . . . , a

m

) is optimal.

(21)

The Multi-Period Setup

Lemma 3

The lowest δ compatible with ( MIC 0 ) and ( MPC ) is δ

π

di(am) πm

πdi(am)

.

Proposition 3

In the multi-period punishment scheme, if a

P

a

P

, a

P

, the collusive action a

m

a

m

is

implementable if and only if δ δ, and a

P

( a

P

, a

m

, . . . , a

m

) is optimal.

(22)

The Multi-Period Setup

Lemma 4

The lowest δ compatible with ( MIC 0 ) and ( MLLC ) is δ

0 π

d i(am) πm

πdi(am) πdi(aP)

.

Proposition 4

In the multi-period punishment scheme, if a

P

a

P

, a

P

collusion at a

m

is implementable

if and only if δ δ

M

sup f δ, δ

0

g , with a

P

( a

P

, a

P,2

, . . . , a

P,l

) of …nite length l .

(23)

The Multi-Period Setup

Remark 4

If ( MLLC ) is strictly binding, that is if a

P

a

P

, a

P

, there exits a continuum of optimal

punishments ( a

P

, a

2

, . . . , a

l

) of …nite length l 2 , s.t. a

m

is implementable for δ = δ

M

.

(24)

The Multi-Period Setup

Proposition 5

If a

P

a

P

, a

P

, and additional punishment periods are introduced, the lowest discount factor δ

M

that permits the implementation of a

m

a

m

cannot be as low as δ , and can attain δ only in particular circumstances. More formally, either a

P

a

P

so that

δ < δ

M

< δ, or a

P

a

P

and δ δ

M

< δ. In the latter case δ

M

= δ if and only if

˜

a

P

a

P

a

P

a

P

.

) l > 1 only an imperfect substitute to early severe punishment

(25)

A Linear Example

Firms in N = f 1, . . . , n g incur a constant marginal cost c 0 to sell q to consumers with utility function

U ( q, I ) =

n i=1

q

i

1 2

n i=1

q

2i

+ 2γ ∑

i6=j

q

i

q

j

! + I ,

all q

i

, q

j

0, j 2 N nf i g , where γ 2 ( 0, 1 ) measures product substitutability.

Limited Liability constraint:

p

i

( q

P

) 0, all i 2 N.

Proposition 6

The parameter space ( c, n, γ ) is partitioned in three subsets where either Regime 1, 2, or

3, as de…ned in ( 1 ) , applies.

(26)

A Linear Example

Regime 1 applies if and only if

(i) 2 n 3; 0 γ 1; 0 c < 1; or (ii) 4 n 5; 0 γ 1; c

0

c < 1; or (iii) 6 n; 0 γ γ; ˆ 0 c < 1; or (iv) 6 n; γ ˆ γ γ; ˇ c

0

c < 1.

Regime 2 applies if and only if 6 n; γ ˇ γ 1; c

00

c < 1.

Regime 3 applies if and only if

(i) n = 3; γ = γ ˆ = 1; c = c = 0; or

(ii) 4 n 5; γ ˆ γ 1; 0 c c

0

; or

(iii) 6 n; γ ˆ γ γ; ˇ 0 c c

0

; or

(iv) 6 n; γ ˇ γ 1; 0 c c

00

.

(27)

A Linear Example

Figure:

Collusion regimes in plane (

c,γ

) for

n

6. The limited liability constraint binds in the

grey area (regime 3). In the benchmark single-period set-up, the collusive quantity is not

implementable below the frontier

.

(28)

Policy Implications

Regulatory constraint:

π ( a ) π

R

, (R)

with π

R

π ( a

R

) , and a

P

a

R

a

m

, implying that π π

R

π

m

.

Proposition 8

Suppose that …rms implement a

m

a

NE

. By setting a price ‡oor slightly below the

observed transaction price, and by reducing the ‡oor incrementally by iteration, the

regulator drives the industry to the stage-game Nash equilibrium a

NE

.

(29)

Policy Implications

Figure:

Cournot linear setup (n = 5,

γ

= 1,

c

= 1/10,

δ

= 3/5). Initially, all …rms implement

qm

. A price ‡oor rules out large price reductions (i.e.,

q q

R,1

, with

q

R,1

above

qm

, but only limitedly so). A series of successive adjustments from

q

R,1

to

q

R,2

,

q

R,3

, ... drives the industry

toward the stage-game Nash equilibrium (point

N

) .

(30)

Policy Implications

Lemma 5

Consider any implementable collusive action a

m

. Then a

R

a

NE

implies that a

m

a

R

.

***

Références

Documents relatifs

surface des différents types de fibres : 1 (lente, oxydatif), IIA (rapide, oxydo-glycolytique), IIB (rapide, glycolytique) et IIC (rapide et lente, oxydo- glycolytique)

Many strategies have been developed to unravel the dynamics of reactive systems in this region, especially in the case of electron transfer reactions (see Ref. [2] and

By taking a cursory outlook on the regional planning in Japan from Meiji Era to the present time were possible to construct a full picture regarding the influence major

Finally, on each plot, three individual plants were collected and their root system extracted from the soil; aboveground organs and roots were pooled, to describe the “mean plant” of

We show that technological change affects the quality distribu- tion of entrepreneurship by increasing the ex-ante number of entrepreneurs undertaking the most efficient projects

Under exogenous technological change, we show that above a threshold level, rapid technological progress increases the number of entrepreneurs undertaking the

Les « urukéens » se seraient installés dans la région de fa ço n pacifique, non impérialiste nous dit-on, afin d 'y contrôler les échanges, gardant leur propre

Compared to the parameters used in the simulations we can see that the estimated rate of recombination is high enough ( ^ρ &gt;10 for most locus- population combinations) to