Sowing doubt optimally in two-person repeated games

Consider a two-person repeated game, where one of the players, P1, can sow doubt, in the mind of his opponent, as to what Fl's payoffs are. This results in a two-person repeated game with incomplete information. By sowing doubt, P1 can sometimes increase his minimal equilibrium payoff in the original game. We prove that this minimum is maximal when only one payoff matrix, the negative of the payoff matrix of the opponent, is added (the opponent thus believes that he might play a zero-sum game). We obtain two formulas for calculating this maximal minimum payoff. Journal of Economic Literature Classification Numbers: C7, D8. (C) 1999 Academic Press.