Extended Conversations in Sender-Receiver Games
AbstractAumann and Hart (Econometrica, Nov. 2003) have shown that in games of one-sided incomplete information, the set of equilibrium outcomes achievable can be expanded considerably if the players are allowed to communicate without exogenous time limits and completely characterise the equilibria from such communication. Their research provokes (at least) four questions. (i) Is it true that the set of equilibriumpayoffs stabilises (i.e. remains unchanged) if there are sufficiently many rounds of communication? (ii) Is the set of equilibria from communication which is unbounded but finite with probability one is the same as equilibria from communication which is just unbounded? (iii) Are any of these sets of equilibria “simple” and if so, is there an algorithm to compute them? (iv) Does unbounded communication (of order type w) exhaust all possibilities so that further communication is irrelevant? We show that in the context of finite Sender-Receiver games, the answer to all four is yes if the game satisfies a certain geometric condition. We then relate this condition to some geometric facts about the notion of bi-convexity and argue that if any of the questions has a negative answer then all three of the questions are likely to have a negative answer.
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 Edinburgh School of Economics, University of Edinburgh in its series ESE Discussion Papers with number 126.
Date of creation: Oct 2004
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2004-10-18 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lehrer, Ehud & Sorin, Sylvain, 1997.
"One-Shot Public Mediated Talk,"
Games and Economic Behavior,
Elsevier, vol. 20(2), pages 131-148, August.
- HART, Sergiu, . "Nonzerosum two-person repeated games with incomplete information," CORE Discussion Papers RP -636, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Robert J. Aumann & Sergiu Hart, 2002.
"Long Cheap Talk,"
Discussion Paper Series
dp284, The Center for the Study of Rationality, Hebrew University, Jerusalem, revised Nov 2002.
- Amparo Urbano & Jose E. Vila, 2002. "Computational Complexity and Communication: Coordination in Two-Player Games," Econometrica, Econometric Society, vol. 70(5), pages 1893-1927, September.
- Myerson, Roger B, 1986.
"Multistage Games with Communication,"
Econometric Society, vol. 54(2), pages 323-58, March.
- Blume Andreas & Sobel Joel, 1995.
"Communication-Proof Equilibria in Cheap-Talk Games,"
Journal of Economic Theory,
Elsevier, vol. 65(2), pages 359-382, April.
- Blume, A. & Sobel, J., 1991. "Communication-Proof Equilibria in Cheap-Talk Games," Working Papers 91-27, University of Iowa, Department of Economics.
- Blume, Lawrence E & Zame, William R, 1994.
"The Algebraic Geometry of Perfect and Sequential Equilibrium,"
Econometric Society, vol. 62(4), pages 783-94, July.
- Lawrence E. Blume & William R. Zame, 1993. "The Algebraic Geometry of Perfect and Sequential Equilibrium," Game Theory and Information 9309001, EconWPA.
- Bester, Helmut & Strausz, Roland, 2001. "Contracting with Imperfect Commitment and the Revelation Principle: The Single Agent Case," Econometrica, Econometric Society, vol. 69(4), pages 1077-98, July.
- Rubinstein, Ariel, 1991. "Comments on the Interpretation of Game Theory," Econometrica, Econometric Society, vol. 59(4), pages 909-24, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Gina Reddie).
If references are entirely missing, you can add them using this form.