Abstract
I study a strategic-communication game between an informed sender and an uninformed receiver with partially aligned preferences. The receiver is endowed with the ability to probabilistically detect if the sender is lying. Specifically, if the sender is making a false claim about her type, with some commonly known probability p the receiver additionally observes a private signal indicating that the sender is lying. The main result is that the receiver’s stochastic lie-detection ability makes fully revealing equilibria—the best outcome for the receiver—possible, even for small p (less than \(\frac{1}{2}\)). Additionally, if the language consists of precise messages, fully revealing equilibria exist only for \(p=1\) and for a set of intermediate values of p that is bounded away from 0 and 1, making the maximal ex-ante expected equilibrium utility of the receiver non-monotone in p. If vague messages are allowed, full revelation can be supported for all large enough p, overturning the non-monotonicity and improving communication outcomes relative to the precise-language case.
Similar content being viewed by others
Notes
This justification was suggested in an early working-paper version of Dziuda and Salas (2018), which also provided an auxiliary model of “storytelling” with inconsistencies arising due to limited memory.
This could be due to the misinformation effect (Loftus and Hoffman 1989), which causes an eyewitness to believe that she has a better memory of the crime than she actually does.
In some of the FRE constructed below, the off-equilibrium “punishment” action of the lawyer would be to call to the stand and highlight the testimony of a witness who is found out to be falsely pretending to have little knowledge, and to de-emphasize (or not even call to the stand) if she is caught falsely pretending to be very informed of the crime.
Below, I consider an alternative version of the model which allows for vague messages as in Milgrom (1981). I also consider refinements which require equilibria to be robust to the creation of new messages with particular meaning.
Thus, messages’ meanings, unlike in standard cheap-talk games, are not determined in equilibrium. The meaning of message m is fixed to be “The true state of the world is \(t=m\).” Messages might, however, lose their meaning in equilibrium. See footnote 10. Another departure from the previous literature is the (realistic) assumption that all messages are available to all agents, thus decoupling messages’ meanings from the set of types they are available to.
The argument b is often suppressed in what follows.
In Sect. 4.4, I consider the case of variable sender bias and show that the main result is preserved.
The assumption that both the sender and the receiver play pure strategies is with little loss of generality. As \(\ell ^R\) is strictly convex, the receiver has a unique best response to any belief about the sender’s type he might have. Also, in all fully revealing equilibria, which constitute the focus of this paper, all sender types (except possibly \(t=0\)) play pure strategies.
For example, consider a C–S equilibrium where two actions are induced on the equilibrium path: \(y_1\) whenever the sender’s type is \(t<t^*\) and \(y_2\) when \(t\ge t^*\). For any \(m^*\ne 0\), the messaging strategy \(M(t)=0\) if \(t<t^*\) and \(M(t)=m^*\) otherwise, together with the action strategy \(Y(m^*,0)=Y(m^*,-1)=y_2\) and \(Y(m,-1)=Y(m,0)=y_1\) for \(m\ne m^*\) is an equilibrium for \(p<1\) and induces the same outcome.
In another equilibrium that arises in this model, the high types (all t above some threshold \(t^*(p)\)) separate by sending truthful messages, while the low types \(t<t^*(p)\) pool together. Incidentally, it can be shown that \(\lim _{p\rightarrow 1}t^*(p)=0,\) so this class of equilibria converges to the unique equilibrium outcome at \(p=1\) as established by Proposition 1. The proof of this claim is available upon request.
The use of the message \(m^*\) by both \(t=0\) and \(t=m^*\) does not prevent full revelation. Whenever \(m^*\) is received, the receiver can distinguish perfectly between the two possible sender types based on the value of v.
I am grateful to an anonymous referee for urging me to clarify the importance of this point.
The space of vague messages can also be taken to be a larger (even possibly improper) subset of the power set of [0, 1]. Expanding \(\mathcal {M}^V\) in this way should not affect Proposition 4, the main result of this section.
Since \(\mathcal {M}^V\) is comprised of closed subintervals of [0, 1] and \(t^*\notin M(t^*)\), all types t sufficiently close to \(t^*\) also satisfy \(t\notin M(t^*)\).
Farrell (1993) discusses at length when it can be reasonable to assume that neologisms can be created. His view is that this is particularly appropriate whenever the sender and the receiver have a natural language in common, which is true in the setting considered here.
I assume unique best responses to simplify the exposition. The results in this section do not depend on this assumption.
Strictly speaking, this is stronger than the definition as given by Farrell (1993): to conform with it, the inequalities in C1 would have to be strict.
Matthews et al. (1991) define two more weaker refinements related to strong announcement-proofness. Naturally, all FRE in this model satisfy both weak announcement-proofness and announcement-proofness.
These settings stand in contrast to settings such as, for example, income reporting for tax purposes where the detection of fraud carries the threat of a fine or a prison sentence.
This motivating example is borrowed from Farrell and Rabin (1996).
It is also possible to expect that a message designed to be exposed as a lie (an “obvious lie”) would manifest to the receiver as distinct from a false message intended to mislead. For example, an obvious lie may contradict commonly known facts, while a deceptive message would include at most subtle inconsistencies. As another example, the receiver might be able to distinguish between genuine nervousness on the part of the sender (as she is lying but does not want to get caught) and fake exaggerated nervousness intended to make the receiver think that she is lying. In such a case, the receiver can respond to obvious lies with the worst possible action (\(y=0\)), deterring anyone but the lowest sender’s type from deviating to an obvious lie and restoring the FRE-related results presented here.
It is easy to check that all the main results of this paper are preserved if, in addition to lie detection, we also endow the receiver with an exogenous ability to stochastically detect truth telling.
Professional poker is a colorful example of the ability of people to detect lies in face-to-face communication. The players go to great lengths to avoid “tells” in their eye movements or facial expressions by cultivating a “poker face” or by relying on hats and shades to hide their faces. Hayano (1980) provides an interesting description of strategic deception in poker.
I commenced work on this idea before becoming aware of their work in progress.
It is unusual to talk of lying in cheap-talk models, since messages acquire their meaning in equilibrium but even if the elements of the message space had exogenous meaning, that meaning would be replaced in equilibrium precisely because lying is easy.
Lying costs are sometimes motivated by the punishment or reputational damage a sender might suffer if discovered to have been untruthful. From this point of view, the model of lie detection I present here can be seen as endogenizing lying costs.
Kartik et al. (2007) find that a FRE can exist with lying costs but only with an unbounded state space.
See also Goltsman et al. (2009).
It is possible that \(t(m)=m\), in which case there is no such unique type. However, due to the continuity of utility in the sender’s type, the following analysis, in which I study the incentives of t(m) to deviate to the message m, carries through.
The system of inequalities (3) can be used to find appropriate off-equilibrium actions so that \(t(m)=0\) for some \(m<b\). This would not increase the set of p supporting a FRE since for all small \(\varepsilon >0\)
$$\begin{aligned} \sup _{m\in (2b-\varepsilon ,2b)}\mathbb {E}\left[ U^S_m(t(m))\right] = -p(1-p)(1-2b)^2>-p(1-p)(1-b)^2\ge \sup _{m\in [0,b)}\mathbb {E}\left[ U^S_m(t(m))\right] . \end{aligned}$$Intuitively, some sender type would want to deviate to a message close to \(m=2b\) before any sender type would want to deviate to any message \(m<b\).
In what follows, it would occasionally be useful to estimate \(\mathbb {E}\left[ U^S_m(t)\right] \) for \(m=t\). I interpret \(\mathbb {E}\left[ U^S_t(t)\right] \) as the expected utility of type t from the same lottery as the one faced by a sender’s type falsely reporting to be type t. Note that by continuity, \(\mathbb {E}\left[ U^S_t(t)\right] \) would be close to \(\mathbb {E}\left[ U^S_m(t)\right] \) for m close to t.
I am discounting the possibility that \(Y(0,-1)=0\). If that is the case, by continuity we would be able to consider \(\mathbb {E}[U^S_{\{\varepsilon \}}(t)]\) instead of \(\mathbb {E}[U^S_{\{0\}}(t)]\).
Note that this conclusion wouldn’t be changed if we required that \(Y(m,-1)>\sup m\) holds in equilibrium whenever \(0\in m\). By continuity, depending on p, we can make \(Y(m,-1)\) close enough to \(\sup m\) to prevent types right above \(\sup m\) from having a profitable deviation.
In fact, they differ only on a set that is either empty or a singleton, depending on whether m is truthful for some of the types pooling on m.
References
Ambrus A, Azevedo E, Kamada Y (2013) Hierarchical cheap talk. Theor Econ 8(1):233–261
Banks J (1990) A model of electoral competition with incomplete information. J Econ Theory 50(2):309–325
Belot M, van de Ven J (2017) How private is private information? The ability to spot deception in an economic game. Exp Econ 20(1):19–43
Belot M, Bhaskar V, van de Ven J (2012) Can observers predict trustworthiness? Rec Econ Stat 94(1):246–259
Bernheim B, Severinov S (2003) Bequests as signals: an explanation for the equal division puzzle. J Polit Econ 111(4):733–764
Blume A, Board O, Kawamura K (2007) Noisy talk. Theor Econ 2(4):395–440
Border K, Sobel J (1987) Samurai accountant: a theory of auditing and plunder. Rev Econ Stud 54(4):525–540
Brosig J (2002) Identifying cooperative behavior: some experimental results in a prisoner’s dilemma game. J Econ Behav Organ 47(3):275–290
Callander S, Wilkie S (2007) Lies, damned lies, and political campaigns. Games Econ Behav 60(2):262–286
Celik G (2006) Mechanism design with weaker incentive compatibility constraints. Games Econ Behav 56(1):37–44
Chen J, Houser D (2016) Promises and lies: can observers detect deception in written messages. Exp Econ
Chen Y (2009) Communication with two-sided asymmetric information. Mimeo
Chen Y (2011) Perturbed communication games with honest senders and naive receivers. J Econ Theory 146(2):401–424
Chen Y (2012) Value of public information in sender-receiver games. Econ Lett 114(3):343–345
Chen Y, Kartik N, Sobel J (2008) Selecting cheap-talk equilibria. Econometrica 76(1):117–136
Crawford V, Sobel J (1982) Strategic information transmission. Econometrica 50(6):1431–1451
Deneckere R, Severinov S (2008) Mechanism design with partial state verifiability. Games Econ Behav 64(2):487–513
Duffy J, Feltovich N (2006) Words, deeds, and lies: strategic behaviour in games with multiple signals. Rev Econ Stud 73(3):669–688
Dziuda W, Salas C (2018) Communication with detectable deceit. Mimeo
Ekman P (2009) Telling lies: clues to deceit in the marketplace, politics, and marriage. W. W. Norton
Farrell J (1993) Meaning and credibility in cheap-talk games. Games Econ Behav 5(4):514–531
Farrell J, Rabin M (1996) Cheap talk. J Econ Perspect 10(3):103–118
Forges F, Koessler F (2005) Communication equilibria with partially verifiable types. J Math Econ 41(7):793–811
Frank R, Gilovich T, Regan D (1993) The evolution of one-shot cooperation: an experiment. Ethol Sociobiol 14(4):247–256
Frohlich N, Oppenheimer J (1998) Some consequences of e-mail vs. face-to-face communication in experiments. J Econ Behav Organ 35(3):389–403
Glazer J, Rubinstein A (2012) A model of persuasion with boundedly rational agents. J Polit Econ 120(6):1057–1082
Golosov M, Skreta V, Tsyvinski A, Wilson A (2014) Dynamic strategic information transmission. J Econ Theory 151:304–341
Goltsman M, Hörner J, Pavlov G, Squintani F (2009) Mediation, arbitration and negotiation. J Econ Theory 144(4):1397–1420
Green J, Laffont J (1986) Partially verifiable information and mechanism design. Rev Econ Stud 53(3):447–456
Grossman S (1981) The informational role of warranties and private disclosure about product quality. J Law Econ 24(3):461–483
Hagenbach J, Koessler F, Perez-Richet E (2014) Certifiable pre-play communication: full disclosure. Econometrica 82(3):1093–1131
Hayano D (1980) Communicative competency among poker players. J Commun 30(2):113–120
Hodler R, Loertscher S, Rohner D (2014) Persuasion, binary choice, and the costs of dishonesty. Econ Lett 124(2):195–198
Holm H (2010) Truth and lie detection in bluffing. J Econ Behav Organ 76(2):318–324
Holm H, Kawagoe T (2010) Face-to-face lying—an experimental study in Sweden and Japan. J Econ Psychol 31(3):310–321
Ishida J, Shimizu T (2016) Cheap talk with an informed receiver. Econ Theory Bull 4(1):61–72
Ivanov M (2010) Communication via a strategic mediator. J Econ Theory 145(2):869–884
Kartik N (2009) Strategic communication with lying costs. Rev Econ Stud 76(4):1359–1395
Kartik N, Ottaviani M, Squintani F (2007) Credulity, lies, and costly talk. J Econ Theory 134(1):93–116
Lai E (2014) Expert advice for amateurs. J Econ Behav Organ 103:1–16
Lipman B, Seppi D (1995) Robust inference in communication games with partial provability. J Econ Theory 66(2):370–405
Loftus E, Hoffman H (1989) Misinformation and memory: the creation of new memories. J Exp Psychol Gen 118(1):100–104
Martinelli C, Parker S (2009) Deception and misreporting in a social program. J Eur Econ Assoc 7(4):886–908
Mathis J (2008) Full revelation of information in sender-receiver games of persuasion. J Econ Theory 143(1):571–584
Matthews S, Okuno-Fujiwara M, Postlewaite A (1991) Refining cheap-talk equilibria. J Econ Theory 55(2):247–273
Milgrom P (1981) Good news and bad news: representation theorems and applications. Bell J Econ 12(2):380–391
Mookherjee D, Png I (1989) Optimal auditing, insurance, and redistribution. Q J Econ 104(2):399–415
Myerson R (1991) Game theory: analysis of conflict. Harvard University Press, Cambridge
Mylovanov T, Zapechelnyuk A (2017) Optimal allocation with ex post verification and limited penalties. Am Econ Rev 107(9):2666–2694
Olszewski W (2004) Informal communication. J Econ Theory 117(2):180–200
Ottaviani M (2000) The economics of advice. Mimeo
Ottaviani M, Squintani F (2006) Naive audience and communication bias. Int J Game Theory 35(1):129–150
Radner R, Schotter A (1989) The sealed-bid mechanism: an experimental study. J Econ Theory 48(1):179–220
Seidmann D, Winter E (1997) Strategic information transmission with verifiable messages. Econometrica 65(1):163–169
Sobel J (2009) Signaling games. In: Meyers R (ed) Encyclopedia of complexity and systems science. Springer, New York, NY, pp 8125–8139
Sobel J (2013) Giving and receiving advice. In: Acemoglu D, Arellano M, Dekel E (eds) Advances in economics and econometrics: tenth World Congress. Cambridge University Press, Cambridge
Townsend R (1979) Optimal contracts and competitive markets with costly state verification. J Econ Theory 21(2):265–93
Valley K, Moag J, Bazerman M (1998) ‘A matter of trust’: effects of communication on the efficiency and distribution of outcomes. J Econ Behav Organ 34(2):211–238
Valley K, Thompson L, Gibbons R, Bazerman M (2002) How communication improves efficiency in bargaining games. Games Econ Behav 38(1):127–155
Vrij A (2008) Detecting lies and deceit. Wiley, Hoboken
Wang J, Spezio M, Camerer C (2010) Pinocchio’s pupil: using eyetracking and pupil dilation to understand truth telling and deception in sender-receiver games. Am Econ Rev 100(3):984–1007
Acknowledgements
I have greatly benefited from comments from the associate editor, the anonymous referees and from David Ahn, Wioletta Dziuda, Haluk Ergin, Nisvan Erkal, Joseph Farrell, Johannes Hörner, Yuichiro Kamada, Maciej Kotowski, Botond Kőszegi, Matthew Leister, Simon Loertscher, Cesar Martinelli, John Morgan, Takeshi Murooka, Omar Nayeem, Santiago Oliveros, In-Uck Park, Matthew Rabin, Roberto Raimondo, Antonio Rosato, Emilia Tjernström, Steven Williams, and participants at the 2016 APET Workshop on Democracy, Public Policy, and Information at Deakin University. Any remaining errors are my own.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A Proofs
A Proofs
Proof of Lemma 2
Assume there exists a FRE where the receiver’s actions off the equilibrium path are given by \(Y(\cdot ,-1)\). In each of the following cases for the possible values of b, I show that a sender’s type has a profitable deviation to lying, which is a contradiction.
First, if \(b\ge 1\), if type \(t=0\) deviates to the message \(m=1\), her expected utility would be
which is the sender’s equilibrium utility. Note that the non-strict inequality above follows from the fact that \(Y(1,-1)\in [0,1]\).
Second, if \(b\in [1/2,1)\), if type \(t=0\) deviates to the message \(m=b\), her expected utility would be
where the first inequality follows from the fact that \(|b-Y(b,-1)|\le b\) because \(Y(b,-1)\in [0,1]\).
Third, if \(b\in (1/4,1/2)\) and \(Y(1/2,-1)\in [0,2b]\), if type \(t=0\) deviates to the message \(m=1/2\), her expected utility would be
Finally, if \(b\in (1/4,1/2)\) and \(Y(1/2,-1)\in (2b,1]\), if type \({\hat{t}}\equiv Y(1/2,-1)-2b\) deviates to the message \(m=1/2\), her expected utility would be
where the inequality follows from the fact that \(|Y(1/2,-1)-b-1/2|<1/4<b\). \(\square \)
Proof of Proposition 2
By Lemma 1, in all FRE we have \(M(t)=t\) for all \(t\in \mathcal {T}\) and \(Y(m,0)=m\) for all \(m\in \mathcal {M}\). In equilibrium, a sender of type t’s utility is \(U^S(t,t)=-b^2\). If she deviates to some false report \(m\ne t\), it is
Denote this value by \(\mathbb {E}\left[ U^S_m(t)\right] \). Notice that \(\mathbb {E}\left[ U^S_m(t)\right] \) is strictly concave in t.
Fix p and a family of off-equilibrium actions \(\{Y(m,-1)\}_{m\in \mathcal {M}}\) forming a part of a FRE. By Lemma 2, we have \(b\le 1/4\). Also, we can assume that for each message m there is a unique type t(m) for whom the expected utility of falsely reporting m is larger than the expected utility of any other type when falsely reporting m.Footnote 34 In other words
It is easy to check that \(t(m)=\max \{pY(m,-1)+(1-p)m-b;0\}\). Then, whenever \(t(m)=pY(m,-1)+(1-p)m-b\ge 0\), \(\mathbb {E}\left[ U^S_m(t(m))\right] \) can be computed to satisfy
whenever \(p\in (0,1)\).Footnote 35 Notice that in this case, \(\mathbb {E}\left[ U^S_m(t(m))\right] \) is decreasing in the distance \(|Y(m,-1)-m|\). Thus, in order to check that there are no incentives for deviation, it would suffice to check incentive compatibility for the message m for which that distance is the smallest. If \(pY(m,-1)+(1-p)m-b<0\) (implying \(t(m)=0\)), we have
It is clear that since \(U^S(t,t)\) does not depend on t, to verify that there are no incentives for deviation from truthfulness/full revelation it suffices to check that it is incentive compatible for t(m) to report truthfully rather than deviate to m for each \(m\in \mathcal {M}=[0,1]\). In other words, we need to show
Consider the following off-equilibrium actions:
Clearly, these actions can be rationalized if the sender believes that she is certainly facing type \(t=1\) (or \(t=0\)) after observing \((m,-1)\) for \(m<1/2\) (or \(m\ge 1/2\)).
Note that under these beliefs we have
Thus, if \(-p(1-p)\frac{1}{4}\le -b^2\), this would guarantee that the proposed off-equilibrium actions can support a FRE. In the case \(b\le 1/4\), the inequality is true if and only if
Other values of p could support a FRE only if the inequality
holds strictly. This is possible only if \(\mathbb {E}\left[ U^S_{m}(t(m))\right] \le -p(1-p)(Y(m,-1)-m)^2\) holds strictly for some open neighborhood of values around \(m=1/2\). In other words, we need \(pY(m,-1)+(1-p)(m)-b<0\) and \(t(m)=0\) for those values of m. Adding the inequality necessary for equilibrium compliance, the following system of inequalities is derived
The first inequality implies \(Y(m,-1)< b\) because we are in the case \(b\le 1/4\) and the inequalities need to be satisfied for all m in some neighborhood of 1 / 2. But the left-hand side of the second inequality is increasing over these values of \(Y(m,-1)\) so, to maximize compliance, we may assume \(Y(m,-1)=0\). It is then easy to check that the first inequality is satisfied for \(m< \frac{b}{1-p}\) and the second—for \(m\ge 2b\). Notice that it is possible for both of these to be satisfied only if \(p\ge \frac{1}{2}\).
Since we already know that \(p\in \left[ \frac{1}{2}-\frac{\sqrt{1-16b^2}}{2},\frac{1}{2}+\frac{\sqrt{1-16b^2}}{2}\right] \) can support a FRE, I assume \(p>\frac{1}{2}+\frac{\sqrt{1-16b^2}}{2}\) for the rest of the proof. This implies \(\frac{b}{1-p}>\frac{1}{2}\). To see that, note that since \(p>\frac{1}{2}+\frac{\sqrt{1-16b^2}}{2}\), it suffices to show that \(\frac{1}{2}-\frac{\sqrt{1-16b^2}}{2}\le 2b\). Re-arranging, we can verify that this is equivalent to \(b\le \frac{1}{4}\). Therefore we have \(2b\le \frac{1}{2}<\frac{b}{1-p}\). So for any message \(m\in \left[ 2b,\frac{b}{1-p}\right) \), the (off-equilibrium) action \(Y(m,-1)=0\) guarantees that no type would want to deviate to that message.
Now consider compliance for messages \(m\ge \frac{b}{1-p}\). We want
It is clear that \(t(m)=pY(m,-1)+(1-p)m-b\ge 0\) for all \(m\ge \frac{b}{1-p}\) regardless of the value of \(Y(m,-1)\). Then, by (1)
for all \(m\ge \frac{b}{1-p}\). This can be minimized by, for example, setting \(Y(m,-1)=0\) for all \(m\ge \frac{b}{1-p}\) so that
In order to have equilibrium compliance, we must have \(-p(1-p)\left( \frac{b}{1-p}\right) ^2\le -b^2\). It is easy to check that this is satisfied for all \(p\in [1/2,1]\). Thus, in the case we are considering (i.e. \(p>\frac{1}{2}+\frac{\sqrt{1-16b^2}}{2}\)), no sender type would deviate to a message \(m\ge \frac{b}{1-p}\) if \(Y(m,-1)=0\) for all such m.
Now consider the compliance for messages \(m<2b\). We want
Fix any \(m^*\in (b,2b)\). If \(t(m^*)=0>pY(m^*,-1)+(1-p)m^*-b\), which is possible only if \(Y(m^*,-1)<b\), then
where the second inequality follows from our analysis of the system (3) and the fact that \(m<2b\). So in order to ensure equilibrium compliance for all messages \(m<2b\), we must have \(t(m)=pY(m,-1)+(1-p)m-b\) (at least for all \(m\in (b,2b)\))Footnote 36. We noticed above that in such cases \(\mathbb {E}\left[ U^S_m(t(m))\right] \) is decreasing in the distance \(|Y(m,-1)-m|\) so we can set \(Y(m,-1)=1\) for all \(m<2b\). Then, by (1), we have
We must have \(-p(1-p)(1-2b)^2\le -b^2\). Solving, we get
Since we are in the case \(p>\frac{1}{2}+\frac{\sqrt{1-16b^2}}{2}\), it can be checked that for \(b\le 1/4\) we have
So for all \(p\in \left[ \frac{1}{2}+\frac{\sqrt{1-16b^2}}{2},\frac{1}{2}+\frac{\sqrt{1-4\frac{b^2}{(1-2b)^2}}}{2}\right] \), the following off-equilibrium actions guarantee FRE compliance:
We conclude that a full-revelation equilibrium can be supported if and only if
\(\square \)
Proof of Proposition 3
Let p be given. Let \(Y(m,0)=m\) for all \(m\in \mathcal {M}\) and also
I will show that given the receiver’s actions above, whenever p is in some open neighborhood of 1 / 2, it is optimal for the sender to choose \(M(t)=t\) for all \(t\in \mathcal {T}\). The pair of strategies would form a FRE.
For some message m, consider the maximum possible utility that can be achieved by a sender’s type (falsely) sending that message:
The value of this optimization program is decreasing in \(|m-Y(m,-1)|\). To see that, first note that if \(\ell \) is strictly convex, the objective function is strictly concave so the maximizer \(t^*\) is unique and \(t^*+b\) is strictly between m and \(Y(m,-1)\). So a small decrease in the distance between m and \(Y(m,-1)\) clearly increases the value of the objective function evaluated at \(t^*\).
If \(\ell \) is piecewise linear, the optimum is either a corner solution (i.e. \(t^*+b\) equals either m or \(Y(m,-1)\)) for \(p\ne 1/2\) or any \(t^*\) such that \(t^*+b\) is in the closed interval defined by m and \(Y(m,-1)\) for \(p=1/2\). Either way, the value of the objective function is \(\min \{p,1-p\}(-\ell (m-Y(m,-1)))\), which is decreasing in \(|m-Y(m,-1)|\).
Denote the expected utility of type t sending a false messageFootnote 37m by \(\mathbb {E}\left[ U^S_m(t)\right] \). Note that
and therefore
where the equality follows from the fact that the program’s value is decreasing in \(|m-Y(m,-1)|\).
It is optimal for the sender to always report truthfully if
where \(-\ell (b)\) is the sender’s utility from reporting truthfully. So, in order to show what we need for \(p=1/2\), it suffices to show the following inequality:
Notice that for the type \(t^*\) that maximizes the left-hand side’s objective function, we again have that \(t^*+b\) is between 0 and 1 / 2. So using Jensen’s inequality, the following holds for the left-hand side
which is what we wanted to show. Additionally, notice that if this inequality is strict (i.e. if \(b<1/4\)) by continuity of the left-hand side in p, there would be an open set of values around \(p=1/2\) that also satisfy the inequality, proving the positive measure of the parameters supporting a FRE.
To complete the proof, we need to show that there does not exist a FRE for all \(p\in (0,\varepsilon )\cup (1-\varepsilon ,1)\) for some \(\varepsilon >0\). Let \(m=b\) and consider the off-equilibrium actions \(\{Y(m,-1)\}_{m\in \mathcal {M}}\) for some candidate FRE. If \(Y(m,-1)\le b\), it is easy to see that type \(t=0\) prefers sending the message m over truth-telling regardless of the values of p. If \(Y(m,-1)>b\), we have
We have \(\lim _{p\rightarrow 1}\left[ -(1-p)\ell (1-b)\right] =0\). It is then clear that there exists \(\varepsilon >0\) such that for all \(p>1-\varepsilon \), we have
and so the inequality \(\mathbb {E}\left[ U^S_m(Y(m,-1)-b)\right] > -\ell (b)\) holds for \(p>1-\varepsilon \). Therefore for all \(p>1-\varepsilon \), there does not exist \(Y(m,-1)\) for which all sender types prefer truth-telling over sending the false message \(m=b\). Thus, no off-equilibrium can be part of a FRE and there does not exist one.
For small values of p, we start by considering type \(t=0\)’s possible deviation to the message \(m=b\):
The rest of the proof proceeds analogously. \(\square \)
Proof of Proposition 4
I first show that if a FRE exists for p with \(\mathcal {M}\), then it also exists for the same p with \(\mathcal {M}^V\). Let \(P^*\) denote the set of values of p, for which there exists a FRE \(\{M,Y\}\) in the case without vague messages. We need to show that for all \(p\in P^*\) there exists a fully revealing equilibrium for \({\mathcal {M}}^V\). Fix such a p and consider the messaging profile \(M^V(t)=\{t\}\) and the action function
I claim that \(\{M^V,Y^V\}\) is a FRE. No sender type wants to deviate to a different equilibrium message since \(\{M,Y\}\) is also a FRE. No sender type t strictly prefers the certain action \(y=0\) (induced by deviating to an off-equilibrium truthful message or an off-equilibrium false message \(m\not \ni 0\)) to the corresponding equilibrium action \(y=t\). So it remains to be shown that no sender type t prefers the lottery formed by the actions \(y=0\) with probability \(1-p\) and \(y=1\) with probability p (induced by deviating to an off-equilibrium false message \(m\ni 0\)) to the equilibrium action \(y=t\). Let \(t^*\in [0,1]\) be a maximizer of the concave function \(-p\ell (1-t-b)-(1-p)\ell (t+b)\), which is the utility that a type t derives from inducing that lottery.
Observe that since \(\{M,Y\}\) is a FRE, no type wants to deviate to the message \(\{0\}\) and therefore the expected utility of any type t from inducing the lottery over the actions 0 with probability \(1-p\) and \(Y^V(\{0\},-1)=Y(0,-1)\) with probability p (denoted by \(\mathbb {E}[U^S_{\{0\}}(t)]\)) is no greater than \(-\ell (b)\). So it suffices to show that
for some \(t\ne 0\). If \(Y(0,-1)=1\), we are done. Assume instead \(Y(0,-1)<1\). Note also that \(Y(0,-1)\ge 2b\) because, otherwise, types close to \(t=0\) would have a profitable deviation to \(m=\{0\}\).Footnote 38
If \(t^*>0\), consider \(t^{**}=\max \{0,t^*-(1-Y(0,-1))\}\). If \(t^{**}>0\), we have
which is what we wanted to show, and where the inequality follows from the fact that \(t^{**}<t^*\).
If \(t^{**}=0\), then \(t^{**}\ge t^*-(1-Y(0,-1))\) and so \(Y(0,-1)-t^{**}-b\le 1-t^*-b\). Since \(Y(0,-1)-t^{**}-b\ge 2b-b=b>0\) and, by optimality of \(t^*\), \(t^*+b\in (0,1)\), we have \(\ell (Y(0,-1)-t^{**}-b)\le \ell (1-t^{*}-b)\). Thus, we have
Finally, assume \(t^*=0\). Since \(b\le 1/4\) and \(Y(0,-1)\in [2b,1)\) we have
Since \(\mathbb {E}[U^S_{\{0\}}(0)]\) is continuous in type, there is some type \(t^{**}\) close to \(t=0\) which satisfies
Next, I show that a FRE exists for all \(p\ge \frac{1}{2}\). Assume \(b<1/4\). Consider the following fully revealing strategy profile (Y, M):
for some \(\varepsilon _t\ge 0\) such that \(1-\varepsilon _t\ge \max \{t,4b\}\) and \(\varepsilon _t>0\) whenever \(t\le 2b\). I will show that this strategy profile is an equilibrium for all \(p\ge \frac{1}{2}\).
No type has a profitable deviation to a true or false off-path message \(m\notin M(\mathcal {T})\) with \(0\notin m\) since that induces the action 0 for sure. Similarly, no type has a profitable deviation to a true \(m\notin M(\mathcal {T})\) with \(0\in m\). A sender type t deviating to a false message \(m\notin M(\mathcal {T})\) with \(0\in m\) induces a lottery between actions 0 (with probability \(1-p\)) and \(\sup m\) (with probability p). Note that \(t\notin [0,\sup m]\) is possible only if \(t>\sup m\). Thus, both 0 and \(\sup m\) are worse for t than the action she induces in equilibrium.Footnote 39
No type has a profitable deviation to a true on-path message \(m\in M(\mathcal {T})\) since that would induce a lower action than truth-telling induces. What is left to verify is that no type has a profitable deviation to a false on-path message \(m\in M(\mathcal {T})\). No type \(t^*>1-\varepsilon _t\) has a profitable deviation to M(t) since both induced actions are weakly worse than the one \(t^*\) induces in equilibrium.
We need to consider possible deviations only from types in \(t^*\in [0,t)\). If \(t\le 2b\):
If \(\ell \) is linear, for all \(p\ge \frac{1}{2}\) we have
which is the equilibrium payoff and where the second inequality follows from \(1-\varepsilon _t \ge 4b\) and \(t\le 2b\).
If \(\ell \) is strictly convex, then
is in the interval \((t,1-\varepsilon _t)\), it is strictly increasing in p, and it is at the midpoint of the interval \([t,1-\varepsilon _t]\) when \(p=\frac{1}{2}\). Therefore, since the distance of the interval is at least 2b, for all \(p\ge \frac{1}{2}\), we have
Thus, for all \(t^*<t\) we have
where the second inequality follows from \(1-\varepsilon _t \ge 4b\) and \(t\le 2b\). Thus, for \(p\ge \frac{1}{2}\) no type \(t^*<t\) has a profitable deviation to the message M(t) whenever \(t\le 2b\).
Now let’s consider the case \(t>2b\). As above, for \(t^*<t\) we have
If \(\ell \) is linear, for all \(p\ge \frac{1}{2}\) we have
where the second inequality follows from the fact that \(t>2b\).
If \(\ell \) is strictly convex instead, \(\arg \max _{{\hat{t}}}\mathbb {E}[U^S_{M(t)}({\hat{t}})]+b\) is in the set (0, t), it is decreasing in p, and, for \(p=\frac{1}{2}\), it is at the midpoint of [0, t]. Set \(t^{**}=\max \left\{ 0,\arg \max _{{\hat{t}}}\mathbb {E}[U^S_{M(t)}({\hat{t}})]\right\} \). Thus, for \(p\ge \frac{1}{2}\) we have
since \(t>2b\). For all \(t^*<t\) we have
Thus, no type \(t^*<t\) has a profitable deviation to the message M(t) whenever \(t>2b\). This completes the first part of the proof.
To establish the statement pertaining to the case of quadratic utility, note that the sufficiency follows from Proposition 2 and the first half of this proof. To demonstrate necessity, it suffices to show that there does not exist a FRE for any \(p<\frac{1}{2}-\frac{\sqrt{1-16b^2}}{2}\). Toward contradiction, fix a p satisfying the inequality and let (Y, M) be a FRE for that value of p. I will show that regardless of the values of M(1 / 2) and \(Y(M(1/2),-1)\) in this strategy profile, the sender type \(t^*\), defined by
satisfies \(t^*\notin M(1/2)\) and would have an incentive to deviate to the message M(1 / 2).
As we are in a case where \(p<1/2\) and \(b\le 1/4\), the inequality \(t^*\ge 0\) holds, regardless of the value of \(Y(M(1/2),-1)\). Note also that a sufficient condition for the inequality \(t^*<1/2\) to hold for all \(Y(M(1/2),-1)\in [0,1]\) is \(p<2b\). This is satisfied because \(\frac{1}{2}-\frac{\sqrt{1-16b^2}}{2}\le 2b\) as observed in the proof of Proposition 2. Thus, \(t^*\in [0,1/2)\). By Lemma 3, \(\inf M(1/2)=1/2\) and so \(t^*\notin M(1/2)\). Furthermore, we have
where the first inequality follows from the fact that \(Y(M(1/2),-1)\in [0,1]\) and the second follows from how we established (2). Thus, \(t^*\) has a profitable deviation to M(1 / 2), which is the contradiction we need to complete the proof.
\(\square \)
Proof of Proposition 5
Let (M, Y) be a FRE. The equilibrium payoff for all t is \(-\ell (b)\). Consider any announcement \(\langle M',X \rangle \). I will show that \(\langle M',X \rangle \) cannot satisfy condition C1.
If \(m\in \mathcal {M'}\) is a message sent as a part of the announcement, let \(M'^{-1}(m)\) denote all types in X that can send m. If \(M'^{-1}(m)\) is a singleton for all m, then if \(M'^{-1}(m)=\{t\}\) it follows that \(Y'(m)=t\) and so \(U^S(Y'(m),t)=-\ell (b)\) for all m and \(t\in X\). Therefore, the inequality in C1 cannot hold strictly.
If \(M'^{-1}(m)\) is not a singleton for some m and \(Y'(m)\) is the corresponding best-response action by the receiver, it has to be the case that there are types \(t_0,t_1\in M'^{-1}(m)\) such that \(t_0<Y'(m)<t_1\). But then
and so the inequality in C1 does not hold for all \(t\in X\).
\(\square \)
Proof of Proposition 6
Consider some message-connected equilibrium with pooling. Namely, let all types between \(\underline{t}\) and \(\overline{t}\) (with \(\overline{t}>\underline{t}\)) pool on some message m. Notice that since F is atomless, the probability distributions induced by Bayes’ rule conditional on (m, 0) and on \((m,-1)\) differ only on a set of Lebesgue measure zeroFootnote 40 and they, in turn, differ on a zero-measure set from the probability density function over the set of types pooling on m
So we can treat \(g(\cdot )\) as the pdf of the distributions that are induced by the observation of either (m, 0) or \((m,-1)\). I will show that, under either of the proposition’s premises, the receiver’s equilibrium action Y(m, v) is just \(\mathbb {E}_g[t]\).
First, if the receiver’s loss function is quadratic, the receiver chooses y to maximize
This function is strictly concave in y so we can maximize it using the first-order condition. It is \(2\mathbb {E}_g[t]=2y\). Thus, \(y^{\max }=\mathbb {E}_g[t]\).
Second, let’s consider the case of F being uniform. Note then that, in this case, g is (essentially) uniform. In other words, we can assume \(g(t)=1/(\overline{t}-\underline{t})\). In this case, the receiver chooses y to maximize
Since \(\ell ^R\) is strictly convex, it is not hard to see that the unique maximizer here is
Now consider the expected value of the expected distance between the sender’s bliss action and the equilibrium action conditional on m—i.e. \(\mathbb {E}_g[|t+b-\mathbb {E}_g[t]|]\). Letting \(t^*:=\max \{\underline{t},\mathbb {E}_g[t]-b\}\), we have
Analogously
Thus
where the third equality follows from (I). If \(t^*=\underline{t}\), (III) reduces to
If \(t^*=\mathbb {E}_g[t]-b>\underline{t}\), we must have \(\mathbb {E}_g[t]-b> \underline{t}\ge 0\) and hence \(\mathbb {E}_g[t]> b\). Then (III) becomes
where the inequality follows from (II) and I have denoted \(P:=\int _{t^*}^{\overline{t}}g(t)dt\). Either way, we have \(\mathbb {E}_g[|t+b-\mathbb {E}_g[t]|]\ge b\). In other words, the expected distance between the sender’s bliss action and the receiver’s equilibrium action conditional on m is no less than b. Thus, the expected utility of the sender conditional on sending the message m in the equilibrium is
where I use the fact that \(\ell \) is convex and increasing in its argument’s absolute value.
Notice that if a type t separates by being the only to send a certain message m in equilibrium, we must have \(Y(m,0)=Y(m,-1)=t\), and hence that type’s equilibrium utility is \(U^S(y,t)=-\ell (b)\). By the Law of Iterated Expectations
because \(\mathbb {E}[U^S|m]\le -\ell (b)\) for all equilibrium messages m. The sender’s utility in all FRE is \(-\ell (b)\) and this completes the proof. \(\square \)
Proof of Proposition 7
Assume \(p\ge \frac{\ell (b)}{\ell (b)+\varepsilon }\), and consider the following fully revealing strategy profile:
It is clear Y is a best response to M. To establish that this is an equilibrium, we only need to verify that the sender does not have profitable deviation. As \(Y(m,-1)=0\) regardless of m, a sender of type t maximizes her expected utility from a deviation by sending the message \(m=t+b\). The expected utility then is:
which is the utility from truth-telling.
Finally, note that the receiver need not choose \(Y(0,-1)=0\) in FRE: it is easy to show that as long as \(\ell (b-Y(0,-1))+\varepsilon >\ell (b)\), no agent would deviate to the message \(m=0\). \(\square \)
Proof of Proposition 8
Abusing notation, extend the domain of the function \(b(\cdot )\) by setting \(b(t)=b(0)\) for \(t<0\) and \(b(t)=b(1)\) for \(t>1\). With this modification in place, showing that there exists a FRE for values of p around 1 / 2 is identical to the first part of the proof of Proposition 3.
Now I show that there does not exist a FRE for all \(p\in (0,\varepsilon )\cup (1-\varepsilon ,1)\) for some \(\varepsilon >0\). Let \(m=b(0)\) and consider the off-equilibrium actions \(\{Y(m,-1)\}_{m\in \mathcal {M}}\) for some candidate FRE. If \(Y(m,-1)\le b(0)\), it is easy to see that type \(t=0\) prefers sending the message m over truth-telling. If \(Y(m,-1)>b(0)\), by continuity of \(t+b(t)\), which maps onto \([b(0),1+b(1)]\) for \(t\in [0,1]\), we can find some \(t^*\) such that \(t^*+b(t^*)=Y(m,-1)\). Then
Since \(Y(m,-1)\) is bounded, we have \(\lim _{p\rightarrow 1}\left[ -(1-p)\ell (Y(m,-1)-m)\right] =0\). Since \(b(\cdot )\) is a positive continuous function on the compact domain \(\mathcal {T}\), it is bounded away from zero. It is clear then that for all sufficiently high p, the inequality
holds. Therefore, for sufficiently high p type \(t^*\) prefers lying over truth-telling. Either way, the off-equilibrium actions cannot be part of a FRE. Therefore, there does not exist one.
For small p, note that
The proof then proceeds analogously.
\(\square \)
Rights and permissions
About this article
Cite this article
Balbuzanov, I. Lies and consequences. Int J Game Theory 48, 1203–1240 (2019). https://doi.org/10.1007/s00182-019-00679-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-019-00679-z