EconPapers    
Economics at your fingertips  
 

A folk theorem for minority games

Jérôme Renault, Sergio Scarlatti () and Marco Scarsini

ICER Working Papers - Applied Mathematics Series from ICER - International Centre for Economic Research

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”). Between the stages, only the current majority room is publicly announced. We show that in the infinitely repeated game any feasible payo can be achieved as a uniform equilibrium payo , and as an almost sure equilibrium payo . 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 a unusual way, the pure actions that were played before start of the punishment.

Keywords: Repeated games; imperfect monitoring; public signals (search for similar items in EconPapers)
Pages: 26 pages
Date: 2003-01
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.bemservizi.unito.it/repec/icr/wp2003/Scarsini10-03.pdf (application/pdf)

Related works:
Journal Article: A folk theorem for minority games (2005) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:icr:wpmath:10-2003

Access Statistics for this paper

More papers in ICER Working Papers - Applied Mathematics Series from ICER - International Centre for Economic Research Corso Unione Sovietica, 218bis - 10134 Torino - Italy. Contact information at EDIRC.
Bibliographic data for series maintained by Daniele Pennesi ().

 
Page updated 2025-03-30
Handle: RePEc:icr:wpmath:10-2003