Online Matching Pennies
AbstractWe study a repeated game in which one player, the prophet, acquires more information than another player, the follower, about the play that is going to be played. We characterize the optimal amount of information that can be transmitted online by the prophet to the follower, and provide applications to repeated games played by finite automata, and by players with bounded recall.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp316.
Length: 17 pages
Date of creation: May 2003
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2003-05-29 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Hernández, Penélope & Urbano, Amparo, 2008.
"Codification schemes and finite automata,"
Mathematical Social Sciences,
Elsevier, vol. 56(3), pages 395-409, November.
- Aurora García-Gallego & Penélope Hernández-Rojas & Amalia Rodrigo-González, 2013. "Endogenous vs. Exogenous Transmission of Information: An Experiment," Working Papers 2013/06, Economics Department, Universitat Jaume I, Castellón (Spain).
- Scarsini, Marco & Renault, Jérôme & Tomala, Tristan, 2008.
"Playing off-line games with bounded rationality,"
Economics Papers from University Paris Dauphine
123456789/6127, Paris Dauphine University.
- Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Center for the Study of Rationality, Hebrew University, Jerusalem.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).
If references are entirely missing, you can add them using this form.