Cheap talk

In game theory, cheap talk is communication between players which does not directly affect the payoffs of the game. Providing and receiving information is free. This is in contrast to signaling in which sending certain messages may be costly for the sender depending on the state of the world.

One actor has information and the other has ability to act. The informed player can choose strategically what to say and what not to say. Things become interesting when the interests of the players are not aligned. The classic example is of an expert (say, an ecologist) trying to explain the state of the world to an uninformed decision maker (say, politician voting on a deforestation bill). The decision maker, after hearing the report from the expert, must then make a decision which affects the payoffs of both players.

This basic setting set by Crawford and Sobel^[1] has given rise to a variety of variants.

To give a formal definition, cheap talk is communication that is:^[2]

costless to transmit and receive
non-binding (i.e. does not limit strategic choices by either party)
unverifiable (i.e. cannot be verified by a third party like a court)

Therefore an agent engaging in cheap talk could lie with impunity, but may choose in equilibrium not to do so.

Crawford and Sobel's original article

Setting

In the basic form of the game, there are two players communicating, one sender S and one receiver R.

Type. Sender S gets knowledge of the state of the world or of his "type" t. Receiver R does not know t ; he has only ex-ante beliefs about it, and relies on a message from S to possibly improve the accuracy of his beliefs.

Message. S decides to send message m. Message m may disclose full information, but it may also give limited, blurred information: it will typically say "The state of the world is between t₁ and t₂". It may give no information at all.

The form of the message does not matter, as long as there is mutual understanding, common interpretation. It could be a general statement from a central bank’s chairman, a political speech in any language, etc. Whatever the form, it is eventually taken to mean "The state of the world is between t₁ and t₂".

Action. Receiver R receives message m. R updates his beliefs about the state of the world given new information that he might get, using Bayes's rule. R decides to take action a. This action impacts both his own utility and the sender’s utility.

Utility. The decision of S regarding the content of m is based on maximizing his utility, given what he expects R to do. Utility is a way to quantify satisfaction or wishes. It can be financial profits, or non-financial satisfaction—for instance the extent to which the environment is protected.

→ Quadratic utilities:
The respective utilities of S and R can be specified by the following: $U^{S}(a,t)=-(a-t-b)^{2}$ $U^{R}(a,t)=-(a-t)^{2}$
The theory applies to more general forms of utility, but quadratic preferences makes exposition easier. Thus S and R have different objectives if b ≠ 0. Parameter b is interpreted as conflict of interest between the two players, or alternatively as bias.

U^R is maximized when a = t, meaning that the receiver wants to take action that matches the state of the world, which he does not know in general. U^S is maximized when a = t + b, meaning that S wants a slightly higher action to be taken. Since S does not control action, S must obtain the desired action by choosing what information to reveal. Each player’s utility depends on the state of the world and on both players’ decisions that eventually lead to action a.

Nash equilibrium. We look for an equilibrium where each player decides optimally, assuming that the other player also decides optimally. Players are rational, although R has only limited information. Expectations get realized, and there is no incentive to deviate from this situation.

Theorem

Crawford and Sobel characterize possible Nash equilibria.

There are typically multiple equilibria, but in a finite number.
Separating, which means full information revelation, is not a Nash equilibrium.
Babbling, which means no information transmitted, is always an equilibrium outcome.

When interests are aligned, then information is fully disclosed. When conflict of interest is very large, all information is kept hidden. These are extreme cases. The model allowing for more subtle case when interests are close, but different and in these cases optimal behavior leads to some but not all information being disclosed, leading to various kinds of carefully worded sentences that we may observe.

More generally :
There exists N^* > 0 such that for all N with 1 ≤ N ≤ N^*,

there exists at least an equilibrium in which the set of induced actions has cardinality N; and moreover

there is no equilibrium that induces more than N^* actions.

Messages. While messages could ex-ante assume an infinite number of possible values µ(t) for the infinite number of possible states of the world t, actually they may take only a finite number of values (m₁, m₂, . . . , m_N).

Thus an equilibrium may be characterized by a partition (t₀(N), t₁(N). . . t_N(N)) of the set of types [0, 1], where 0 = t₀(N) < t₁(N) < . . . < t_N(N) = 1. This partition is shown on the top right segment of Figure 1.

The t_i(N)’s are the bounds of intervals where the messages are constant: for t_i-1(N) < t < t_i(N), µ(t) = m_i.

Actions. Since actions are functions of messages, actions are also constant over these intervals: for t_i-1(N) < t < t_i(N), α(t) = α(m_i) = a_i.

The action function is now indirectly characterized by the fact that each value a_i optimizes return for the R, knowing that t is between t₁ and t₂. Mathematically (assuming that t is uniformly distributed over [0, 1]),

$a_{i}={\bar {a}}(t_{i-1},t_{i})=\mathrm {arg} \max _{a}\int _{t_{i-1}}^{t_{i}}U^{R}(a,t)dt$

→ Quadratic utilities:
Given that R knows that tis between t_i-1 and t_i, and in the special case quadratic utility where R wants action a to be as close to t as possible, we can show that quite intuitively the optimal action is the middle of the interval:
$a_{i}={\frac {t_{i-1}+t_{i}}{2}}$

Indifference condition. What happens at t = t_i? The sender has to be indifferent between sending either message m_i-1 or m_i. $U^{S}(a_{i},t_{i})=U^{S}(a_{i+1},t_{i})$ 1 ≤ i≤ N-1

This gives information about N and the t_i.

→ Practically:
We consider a partition of size N. One can show that $t_{i}=t_{1}i+2bi(i-1)\qquad t_{1}={\frac {1-2bN(N-1)}{N}}$
N must be small enough so that the numerator is positive. This determines the maximum allowed value $N^{*}=\langle {\frac {1}{2}}+{\frac {1}{2}}{\sqrt {1+{\frac {2}{b}}}}\rangle$ where $\langle Z\rangle$ is the ceiling of $Z$ , i.e. the smallest positive integer greater or equal to $Z$ .
Example: We assume that b = 1/20. Then N^* = 3. We now describe all the equilibria for N=1, 2, or 3 (see Figure 2).

N = 1: This is the babbling equilibrium. t₀ = 0, t₁ = 1; a₁ = 1/2 = 0.5.

N = 2: t₀ = 0, t₁ = 2/5 = 0.4, t₂ = 1; a₁ = 1/5 = 0.2, a₂ = 7/10 = 0.7.

N = N^* = 3: t₀ = 0, t₁ = 2/15, t₂ = 7/15, t₃ = 1; a₁ = 1/15, a₂ = 3/10 = 0.3, a₃ = 11/15.

With N = 1, we get the coarsest possible message, which does not give any information. So everything is red on the top left panel. With N = 3, the message is finer. However, it remains quite coarse compared to full revelation, which would be the 45° line, but which is not a Nash equilibrium.

With a higher N, and a finer message, the blue area is more important. This implies higher utility. Disclosing more information benefits both parties.

Applications

Game theory

Cheap talk can, in general, be added to any game and has the potential to enhance the set of possible equilibrium outcomes. For example, one can add a round of cheap talk in the beginning of the Battle of the Sexes. Each player announces whether they intend to go to the football game, or the opera. Because the Battle of the Sexes is a coordination game, this initial round of communication may enable the players to select among multiple equilibria, thereby achieving higher payoffs than in the uncoordinated case. The messages and strategies which yield this outcome are symmetric for each player. They are: 1) announce opera or football with even probability 2) if a person announces opera (or football), then upon hearing this message the other person will say opera (or football) as well (Farrell and Rabin, 1996). If they both announce different options, then no coordination is achieved. In the case of only one player messaging, this could also give that player a first-mover advantage.

It is not guaranteed, however, that cheap talk will have an effect on equilibrium payoffs. Another game, the Prisoner's Dilemma, is a game whose only equilibrium is in dominant strategies. Any pre-play cheap talk will be ignored and players will play their dominant strategies (Defect,Defect) regardless of the messages sent.

Biological applications

It has been commonly argued that cheap talk will have no effect on the underlying structure of the game. In biology authors have often argued that costly signalling best explains signalling between animals (see Handicap principle, Signalling theory). This general belief has been receiving some challenges (see work by Carl Bergstrom^[3] and Brian Skyrms 2002, 2004). In particular, several models using evolutionary game theory indicate that cheap talk can have effects on the evolutionary dynamics of particular games.

Notes

^ Crawford, Vincent P.; Sobel, Joel (November 1982). "Strategic Information Transmission". Econometrica. 50 (6): 1431–1451. doi:10.2307/1913390. JSTOR 1913390.
^ Farrell, Joseph (1987). "Cheap Talk, Coordination, and Entry". The RAND Journal of Economics. 18 (1): 34–39. JSTOR 2555533.
^ The Biology of Information.

References

Crawford, V. P.; Sobel, J. (1982). "Strategic Information Transmission". Econometrica. 50 (6): 1431–1451. doi:10.2307/1913390.
Farrell, J.; Rabin, M. (1996). "Cheap Talk". Journal of Economic Perspectives. 10 (3): 103–118. doi:10.1257/jep.10.3.103. JSTOR 2138522.
Robson, A. J. (1990). "Efficiency in Evolutionary Games: Darwin, Nash, and the Secret Handshake". Journal of Theoretical Biology. 144 (3): 379–396. doi:10.1016/S0022-5193(05)80082-7.
Skyrms, B. (2002). "Signals, Evolution and the Explanatory Power of Transient Information". Philosophy of Science. 69 (3): 407–428. doi:10.1086/342451.
Skyrms, B. (2004). The Stag Hunt and the Evolution of Social Structure. New York: Cambridge University Press. ISBN 0-521-82651-9.

[CS-1] Crawford, Vincent P.; Sobel, Joel (November 1982). "Strategic Information Transmission". Econometrica. 50 (6): 1431–1451. doi:10.2307/1913390. JSTOR 1913390.

[2] Farrell, Joseph (1987). "Cheap Talk, Coordination, and Entry". The RAND Journal of Economics. 18 (1): 34–39. JSTOR 2555533.

[3] The Biology of Information.

[1]

[2]

[3]

v t e Topics of game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game Mechanism design
Equilibrium concepts	Bayes correlated equilibrium Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Coalition-proof Nash equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand equilibrium
Strategies	Appeasement Backward induction Bid shading Collusion Cheap talk De-escalation Deterrence Escalation Forward induction Grim trigger Markov strategy Pairing strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Auction Bargaining problem Global game Intransitive game Mean-field game n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers All-pay auction Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Electronic mail game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Bertrand competition Cournot competition Stackelberg competition Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem
Theorems	Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Search optimizations	Alpha–beta pruning Aspiration window Principal variation search max^n algorithm Paranoid algorithm Lazy SMP
Miscellaneous	Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory Glossary of game theory List of game theorists List of games in game theory No-win situation Topological game Tragedy of the commons