Maintaining A Reputation Against A Patient Opponent

We analyze reputation in a game between a patient player 1 and a nonmyopic but less patient opponent, player 2. Player 1’s type is private information and he may be a "commitment type" who is locked into playing a particular strategy. We assume that players do not directly observe each other's action but rather see an imperfect signal of it. In particular, we assume that the support of the distribution of signals is independent of how player 2 plays. We show that in any Nash equilibrium of the game player 1 will get a payoff close to the largest payoff consistent with player 2 choosing a best response in a finite truncation of the game. Moreover, we show that if the discount factor of player 2 is sufficiently large then player 1 will essentially get the maximum payoff consistent with player 2 getting at least his pure strategy minmax payoff in any Nash equilibrium. 1 The authors are grateful for financial support from NSF grants SBR-9223320 and SBR-9223175, DGICYT and the UCLA Academic Senate. Departments of Economics Universidad Carlos III de Madrid, Harvard, UCLA and Northwestern.