Extended Conversations in Sender-Receiver Games
Aumann 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 equilibrium payoffs 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.
|Date of creation:||Sep 2004|
|Contact details of provider:|| Postal: 31 Buccleuch Place, EH8 9JT, Edinburgh|
Web page: http://www.econ.ed.ac.uk/
More information through EDIRC
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.:
- Blume, A. & Sobel, J., 1991.
"Communication-Proof Equilibria in Cheap-Talk Games,"
91-27, University of Iowa, Department of Economics.
- 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, Lawrence E & Zame, William R, 1994.
"The Algebraic Geometry of Perfect and Sequential Equilibrium,"
Econometric Society, vol. 62(4), pages 783-794, July.
- Lawrence E. Blume & William R. Zame, 1993. "The Algebraic Geometry of Perfect and Sequential Equilibrium," Game Theory and Information 9309001, EconWPA.
- Sergiu Hart, 1985.
"Nonzero-Sum Two-Person Repeated Games with Incomplete Information,"
Mathematics of Operations Research,
INFORMS, vol. 10(1), pages 117-153, February.
- HART, Sergiu, "undated". "Nonzerosum two-person repeated games with incomplete information," CORE Discussion Papers RP 636, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- repec:cor:louvrp:-636 is not listed on IDEAS
- 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-1098, July.
- Roger B. Myerson, 1984.
"Multistage Games with Communication,"
590, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Robert J. Aumann & Sergiu Hart, 2002.
"Long Cheap Talk,"
Discussion Paper Series
dp284, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem, revised Nov 2002.
- Rubinstein, Ariel, 1991. "Comments on the Interpretation of Game Theory," Econometrica, Econometric Society, vol. 59(4), pages 909-924, July.
- 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.
- Lehrer, Ehud & Sorin, Sylvain, 1997.
"One-Shot Public Mediated Talk,"
Games and Economic Behavior,
Elsevier, vol. 20(2), pages 131-148, August.
When requesting a correction, please mention this item's handle: RePEc:edn:esedps:126. See general information about how to correct material in RePEc.
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.