Advanced Search
MyIDEAS: Login

Extended Conversations in Sender-Receiver Games

Contents:

Author Info

  • R. Vijay Krishna

    ()

Registered author(s):

    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 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 Info

    If 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.
    File URL: http://www.econ.ed.ac.uk/papers/lct1.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Edinburgh School of Economics, University of Edinburgh in its series ESE Discussion Papers with number 126.

    as in new window
    Length: 39
    Date of creation: Oct 2004
    Date of revision:
    Handle: RePEc:edn:esedps:126

    Contact details of provider:
    Postal: 31 Buccleuch Place, EH8 9JT, Edinburgh
    Phone: +44(0)1316508361
    Fax: +44(0)1316504514
    Web page: http://www.econ.ed.ac.uk/
    More information through EDIRC

    Related research

    Keywords:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    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.:
    as in new window
    1. 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.
    2. 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.
    3. Ehud Lehrer & Sylvain Sorin, 1994. "One-Shot Public Mediated Talk," Discussion Papers 1108, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Blume, A. & Sobel, J., 1991. "Communication-Proof Equilibria in Cheap-Talk Games," Working Papers 91-27, University of Iowa, Department of Economics.
    5. Lawrence E. Blume & William R. Zame, 1993. "The Algebraic Geometry of Perfect and Sequential Equilibrium," Game Theory and Information 9309001, EconWPA.
    6. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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 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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.