A folk theorem for minority games |
| |
Authors: | Jrme Renault Sergio Scarlatti Marco Scarsini |
| |
Institution: | aCEREMADE, Université Paris Dauphine, Pl. du Marechal de Lattre de Tassigny, F–75775 Paris cedex 16, France;bDipartimento di Scienze, Università D'Annunzio, Viale Pindaro 42, I–65127 Pescara, Italy;cDipartimento di Statistica e Matematica Applicata, Università di Torino, Piazza Arbarello 8, I–10122 Torino, Italy |
| |
Abstract: | We study a particular case of repeated games with public signals. In the stage game an odd number of players have to choose simultaneously one of two rooms. The players who choose the less crowded room receive a reward of one euro (whence the name “minority game”). The players in the same room do not recognize each other, and between the stages only the current majority room is publicly announced. We show that in the infinitely repeated game any feasible payoff can be achieved as a uniform equilibrium payoff, and as an almost sure equilibrium payoff. In particular we construct an inefficient equilibrium where, with probability one, all players choose the same room at almost all stages. This equilibrium is sustained by punishment phases which use, in an unusual way, the pure actions that were played before the start of the punishment. |
| |
Keywords: | Repeated games Imperfect monitoring Public signals |
本文献已被 ScienceDirect 等数据库收录! |
|