Computationally restricted unmediated talk under incomplete information

Amparo Urbano and Jose Vila ()

Economic Theory, 2004, vol. 23, issue 2, 283-320

Abstract: We show the role of unmediated talk with computational complexity bounds as both an information transmission and a coordination device for the class of two-player games with incomplete information and rational parameters. We prove that any communication equilibrium payoff of such games can be reached as a Bayesian-Nash equilibrium payoff of the game extended by a two phase universal mechanism of interim computationally restricted pre-play communication. The communication protocols are designed with the help of modern cryptographic tools. A familiar context in which our results could be applied is bilateral trading with incomplete information. Copyright Springer-Verlag Berlin/Heidelberg 2004

Keywords: Computational complexity; Unmediated communication; Correlated equilibrium; Bayesian-Nash equilibrium. (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-003-0378-z (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joecth:v:23:y:2004:i:2:p:283-320

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

DOI: 10.1007/s00199-003-0378-z

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().