2003
DOI: 10.1016/s0022-0531(02)00011-x
|View full text |Cite
|
Sign up to set email alerts
|

Cheap talk in games with incomplete information

Abstract: The paper studies Bayesian games which are extended by adding pre-play communication.Let Γ be a Bayesian game with full support and with three or more players. The main result is that if players can send private messages to each other and make public announcements then every communication equilibrium outcome, q, that is rational (i.e., involves probabilities that are rational numbers) can be implemented in a sequential equilibrium of a cheap talk extension of Γ, provided that the following condition is satisfi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
66
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 82 publications
(66 citation statements)
references
References 14 publications
0
66
0
Order By: Relevance
“…For one thing, work has continued on secret sharing and multiparty computation, taking faulty and rational behavior into account (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Dani, Movahedi, Rodriguez, and Saia 2011;Fuchsbauer, Katz, and Naccache 2010;Gordon and Katz 2006;Lysyanskaya and Triandopoulos 2006]). There has also been work on when and whether a problem that can be solved with a trusted third party can be converted to one that can be solved using cheap talk, without a third party, a problem that has also attracted the attention of game theorists (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Abraham, Dolev, and Halpern 2008;Barany 1992;Ben-Porath 2003;Dodis, Halevi, and Rabin 2000;Forges 1990;Heller 2005;Izmalkov, Lepinski, and Micali 2011;Lepinski, Micali, Peikert, and Shelat 2004;McGrew, Porter, and Shoham 2003;Shoham and Tennenholtz 2005;Urbano and Vila 2002;Urbano and Vila 2004]). This is relevant because there are a number of well-known distributed computing problems that can be solved easily by means of a "trusted" mediator.…”
Section: Introductionmentioning
confidence: 99%
“…For one thing, work has continued on secret sharing and multiparty computation, taking faulty and rational behavior into account (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Dani, Movahedi, Rodriguez, and Saia 2011;Fuchsbauer, Katz, and Naccache 2010;Gordon and Katz 2006;Lysyanskaya and Triandopoulos 2006]). There has also been work on when and whether a problem that can be solved with a trusted third party can be converted to one that can be solved using cheap talk, without a third party, a problem that has also attracted the attention of game theorists (e.g., [Abraham, Dolev, Gonen, and Halpern 2006;Abraham, Dolev, and Halpern 2008;Barany 1992;Ben-Porath 2003;Dodis, Halevi, and Rabin 2000;Forges 1990;Heller 2005;Izmalkov, Lepinski, and Micali 2011;Lepinski, Micali, Peikert, and Shelat 2004;McGrew, Porter, and Shoham 2003;Shoham and Tennenholtz 2005;Urbano and Vila 2002;Urbano and Vila 2004]). This is relevant because there are a number of well-known distributed computing problems that can be solved easily by means of a "trusted" mediator.…”
Section: Introductionmentioning
confidence: 99%
“…Starting with Forges (1990) and Bárány (1992), a body of literature, including Urbano and Vila (2002), Ben-Porath (2003), and Gerardi (2004), studies models of decentralized communication. An important conclusion of this literature is that-under various assumptions-all communication equilibria can be implemented through preplay decentralized communication procedures.…”
mentioning
confidence: 99%
“…5 As a result, the firms are not doing as well as they could in a cartel with enforcement power. 6 Our results have two implications for competition policy. First, they add a new aspect to the question of whether firms should be allowed to exchange disaggregated versus aggregate data.…”
mentioning
confidence: 86%