IDEAS home Printed from https://ideas.repec.org/p/edn/esedps/126.html
   My bibliography  Save this paper

Extended Conversations in Sender-Receiver Games

Author

Abstract

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.

Suggested Citation

  • R. Vijay Krishna, 2004. "Extended Conversations in Sender-Receiver Games," ESE Discussion Papers 126, Edinburgh School of Economics, University of Edinburgh.
  • Handle: RePEc:edn:esedps:126
    as

    Download full text from publisher

    File URL: http://www.econ.ed.ac.uk/papers/id126_esedps.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Ben-Porath, Elchanan, 1998. "Correlation without Mediation: Expanding the Set of Equilibrium Outcomes by "Cheap" Pre-play Procedures," Journal of Economic Theory, Elsevier, vol. 80(1), pages 108-122, May.
    2. Rubinstein, Ariel, 1991. "Comments on the Interpretation of Game Theory," Econometrica, Econometric Society, vol. 59(4), pages 909-924, July.
    3. 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.
    4. Blume Andreas & Sobel Joel, 1995. "Communication-Proof Equilibria in Cheap-Talk Games," Journal of Economic Theory, Elsevier, vol. 65(2), pages 359-382, April.
    5. Blume, Lawrence E & Zame, William R, 1994. "The Algebraic Geometry of Perfect and Sequential Equilibrium," Econometrica, Econometric Society, vol. 62(4), pages 783-794, July.
    6. Ben-Porath, Elchanan, 2003. "Cheap talk in games with incomplete information," Journal of Economic Theory, Elsevier, vol. 108(1), pages 45-71, January.
    7. Robert J. Aumann & Sergiu Hart, 2003. "Long Cheap Talk," Econometrica, Econometric Society, vol. 71(6), pages 1619-1660, November.
      • 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.
    8. Sergiu Hart, 1985. "Nonzero-Sum Two-Person Repeated Games with Incomplete Information," Mathematics of Operations Research, INFORMS, vol. 10(1), pages 117-153, February.
    9. repec:cor:louvrp:-636 is not listed on IDEAS
    10. Lehrer, Ehud & Sorin, Sylvain, 1997. "One-Shot Public Mediated Talk," Games and Economic Behavior, Elsevier, vol. 20(2), pages 131-148, August.
    11. 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.
    12. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    Full references (including those not matched with items on IDEAS)

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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: (Research Office). General contact details of provider: http://edirc.repec.org/data/deediuk.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.