• No results found

Appendix: Proofs

In document When is Reputation Bad? (Page 37-47)

Lemma 1: If H is a positive probability history in which T Y 9 ‰  occurs in period T and NHT ;  =2& b H then B  H FT p H for some friendlyF .

Proof: Given HT the short-run players’ profile has positive probability on a profile that does not exit. At such profiles B  H FT p H for some friendly f . Since NHT ;  =2& b H we see that B  H FT p H H  p H .

; We will let P \¸ HT  ¸S \ BHT C HT denote probability

distributions over signals induced by the equilibrium strategies at history HT; similarly

 e 

 \  T  ; =  \  T T P¸ 2. H 

œ

R‰2NH R S¸ A R C H

denotes the equilibrium distribution on signals conditional on R being in the set e2of types that are committed to actions in . . The probability distribution on "

induced by a mixed profile C can be written as a convex combination of the component distributions C%, which has support entirely in " % , and C ,% which has support entirely in %. Then MC%  M C induces the same distribution over " as C HT , where C HT Š CONHULL%, M  . Although, C% and C need not correspond to mixed strategy profiles (since they can have% correlation), we may still write U, B C%   \ V HT B C% S¸ B C% and so forth for the expected values of U,   \ BB V HT BB S¸ BB with respect to the weights C , and similarly for % C . With that in mind, let%

  

 \ T  \  T % T

P ENTRY H¸   ¸S BH C H be the distribution of signals after history HT, given that the realization of the short-run players’ (equilibrium) action is an entry profile, and let S \ ¸ A ENTRY H T  ¸S \ A C%HT .

Lemma 2: In a bad reputation game, if H is a positive probability history withT respect to a Nash equilibrium, and the signals in H all lie in T 9% ƒ9

a) At most K K LOG  ;  =  OG N 2. L

Z  Z R

of the signals are

Since signals in 9 convey no information about the long-run player's type, it% follows that if all signals lie in 9E ƒ9, and signals in 9 occur K times, then

then N ; =HT 2 p Z

, so in all subsequent periods the signal must be an exit signal.

(Recall that in a bad reputation game, r>1; this implies that the denominator above is not zero.) Again because r>1, it is sufficient that

which is the condition in part a).

We now turn to part b). For any history H on the equilibrium path at which entry occurs with positive probability, we must have B  H F p H for some friendly F . By assumption every enforceable friendly action is vulnerable to temptation, so that conditional on entry, the total probability of each bad signal Y 9 ‰  is at least KH at such a history h. In particular, consider any history HU after which a bad signal Y occurs. Since bad signals are entry signals, entry must have had positive probability at HU, and hence conditional on entry, Y had total probability at least KH. Bayes’ rule then implies

 ; = HU HU  ; =

Bayes’ rule gives us the following inequalities

 

where the last inequality comes from the assumption that F and N are disjoint.

Divide the first inequality by the second and apply the definition of r to get

Finally, we define κ by the following equation



Our commitment size assumption is that

With these preliminaries in hand, we can conclude the proof. First suppose that



and we are done. On the other hand, the opposite inequality implies by (1.2) and

B  for some vulnerable friendly actionF with temptation bounds S ,ρ then

 T MAXY 9 H T     T

V H b ‰ EU Y S E Y V H YS .

Proof: We need to calculate the long-run player payoff separately as a function of whether the run players exit or not. Using the decomposition of the short-run players’ profile that we introduced before the proof of lemma 2, we write

 T  T %   T % V H MV H F C M V H F C .

First assume λ≥0 and consider the value V H F C T % conditional on exit.

By exit minmax, this value is no more than maxy Y h ( t)δv h y( , )t and thus from the definition of U we can conclude that

 MAX     

T % Y 9 HT T

V H F C b ‰ E U Y S E Y V H YS .

If C [ ]H %T  then  λ =1 and we are done with the first case in the statement.

Now consider now the second case in the claim of the lemma

 [ ]H %T 

C  and B  H FT   for some vulnerable friendly actionF with

temptation bounds S ,ρ. In this case, λ<1. Let d be a temptation for F . Since F is played in equilibrium, it earns at least as much as d, so that

< > < >

and f induce the same distribution over signals, and hence earn identical continuation values, and by the definition of a temptation, U D, C% pU F, C% , so that d does at least as well in the current period. Thus,

 T %  T % 

The inequality holds because continuation values for histories on the equilibrium path of a Nash equilibrium must exceed the minmax value, which we have normalized to zero. We will use this fact repeatedly in the remainder of the proof.

By the definition of a temptation, S \ Y B C%  S \ Y F C% for each Y. Thus, inequality (1.5) can be reduced to

< >

where the second inequality uses part 2 of the definition of a temptation. We can now expand the definition of V H F C T % and bound it as follows.



Proof: The proof of Lemma 3S is similar to that of lemma 3; indeed the case



M  is identical, and when M  the derivation of equation (1.5) is unchanged

< >

Since the good signals are changed proportionately by the temptation, it follows

that  < \

is the expected continuation value after playing f and observing a signal in Y Y\ 

From the fact that d reduces the probability of every bad signal by a positive amount,

  \  \ 

Because D lowers the probability of all bad signals by at least ρ, it raises the total probability of the remaining signals by at least Y ρ, that is,

 < \ 9 9 D %  < \ 9 9 F % 9

S C S C S

   ¯ p

¢   ± 

. This and the fact that the numerator on the right hand side of the previous inequality is non-negative gives

 

References

Ely, J. and J. Valimaki [2002] “Bad Reputation,” NAJ Economics, 4: 2, http://www.najecon.org/v4.htm and forthcoming Quarterly Journal of Economics

Fudenberg, D. and D. Kreps [1987] “Reputation and Simultaneous Opponents"

Review of Economic Studies, 54: 541-568

Fudenberg, D., D. Kreps, and E. Maskin [1990] “Repeated Games with Long-run and Short-Long-run Players," Review of Economic Studies, 57, 555-573.

Fudenberg, D. and D. K. Levine [1994] “Efficiency and Observability in Games with Long-Run and Short-Run Players," Journal of Economic Theory, 62 , 103-135

Fudenberg, D. and D. K. Levine [1992] “Maintaining a Reputation when Strategies are Imperfectly Observed,” Review of Economic Studies, 59:

561-579.

Fudenberg, D. and D. K. Levine [1989] “Reputation and Equilibrium Selection in Games with a Single Long-Run Player" Econometrica, 57: 759-778.

Fudenberg, D., E. Maskin, and D.K. Levine [1994] "The Folk Theorem in Repeated Games with Imperfect Public Information," Econometrica 62, 997-1039.

Kreps, D. and R. Wilson [1982] “Reputation and Imperfect Information,” Journal of Economic Theory, 27:253-279.

Milgrom, P. and J. Roberts [1982] “Predation, Reputation, and Entry Deterrence,”

Journal of Economic Theory, 27:280-213.

Sorin, S. [1999] Merging, Reputation, and Repeated Games with Incomplete Information,” Games and Economic Behavior 29, 274-308

In document When is Reputation Bad? (Page 37-47)

Related documents