Long Cheap Talk 1

STRATEGIC INFORMATION TRANSMISSION has been studied in economic theory for over a quarter of a century. Most formal models in this area allow for at most one message from each player. Yet in practice, as in negotiation or bargaining, protracted exchanges of messages are often observed. Does this make economic sense? Can a long exchange convey substantive information that cannot be conveyed by a single message? Here we examine this question in the context of “cheap talk.” The answer is “yes”: Long cheap talk may lead to outcomes preferred by all players to those achievable with single messages. We will characterize all the equilibrium outcomes to which it can lead, in any two-person game in which one player is initially better informed than the other. Cheap talk is just that: cheap—neither costly nor binding; and talk— not some roundabout form of communication, like mediation. Unlike “signalling,”2 cheap talk—plain conversation—is “payoff-irrelevant;” there is no “credibility cost.” The players don’t strike, don’t get educated, and don’t issue guarantees; they simply talk. They may or may not tell the truth, and may or may not believe each other. To be sure, that there is no credibility cost does not mean that there is no credibility; depending on the circumstances, the cheap talk may itself create positive motivation for the players to believe each other (Examples 2.1 and 2.2 below). It is this motivation that forms the crux of our analysis. In a sense, cheap talk is communication in its purest and simplest form: purest in that there is no direct impact on the payoff, and simplest in that there is no intermediary. The literature on cheap talk addresses two issues, almost diametrically opposite. One is how cheap talk restricts the set of outcomes—equilibrium refinement; see Section 10. The other is how cheap talk expands the set of outcomes.

[1]  J. Morgan,et al.  Cheap Talk , 2005 .

[2]  Dino Gerardi,et al.  Unmediated Communication in Games with Complete and Incomplete Information , 2002, J. Econ. Theory.

[3]  S. Baliga,et al.  Arms Races and Negotiations , 2002 .

[4]  Robert Samuel Simon Separation of joint plan equilibrium payoffs from the min-max functions , 2002, Games Econ. Behav..

[5]  José E. Vila,et al.  Computational complexity and communication: Coordination in two-player games , 2002 .

[6]  Stephen Morris,et al.  Co-ordination, Spillovers, and Cheap Talk , 2002, J. Econ. Theory.

[7]  J. Morgan,et al.  The Art of Conversation , 2002 .

[8]  Microeconomics-Charles W. Upton Repeated games , 2020, Game Theory.

[9]  R. Aumann The Rationale for Measurability , 2001 .

[10]  Marco Battaglini,et al.  Multiple Referrals and Multidimensional Cheap Talk , 2002 .

[11]  E. Damme,et al.  Non-Cooperative Games , 2000 .

[12]  Abhijit Banerjee,et al.  Neutrally Stable Outcomes in Cheap-Talk Coordination Games , 2000, Games Econ. Behav..

[13]  Ran Canetti,et al.  Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.

[14]  Elchanan Ben-Porath,et al.  Correlation without Mediation: Expanding the Set of Equilibrium Outcomes by "Cheap" Pre-play Procedures , 1998 .

[15]  Ehud Lehrer,et al.  One-Shot Public Mediated Talk , 1997 .

[16]  I. Zapater Credible Proposals in Communication Games , 1997 .

[17]  Mor Amitai Cheap- Talk with Incomplete Information on Both Sides , 1996 .

[18]  J. Sobel,et al.  AN EVOLUTIONARY APPROACH TO PRE-PLAY COMMUNICATION , 1995 .

[19]  Andreas Blume,et al.  Communication-Proof Equilibria in Cheap-Talk Games , 1995 .

[20]  Roger B. Myerson,et al.  Communication, correlated equilibria and incentive compatibility , 1994 .

[21]  Andreas Blume,et al.  Evolutionary Stability in Games of Communication , 1993 .

[22]  Joseph Farrell Meaning and Credibility in Cheap-Talk Games , 1993 .

[23]  K. Wärneryd Cheap Talk, Coordination, and Evolutionary Stability , 1993 .

[24]  Joel Sobel,et al.  Deviations, Dynamics and Equilibrium Refinements , 1993 .

[25]  Imre Bárány,et al.  Fair Distribution Protocols or How the Players Replace Fortune , 1992, Math. Oper. Res..

[26]  Steven A. Matthews,et al.  Refining cheap-talk equilibria , 1991 .

[27]  Leonid A. Levin,et al.  Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.

[28]  A J Robson,et al.  Efficiency in evolutionary games: Darwin, Nash and the secret handshake. , 1990, Journal of theoretical biology.

[29]  M. Rabin Communication between Rational Agents , 1990 .

[30]  F. Forges,et al.  Equilibria with Communication in a Job Market Example , 1990 .

[31]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[32]  Avi Wigderson,et al.  Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.

[33]  S. Hart,et al.  Bi-convexity and bi-martingales , 1986 .

[34]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[35]  Sergiu Hart,et al.  Nonzero-Sum Two-Person Repeated Games with Incomplete Information , 1985, Math. Oper. Res..

[36]  J. Sobel,et al.  STRATEGIC INFORMATION TRANSMISSION , 1982 .

[37]  A. Zahavi Mate selection-a selection for a handicap. , 1975, Journal of theoretical biology.

[38]  R. Aumann Subjectivity and Correlation in Randomized Strategies , 1974 .

[39]  W. Hildenbrand Core and Equilibria of a Large Economy. , 1974 .

[40]  R. Aumann Borel structures for function spaces , 1961 .

[41]  H. W. Kuhn,et al.  11. Extensive Games and the Problem of Information , 1953 .