Commitment and Randomization in Communication
Abstract
When does a Sender, in a Sender-Receiver game, strictly value commitment? In a setting with finite actions and finite states, we establish that, generically, Sender values commitment if and only if he values randomization. In other words, commitment has no value if and only if a partitional experiment is optimal under commitment. Moreover, if Sender’s preferred cheap-talk equilibrium necessarily involves randomization, then Sender values commitment. We also ask: how often (i.e., for what share of preference profiles) does commitment have no value? For any prior, any independent, atomless distribution of preferences, and any state space: if there are actions, the likelihood that commitment has no value is at least . As the number of states grows large, this likelihood converges precisely to .
Keywords: Bayesian persuasion; cheap talk
JEL Codes: D80, D83
1 Introduction
Commitment is often valuable. In the context of communication, this fact is brought out by the contrast of Sender’s payoff in Bayesian persuasion versus cheap talk. For any prior, and any profile of Sender and Receiver’s preferences, Sender’s payoff is always weakly higher under Bayesian persuasion than in any cheap-talk equilibrium.111In fact, Bayesian persuasion provides the tight upper bound on Sender’s equilibrium payoff under any communication protocol, such as disclosure or signaling. In this paper, we ask: when does commitment make Sender strictly better off?
Answering this question would contribute to our understanding of circumstances that incentivize building strong institutions immune to influence (North 1993; Lipnowski, Ravid, and Shishkin 2022) or building a reputation for a degree of honesty (Best and Quigley 2024; Mathevet, Pearce, and Stacchetti 2024).
We focus exclusively on environments with finitely many states and actions. We show that, generically, Sender with commitment values that commitment if and only if he values randomization (Theorem 1). In other words, the Bayesian persuasion payoff is achievable in a cheap-talk equilibrium if and only if a partitional experiment is a solution to the Bayesian persuasion problem. Moreover, if Sender’s preferred equilibrium in a cheap-talk game necessarily involves randomization, then Sender values commitment (Theorem 2).
Theorems 1 and 2 respectively consider willingness-to-accept (WTA) and willingness-to-pay (WTP) for commitment. Theorem 1 considers a Sender endowed with commitment and establishes that his WTA for commitment is strictly positive if and only if his WTA for use of randomization is strictly positive. Theorem 2 considers a Sender without commitment (one engaged in cheap talk) and establishes that his WTP for commitment is strictly positive if his WTA for use of randomization is strictly positive.
The link between commitment and randomization does not, on its own, address the question of “how often” (i.e., for what share of preferences), Sender finds commitment (or, equivalently, randomization) valuable. Theorems 1 and 2 would be of substantially less interest if it were the case that (in the finite worlds we consider), commitment and randomization are almost always valuable, with only exceptions being knife-edge cases such as completely aligned or completely opposed preferences.222Denoting Sender’s utility by and Receiver’s utility by , it is easy to see that when , neither commitment nor randomization is valuable (because full information is optimal and achievable via a cheap-talk equilibrium). Similarly, when , neither commitment nor randomization are valuable (because no information is optimal and achievable via a cheap-talk equilibrium). We show, however, that this is not the case. In fact, we uncover a potentially surprising connection between the likelihood that commitment has no value and the cardinality of the action set.
Formally, let denote the cardinality of the action set. Suppose that for each action-state pair, we draw Sender’s utility i.i.d. from some distribution and we draw Receiver’s utility i.i.d. from some distribution . We assume that Sender’s utility draw is independent of Receiver’s. For any number of states, for any interior prior, for any atomless distributions of preferences ( and ), the likelihood that commitment has no value is bounded below by ; moreover, as the number of states grows large, the likelihood that commitment has no value converges precisely to (Theorem 3). So, if the action set is binary and there are many states, the share of preference profiles for which commitment has no value is approximately .
Illustrative example
The workhorse example in the Bayesian-persuasion literature is a prosecutor (Sender) trying to convince a judge (Receiver) to convict a defendant who is guilty or innocent. The judge’s preferences are such that she prefers to convict if the probability of guilt is weakly higher than the probability of innocence. The prosecutor has state-independent preferences and always prefers conviction. The prior probability of guilt is .
If the environment were cheap talk, there is a unique equilibrium outcome whereby the judge ignores the prosecutor and always acquits the defendant. If the prosecutor can commit to an experiment about the state, however, he will conduct a stochastic experiment that indicates guilt whenever the defendant is guilty and indicates guilt with probability when the defendant is innocent (Kamenica and Gentzkow 2011). This experiment induces the judge to convict the defendant with 60% probability. The prosecutor is thus strictly better off than under cheap talk.
Our Theorem 1 tells us that the two facts, (i) the prosecutor’s optimal experiment involves randomization and (ii) the prosecutor does better under commitment, imply each other. Of course, the prosecutor-judge example was designed to be extremely simple, so in this particular example one can easily determine the optimal experiment and the value of commitment without our theorem. In more complicated environments, however, Theorem 1 can simplify the determination of whether commitment is valuable. Except in certain cases, such as uniform-quadratic (Crawford and Sobel 1982) or transparent preferences (Lipnowski and Ravid 2020), cheap-talk games can be difficult to solve. Theorem 1 can then be used to determine whether commitment is valuable without solving for cheap talk equilibria, simply by computing the Bayesian-persuasion optima and checking whether they include a partitional experiment.333Recent research provides a large toolbox for solving Bayesian-persuasion problems, including concavification (Kamenica and Gentzkow, 2011), price-theoretic approaches (Kolotilin, 2018; Dworczak and Martini, 2019), duality (Dworczak and Kolotilin, 2024), and optimal-transport theory (Kolotilin, Corrao, and Wolitzky, 2023). Moreover, a burgeoning literature in computer science studies computational approaches to Bayesian persuasion; see Dughmi (2017) for a survey.
The prosecutor-judge example also illustrates the distinction between the if-and-only-if result in Theorem 1 and the unidirectional Theorem 2. Recall that Theorem 1 shows that WTA for commitment is strictly positive if and only if WTA for randomization is strictly positive. Theorem 2, by contrast, establishes only that WTP for commitment is strictly positive if WTA for randomization is strictly positive. It is not the case that WTP for commitment is strictly positive only if WTA for randomization is strictly positive. This is easily seen in the prosecutor-judge example. In the cheap-talk game, the prosecutor has no value for randomization: with or without it, he never obtains any convictions. Yet, the prosecutor obviously values commitment.
Finally, the prosecutor-judge example also helps illustrate what Theorem 1 does not say. Prohibiting randomization does not mean commitment is not valuable. Suppose that the prosecutor is endowed with commitment, but is legally obliged to use only partitional experiments. In that case, the prosecutor will provide a fully informative experiment, obtaining a conviction with 30% probability. That, of course, is still better than his cheap-talk payoff of no convictions.
Related literature
Our paper connects the literatures on cheap talk (Crawford and Sobel 1982) and Bayesian persuasion (Kamenica and Gentzkow 2011). Min (2021) and Lipnowski, Ravid, and Shishkin (2022) examine environments with limited commitment that are a mixture of cheap talk and Bayesian persuasion.444Lin and Liu (2024) consider a form of limited commitment, based on the observability of the distribution of messages, that is not a mixture of cheap talk and Bayesian persuasion. In contrast, we focus on the question of when cheap talk and Bayesian persuasion yield the same payoff to Sender.
Best and Quigley (2024) examine the circumstances under which Sender without commitment who encounters a sequence of short-run receivers can attain his persuasion payoff via reputation building. They assume that Sender’s past messages are observable but the mixed strategies employed are not. Consequently, the effectiveness of partitional experiments play an important role in their analysis. They establish that if Sender has transparent preferences and the action space is finite, then generically, Sender values randomization unless a completely uninformative experiment is optimal.
Also closely related, Corrao and Dai (2023) examine Sender’s payoff under cheap talk, under Bayesian persuasion, and under mediation. Trivially, Sender’s payoff is weakly lower under cheap talk than under mediation than under Bayesian persuasion. Under the assumption that Sender has state-independent preferences, Corrao and Dai (2023) establish that, Sender does not value commitment if and only if his payoffs are the same under mediation and Bayesian persuasion.
Glazer and Rubinstein (2006) and Sher (2011) consider disclosure games and derive conditions on preferences that imply Receiver values neither commitment nor randomization.
Our results further connect to the research that endows Sender with private information (Perez-Richet 2014; Koessler and Skreta 2023) and the research that examines how to microfound Sender’s commitment via repeated interactions (Best and Quigley 2024; Mathevet, Pearce, and Stacchetti 2024).
A number of papers examine when a monotone partition is optimal in Bayesian persuasion. Assuming posterior-mean preferences, Dworczak and Martini (2019) derive a condition (termed affine-closure) that is equivalent to optimality of a monotone partition. Allowing for slightly more general preferences, Ivanov (2021) establishes that a supermodularity-like condition implies the optimality of a monotone partition.
2 Set-up and definitions
Preference and beliefs
Receiver (she) has a utility function that depends on her action and the state of the world . Both and are finite; our results rely heavily on this assumption.555At the risk of being excessively philosophical, we consider environments with finite and to be more realistic than any alternative. The use of infinite sets often provides tractability, but rarely improves realism. For any finite set , we denote its cardinality by . Sender (he) has a utility function that depends on Receiver’s action and the state. The players share an interior common prior on . For each player , we say action is ’s ideal action in if .
Genericity
Since our theorems will hold “generically,” we now formalize that notion. We refer to the triplet as the (preference-prior) environment. The set of all environments is .666For any finite set , we denote the set of all distributions on by . A set of environments is generic if its complement has zero Lebesgue measure in . When we say that a claim holds generically, we mean that it holds for a generic set of environments.777Lipnowski (2020), who focuses on finite action and state space as we do, establishes that commitment has no value when Sender’s value function over beliefs is continuous. Such continuity holds for a zero-measure set of environments whereas we focus on results that hold generically.
Cheap talk, Bayesian persuasion, and value of commitment
Let be a finite message space with . Sender chooses a messaging strategy . Receiver chooses an action strategy .
A profile of strategies induces expected payoffs
A profile is S-BR if . A profile is R-BR if .
Sender’s ideal payoff is the maximum induced by any profile.
A cheap-talk equilibrium is a profile that satisfies S-BR and R-BR.888This definition may seem unconventional since it uses Nash equilibrium, rather than perfect Bayesian equilibrium, as the solution concept. In cheap-talk games, however, the set of equilibrium outcomes (joint distributions of states, messages, and actions) is exactly the same whether we apply Nash or perfect Bayesian as the equilibrium concept. The formulation in terms of Nash equilibria streamlines the proofs. We define (Sender’s) cheap-talk payoff as the maximum induced by a cheap-talk equilibrium.999Throughout, we examine the value of commitment to Sender; hence the focus on Sender’s payoff. The set of equilibrium payoffs is compact so a maximum exists. We are interested in whether Sender can attain his commitment payoff in some equilibrium, so it is natural to focus on Sender-preferred equilibria. Except when no information is the commitment optimum, it cannot be that every cheap-talk equilibrium yields the commitment payoff since every cheap-talk game admits a babbling equilibrium.
A persuasion profile is a profile that satisfies R-BR. The (Bayesian) persuasion payoff is the maximum induced by a persuasion profile.101010This definition implicitly selects a Sender-preferred equilibrium of the persuasion game, but Lipnowski, Ravid, and Shishkin (2024) establish that, with finite and , Sender’s equilibrium payoff in a persuasion game is generically unique. We refer to a persuasion profile that yields the persuasion payoff as optimal.
We say that commitment is valuable if the persuasion payoff is strictly higher than the cheap-talk payoff. Otherwise, we say commitment has no value.
Partitional strategies and value of randomization
A messaging strategy is partitional if for every , there is a message such that . A profile is a partitional profile if is partitional.111111Our focus is on the connection between Sender’s value of commitment and Sender’s randomization. Consequently, the definition of a partitional profile only concerns Sender’s strategy. That said, along the way we will establish a result about Receiver playing pure strategies (see Lemma 5). The persuasion partitional payoff is the maximum induced by a partitional persuasion profile. The cheap-talk partitional payoff is the maximum induced by a partitional cheap-talk equilibrium.121212A partitional cheap-talk equilibrium always exists because the babbling equilibrium outcome can be supported by Sender always sending the same message. Consequently, the cheap-talk partitional payoff is well defined.
We say that committed Sender values randomization if the persuasion payoff is strictly higher than the persuasion partitional payoff. We say that cheap-talk Sender values randomization if the cheap-talk payoff is strictly higher than the cheap-talk partitional payoff.
3 Value of commitment: willingness-to-accept
In this section, we consider a Sender with commitment power, who can choose his messaging strategy prior to being informed of the state. We ask whether this commitment power makes Sender strictly better off. We link the value of commitment to Sender’s behavior under commitment, in particular to whether Sender has a strict preference for randomization.
Theorem 1.
Generically, commitment is valuable if and only if committed Sender values randomization.
For an intuition about the only-if direction, suppose that there is a partitional optimal persuasion profile . Let be the set of messages that are sent in equilibrium. For each let be the set of states that lead to message , and let be the belief induced by . For a generic set of environments, Receiver’s optimal action given belief (call it ) is unique. Since is finite, must be the uniquely optimal action in a neighborhood of beliefs around . Subtly, this implies that every action taken in equilibrium must be Sender’s preferred action, among the actions taken in equilibrium, in all states where action is taken. That is a mouthful, so in other words: let ; for each , we must have for all and all . Why does this hold? If it were not the case, Sender could attain a higher payoff with an alternative strategy. Suppose for some , . Sender could send in with a small probability and still keep optimal given . Finally, the fact that for all and all implies that strategy under consideration also constitutes a cheap-talk equilibrium.131313Deviating to an on-path message obviously cannot be profitable; for any off-path message , we can just set for some thus ensuring that this deviation is also not profitable. Hence, commitment is not valuable.
As the intuition above suggests, Theorem 1 can easily be extended to establish a threefold equivalence. Generically, the following imply each other: (i) commitment is valuable, (ii) committed Sender values randomization, and (iii) any optimal persuasion profile induces a belief under which Receiver has multiple optimal actions (see Theorem 1′ in the Appendix).
We postpone the discussion of the converse direction until the next section, as the intuition for it is related to the intuition for Theorem 2. Formal proofs are in the Appendix.
4 Value of commitment: willingness-to-pay
In this section, we consider a Sender without commitment power who engages in a cheap-talk game. We ask whether he would be strictly better off if he had commitment power. We link the value of such commitment to Sender’s behavior in Sender-preferred cheap-talk equilibria, in particular to whether Sender necessarily randomizes in such equilibria.
Theorem 2.
Generically, commitment is valuable if cheap-talk Sender values randomization.
Theorem 2 and the if-direction of Theorem 1 both derive from the following result. Generically, if a cheap-talk equilibrium yields the persuasion payoff, then there is a partitional and a (pure strategy) such that is a cheap-talk equilibrium and yields the persuasion payoff. We build this result (Lemma 4 in the Appendix) in two steps.
The first step (Lemma 5 in the Appendix) shows that, generically, if is R-BR and yields the persuasion payoff, then must be a pure strategy on-path. Consider toward contradiction that there is an sent with positive probability under , and there are two distinct actions, say and , in the support of . It must be that both Sender and Receiver are indifferent between and under belief : Receiver has to be indifferent because is R-BR; Sender has to be indifferent because yields the persuasion payoff, which maximizes over all persuasion profiles.141414If Sender strictly prefers one action over the other, say over , at , then Sender would obtain a higher payoff if Receiver always takes following (which would remain R-BR given Receiver’s indifference). The result then follows from establishing that such a coincidence of indifferences generically cannot arise when Sender is optimizing. For some intuition for why this is the case, consider Figure 1 which illustrates this result when there are three states. Suppose and are in the support of . Region denotes beliefs where Receiver prefers . Region denotes beliefs where Sender prefers . Generically, the border between and is distinct from the border between and and thus the two borders have at most one intersection, . Moreover, generically (if it exists) is an interior belief. But now, Sender could deviate to an alternate strategy that induces beliefs and instead of , with Receiver still indifferent between and at both and . Suppose that Receiver takes action following belief . This strategy is still R-BR for Receiver and gives Sender a strictly higher payoff. Thus, we have reached a contradiction. With more than three states and more than two actions, the proof that the coincidence of indifferences generically cannot arise is conceptually similar but notationally more involved. It is presented in the Appendix as Lemma 2.

The second step (Lemma 6 in the Appendix) shows that, generically, if is a cheap-talk equilibrium that yields the persuasion payoff, and is a pure strategy on-path, then there is a partitional cheap-talk equilibrium that yields the persuasion payoff. This is easy to see. Generically, for any and any , we have . Now, consider some cheap-talk equilibrium that yields the persuasion payoff with is a pure strategy on-path. If is partitional, our result is immediate. Suppose to the contrary that in some , both and are sent with positive probability. Then, and must induce the same action: if induces some and induces a distinct , the fact that would mean that cannot be S-BR. Given that any two messages sent in induce the same action, we can define as the action that Receiver takes in state given .
Now, we can consider an alternative, partitional profile . Let be any injective function from to . Let and . It is immediate that is also a cheap-talk equilibrium and yields the persuasion payoff.
Corollary 1.
If cheap-talk Sender values randomization, then committed Sender values randomization.
5 How often is commitment valuable?
Theorems 1 and 2 would not be particularly interesting if it turned out that both commitment and randomization are almost always valuable.
When or , it is easy to see that neither commitment nor randomization are valuable, but those are knife-edge cases and it is important to show that commitment has no value in a broader class of environments. We do so in this section.
To formalize our result, we fix an arbitrary prior and generate random environments by drawing Sender’s utility for each action-state i.i.d. from some atomless distribution and Receiver’s utility for each action-state i.i.d from some atomless distribution . We further assume that for each , the random variables and are independent from one another.
We should note that this structure does not preclude any particular configuration of preferences. For any and , with some probability the environment will be such that Sender’s and Receiver’s preferences are perfectly aligned, with some probability they will be completely opposed, with some probability they will be aligned in some states but not others, etc.
Fixing and , we thus generate stochastic environments and can ask: what is the probability that commitment (or equivalently randomization) has no value. Our main theorem in this section establishes results about that turn out to be independent of , , and .
Theorem 3.
For any interior and any atomless and :
-
•
-
•
as ,
Denote the action space by and denote elements of by through . Let be the set of states where is Sender’s ideal action. The requesting messaging strategy sets for .151515Generically, and do not intersect. An obliging action strategy sets . A profile that consists of the requesting and an obliging strategy yields Sender’s ideal payoff.
Say that an environment is obedient if for each and each , we have
(1) |
If the environment is obedient, a profile that consists of the requesting and an obliging strategy clearly constitutes a cheap-talk equilibrium. Since such a profile yields Sender’s ideal payoff, commitment clearly has no value if the environment is obedient.161616The obedience condition also appears in Antic, Chakraborty, and Harbaugh (2022) and Aybas and Callander (2024). In Antic, Chakraborty, and Harbaugh (2022), it is a necessary condition for the possibility of subversive conversations: without it, a third-party (Receiver) with veto power would prevent a committee (Sender) from implementing a project solely based on the information that the committee wants to do so. Aybas and Callander (2024) consider preferences of the form and for some where is the realized path of a Brownian motion. They identify features of and that make the environment obedient.
Now, for any that is not empty, the probability that inequality is satisfied is , since for each , and are i.i.d. with an atomless distribution. Moreover, given two non-empty and , the probability that inequality is satisfied for is independent of the probability that it is satisfied for . Thus if every is non-empty, the probability that the environment is obedient (i.e., inequality is satisfied for each of the sets) is , or .
If an is empty, inequality is satisfied vacuously for that . Thus, for any and any atomless and the overall probability that the environment is obedient must be weakly greater than . Since commitment has no value in obedient environments, we conclude that
We establish the second part of the theorem by showing that as grows large: (i) the likelihood that an is empty converges to zero so converges to , and (ii) converges to .
Part (i) is easy to see. For any , as grows large, the chance that there is no state where is Sender’s ideal action vanishes.
To establish part (ii), say that an environment is jointly-inclusive if for every action , there is some state such that is the ideal action for both Sender and Receiver in . Analogously to part (i), it is easy to see that as grows large, the probability that the environment is jointly-inclusive converges to . To complete the proof, we argue that, generically, if the environment is jointly-inclusive and commitment has no value, then the environment must be obedient. First, we know from Theorem 2, that there is a partitional profile that is a cheap-talk equilibrium and yields the persuasion payoff. Next, we note that every action must be induced by : there is a state where is both Sender’s and Receiver’s ideal action, so if were never taken, the committed Sender could profitably deviate by sometimes171717Sender could reveal with some probability ; Receiver’s response to all other messages would remain unchanged if is sufficiently small. revealing and thus inducing , thus contradicting the fact that yields the persuasion payoff. This in turn implies that, for every , the action induced in , , must be Sender’s ideal action in . If Sender strictly preferred some other in , could not be S-BR as the cheap-talk Sender would profitably deviate and set to be whatever message induces ; since all actions are induced by , there must be such a message. Taking stock, we have established that is a partitional profile that is R-BR (since it is a cheap-talk equilibrium) and induces Receiver to take Sender’s ideal action in every state. But this means that every message sent under fully reveals what action is ideal for Sender, and Receiver obliges and takes that action. Hence, the environment is obedient.
We conclude this section with a few comments.
First, as the argument above makes clear, when the state space is large, Sender does not value commitment only if he can obtain his ideal payoff in a cheap-talk equilibrium.181818Formally, as goes to infinity, the probability of an environment such that Sender does not value commitment even though he does not obtain his ideal payoff converges to zero. With a smaller state space, however, cheap-talk and persuasion payoffs can coincide even if they are substantially lower than the ideal payoff.
Second, the assumption that Sender’s and Receiver’s utility are drawn from distributions that are i.i.d. across action-state pairs is more palatable if we think of and as being not merely finite but also “unstructured,” without a natural metric. For example, if includes actions such as “buy one apple” and “buy two apples”, or includes states such as “temperature will be 88 Fahrenheit” and “temperature will be 89 Fahrenheit,” then assuming that is independent of as soon as or would be unreasonable.
Third, in the second part of Theorem 3, a reader might be concerned that, by keeping and fixed as grows, we are “squishing” utilities together and making the difference in payoffs become vanishingly small. We could let and depend on and in an arbitrary way, however, and the Theorem would still hold. We formulate the Theorem with a fixed and solely for ease of exposition.
Fourth, the obedience condition seems to have some flavor of alignment of Sender and Receiver’s preferences. While that may the case, the obedience condition does not preclude the possibility that Receiver is much worse off than she would be if Sender and Receiver’s preferences were fully aligned. For instance, consider the prosecutor-judge example and suppose that the prior is rather than ; then, the environment is obedient but Receiver obtains no information.
6 Conclusion
Our analysis suggests some potential directions for future research.
We establish that, generically, commitment has zero value if and only if randomization has zero value for a committed Sender. A natural question would be whether a small (or large) value of commitment implies or is implied by a small (or large) value of randomization.
Throughout, we focus on how Sender’s commitment impacts Sender’s payoff. One could also explore the impact of Sender’s commitment on Receiver’s payoff.
References
- Antic et al. (2022) Nemanja Antic, Archishman Chakraborty, and Rick Harbaugh. Subversive conversations. Technical report, 2022.
- Aybas and Callander (2024) Yunus C Aybas and Steven Callander. Cheap talk in complex environments. 2024.
- Best and Quigley (2024) James Best and Daniel Quigley. Persuasion for the long run. Journal of Political Economy, 132(5):1740–1791, 2024.
- Corrao and Dai (2023) Roberto Corrao and Yifan Dai. The bounds of mediated communication. arXiv preprint arXiv:2303.06244, 2023.
- Crawford and Sobel (1982) Vincent P Crawford and Joel Sobel. Strategic information transmission. Econometrica: Journal of the Econometric Society, pages 1431–1451, 1982.
- Doval and Skreta (2022) Laura Doval and Vasiliki Skreta. Mechanism design with limited commitment. Econometrica, 90(4):1463–1500, 2022.
- Dughmi (2017) Shaddin Dughmi. Algorithmic information structure design: a survey. ACM SIGecom Exchanges, 15(2):2–24, 2017.
- Dworczak and Kolotilin (2024) Piotr Dworczak and Anton Kolotilin. The persuasion duality. arXiv preprint arXiv:1910.11392, 2024.
- Dworczak and Martini (2019) Piotr Dworczak and Giorgio Martini. The simple economics of optimal persuasion. Journal of Political Economy, 127(5):1993–2048, 2019.
- Glazer and Rubinstein (2006) Jacob Glazer and Ariel Rubinstein. A study in the pragmatics of persuasion: a game theoretical approach. Theoretical Economics, 1:395–410, 2006.
- Ivanov (2021) Maxim Ivanov. Optimal monotone signals in bayesian persuasion mechanisms. Economic Theory, 72(3):955–1000, 2021.
- Kamenica and Gentzkow (2011) Emir Kamenica and Matthew Gentzkow. Bayesian persuasion. American Economic Review, 101(6):2590–2615, 2011.
- Koessler and Skreta (2023) Frédéric Koessler and Vasiliki Skreta. Informed information design. Journal of Political Economy, 131(11):3186–3232, 2023.
- Kolotilin (2018) Anton Kolotilin. Optimal information disclosure: A linear programming approach. Theoretical Economics, 13(2):607–635, 2018.
- Kolotilin et al. (2023) Anton Kolotilin, Roberto Corrao, and Alexander Wolitzky. Persuasion and matching: Optimal productive transport. arXiv preprint arXiv:2311.02889, 2023.
- Lin and Liu (2024) Xiao Lin and Ce Liu. Credible persuasion. Journal of Political Economy, 132(7):2228–2273, 2024.
- Lipnowski (2020) Elliot Lipnowski. Equivalence of cheap talk and bayesian persuasion in a finite continuous model, 2020.
- Lipnowski and Ravid (2020) Elliot Lipnowski and Doron Ravid. Cheap talk with transparent motives. Econometrica, 88(4):1631–1660, 2020.
- Lipnowski et al. (2022) Elliot Lipnowski, Doron Ravid, and Denis Shishkin. Persuasion via weak institutions. Journal of Political Economy, 130(10):000–000, 2022.
- Lipnowski et al. (2024) Elliot Lipnowski, Doron Ravid, and Denis Shishkin. Perfect bayesian persuasion. arXiv preprint arXiv:2402.06765, 2024.
- Mathevet et al. (2024) Laurent Mathevet, David Pearce, and Ennio Stacchetti. Reputation and information design. Working Paper, 2024.
- Min (2021) Daehong Min. Bayesian persuasion under partial commitment. Economic Theory, 72:743–764, 2021.
- North (1993) Douglass C North. Institutions and credible commitment. Journal of Institutional and Theoretical Economics (JITE)/Zeitschrift für die gesamte Staatswissenschaft, pages 11–23, 1993.
- Perez-Richet (2014) Eduardo Perez-Richet. Interim bayesian persuasion: First steps. American Economic Review, 104(5):469–474, 2014.
- Sher (2011) Itai Sher. Credibility and determinism in a game of persuasion. Games and Economic Behavior, 71(2):409–419, 2011.
- Skreta (2006) Vasiliki Skreta. Sequentially optimal mechanisms. The Review of Economic Studies, 73(4):1085–1111, 2006.
Appendix A Appendix
A.1 Notation and terminology
Let . Let .
Given a messaging strategy , let be the set of messages that are sent with positive probability under . For any , if is degenerate (i.e., there exists a message such that ), we abuse notation and let denote the message that is sent in state . Similarly, if is degenerate, we let denote the action taken following message .
We say that is pure if is degenerate for all . Given a profile , we say is pure-on-path if is degenerate for all .
We denote a vector all of whose elements are equal to by . We sometimes use and sometimes use for an element of .
A.2 Generic environments for the proofs
We now introduce two generic sets of environments that will play important roles in the proofs.
A.2.1 Partitional-unique-response environments
An environment satisfies partitional-unique-response if for every non-empty ,
is a singleton.
Note that whether an environment satisfies partitional-unique-response does not depend on Sender’s preferences. The partitional-unique-response property requires that, at the finitely many beliefs induced by partitional experiments, Receiver has a unique best response at those beliefs.
Lemma 1.
The set of partitional-unique-response environments is generic.
Proof.
Given a triplet such that , , and , let denote the set of such that
(2) |
An environment does not satisfy partitional-unique-response only if .
We wish to show that has measure zero in , which implies that the set of partitional-unique-response environments is generic.
Fix any and . For any , the set of that satisfy (2) can be written as:
(3) |
where
So (3) defines a hyperplane of , and thus has Lebesgue measure zero in .
Thus, by Fubini’s Theorem, the set of pairs that satisfy (2) has Lebesgue measure zero in . Finally, since there is finite number of possible , and , the set also has Lebesgue measure zero in ∎
A.2.2 Scant-indifferences environments
For each , let and denote the payoff vectors across the states.
For each define the expanded-indifference matrix as follows. Let be the matrix with rows and columns, with each row associated with and equal to . Let be the matrix with rows and columns, with each row associated with and equal to . Let be the identity matrix of size . Then, let
Given any matrix , a row-submatrix of is a matrix formed by removing some of the rows of .
Finally, we say that an environment satisfies scant-indifferences if every row-submatrix of every expanded-indifference matrix is full rank.
We anticipate that the reader might find this definition mysterious, so we now try to provide some intuition by connecting this definition to the proof sketch we gave in the body of the paper for Theorem 2 in the case with two actions and three states.
Recall, that in Figure 1, the argument behind Lemma 5 relied on two facts that must hold generically. First, the border between and is distinct from the border between and and thus the two borders have at most one intersection, . Second, generically (if it exists) is an interior belief. Moreover, the argument behind Lemma 6 relied on the fact that, generically, for any and , .
We now illustrate why these three facts hold in any scant-indifferences environment. With only two actions, we can look at only, since the argument for is identical. We have
where and analogously for other states and .
First, consider the row-submatrix
Note that both Sender and Receiver are indifferent between the two actions at a belief if and only if . Thus, requiring that be full-rank is equivalent to requiring that the border between and not be parallel to the border between and . A fortiori, the environment satisfying scant-indifferences implies that the two borders do not coincide.
Second, consider the row-submatrix
Requiring that this matrix be full-rank yields that puts strictly positive probability on . Considering the row-submatrices that alternatively include the other two rows of the identity matrix yields that puts strictly positive probability on and .
Finally, suppose that in, say state , . Consider the row-submatrix
Clearly, this matrix is not full-rank, so scant-indifferences rules out the possibility that .
Having motivated the definition of scant-indifferences environments (and given some intuition for why our results hold in such environments), we now establish that the set of such environments is generic.
Lemma 2.
The set of scant-indifferences environments is generic.
Proof.
Whether an environment satisfies scant-indifferences does not depend on . Accordingly, we seek to show that the set of such that every row-submatrix of every expanded-indifference matrix is full-rank has full Lebesgue measure on .
First, observe that given any expanded-indifference matrix , if every square row-submatrix of is full-rank, than every row-submatrix of is full-rank. To see why, suppose every square row-submatrix of is full-rank. Now, consider an arbitrary row-submatrix of . If square, it obviously has full-rank. Suppose that has more than rows. In that case, every square row-submatrix of is also a square row-submatrix of . This row-submatrix has rank . Therefore, has rank and is thus full-rank. Finally, suppose hat has fewer than rows. We know that is a row-submatrix of some square row-submatrix of . We know has full-rank so all of its rows are linearly independent. Consequently, the subset of its rows that constitute is also linearly independent.
Now that we can consider only square row-submatrices of , we recall that a square matrix is full-rank if and only if its determinant is non-zero. Hence, it will suffice to show that for a full Lebesgue measure set of , the determinant of every square row-submatrix of every expanded-indifference matrix is non-zero. Given , consider some square row-submatrix of some expanded-indifference matrix. The determinant of is a non-zero polynomial function of . The zero set of any non-zero polynomial function has Lebesgue measure zero, so the set of for which does not have full rank has Lebesgue measure zero. Since there are only finitely many square row-submatrices of expanded-indifference matrices, the fact that any one of them is generically full-rank implies that all of them are generically full-rank (a union of finitely many sets of Lebesgue measure zero has Lebesgue measure zero). ∎
As we noted above (for the three state, two action case), in scant-indifferences environments, there is no state in which Sender is indifferent between two distinct actions.
Lemma 3.
In any scant-indifferences environment, for any and , .
Proof.
Suppose, toward a contradiction, that there exist some , , and such that . Without loss, suppose this holds for . Then, the vector has zero as its first element. Now consider the row sub-matrix of
This matrix is not full-rank because the first row can be expressed as a linear combination of the other rows. ∎
A.3 Key Lemma
Lemma 4.
In a scant-indifferences environment, if commitment has no value, then there is a partitional and a pure strategy such that is a cheap-talk equilibrium and yields the persuasion payoff (and ).
Lemma 4 will be useful for proofs of Theorems 1, 2, and 3. The parenthetical remark that will be useful in the proof of Theorem 3.
To establish the Lemma, we first show that if a cheap-talk equilibrium yields the persuasion payoff, then Receiver must not randomize on path in that equilibrium. Second, we show that if Receiver does not randomize on path, Sender also need not randomize.
Lemma 5.
In a scant-indifferences environment, if is R-BR and yields the persuasion payoff, then must pure-on-path.
Proof.
Suppose by contradiction that the environment satisfies scant-indifferences, profile is R-BR and yields the persuasion payoff, yet there exists a message such that .
We first note that both Sender and Receiver must be indifferent among all the actions in given , the belief induced by message . In other words, for all ,
(4) | |||
(5) |
Equation (4) follows immediately from R-BR. Equation (5) follows from the fact that yields the persuasion payoff: if say , an alternative strategy profile where Receiver breaks ties in favor of Sender would still satisfy R-BR while strictly improving Sender’s payoff.
For each belief , let denote the set of Receiver’s optimal actions under belief ; that is, . Clearly, , meaning that contains at least the actions in the support of , but may also contain additional optimal actions that are not played following . Without loss of generality, let and for some . Note that for any .
In addition, Equation (5) implies that for any . Combining both Sender’s and Receiver’s indifference conditions, we have
(6) |
Let , the (potentially empty) set of states that are not in the support of . Without loss, suppose that where . If (i.e., ), then we have
(7) |
Let , , , and . Note that is a row-submatrix of the expanded-indifference matrix .
Next we make two observations: (i) , otherwise the unique solution to is . Since we are in a scant-indifferences environment, this means that has full row rank; (ii) vector can not be represented as a linear combination of rows of . To see why, assume toward contradiction that there exists a row vector such that . This would lead to a contradiction that .
Observations (i) and (ii) together imply that the matrix has full row rank. Consequently, we know
Now, we claim that there exists such that
(8) |
and
(9) |
To see this, suppose by contradiction that for any that solves (8), we have . This would imply that the set of solutions to (8) and the set of solutions to
(10) |
coincide. By the Rank-Nullity Theorem, however, the subspace defined by (10) has dimension , while the subspace defined by (8) has a higher dimension .
Consider two vectors, and , where . First we verify that for sufficiently small , . Since , it follows that . For , we have , so for small enough , . For , we know is a row of , so . Consequently, Thus, .
Observe that . First, for any , if is sufficiently small, . Therefore, . But, implies that is constant across , so .
Consider an alternative messaging strategy that is identical to , except that the message is split into two new messages, and , which induce the beliefs and , respectively.191919It is possible for , but we can consider an alternative strategy that induces the same outcome as and uses only messages. We can also let play the role of or , so our assumption that suffices. We consider that agrees with on messages other than and leads Receiver to break indifferences in Sender’s favor following and . We will show that yields a strictly higher payoff to Sender, thus contradicting the assumption that yields the persuasion payoff.
Since , we know there is an such that .
Because , we have
and
We now establish that at least one of these inequalities has to be strict. Suppose toward contradiction that both hold with equality. The first equality implies , which combined with the fact that implies that . Similarly, the second equality implies that . Together, this yields that , a contradiction. Hence, one of the inequalities has to be strict.
Consequently, Sender’s interim payoff under (in the event that is sent under ) is
Thus, yields a strictly higher payoff to Sender, contradicting the assumption that yields the persuasion payoff. ∎
Lemma 6.
In a scant-indifferences environment, if a cheap-talk equilibrium yields the persuasion payoff and is pure-on-path, then there exists a partitional and a pure strategy such that and is a cheap-talk equilibrium and yields the persuasion payoff.
Proof.
Suppose a cheap-talk equilibrium yields the persuasion payoff and is pure-on-path.
First, we show that for any and any such that , . The fact that both and are sent in implies that . Moreover, by Lemma 3, there exist no distinct and such that , so it must be that .
Let be the set of actions that are taken on-path. Without loss, let . For each , let be the set of on-path messages that induce action , and be the set of states that induce action . Note that is a partition of Moreover, it is easy to see that is a partition of . First, cannot be empty because every is taken on-path. Second, every belongs to some as only actions in are taken on-path; hence, . Finally, the fact that for any and any such that we have implies that if , and are disjoint. To see why, suppose toward contradiction that some The fact that implies there is a message such that . The fact that implies there is a message such that . But this cannot be since .
Now select one message in each , and label it as .
Next, consider the following alternative strategy profile :
-
•
if .
-
•
-
•
if .
Note that is well defined because is a partition of . By construction, is partitional, and is a pure strategy. Moreover, under both and , every state in induces action with probability 1. Thus, the two strategy profiles induce the same distribution over states and actions, so also yields the persuasion payoff. It remains to show that is a cheap-talk equilibrium.
Note that S-BR of implies that for any and , we have
Therefore, for any , for all . This implies that for all . Hence, satisfies S-BR.
Fact is R-BR requires that for all ,
For any , we sum the inequality above over all . Since for we have , this yields
Since for any and , we have , the inequality above implies
Since if , we have
(11) |
To establish is R-BR, we need to show that for any , we have
But, by definition of , we know that for and that . Hence, the inequality above is equivalent to Equation . ∎
A.4 Proof of Theorem 1
We present and prove a result that generalizes Theorem 1 into a threefold equivalence.
Theorem 1′.
Generically, the following statements are equivalent:
-
1.
Commitment is valuable.
-
2.
Committed Sender values randomization.
-
3.
For any optimal persuasion profile , there exists such that
where is defined as
Proof.
We establish the equivalence for any environment that satisfies both partitional-unique-response and scant-indifferences. Since the set of partitional-unique-response environments is generic (Lemma 1) and the set of scant-indifferences environments is generic (Lemma 2), the set of environments that satisfy both properties is also generic.
We will establish that (2) implies (1), then that (1) implies (3), and finally that (3) implies (2).
Since we are in a scant-indifferences environment, (2) implies (1) by Lemma 4.
Next we wish to show that (1) implies (3). We do so by establishing the contrapositive. Suppose that there exists an optimal persuasion profile such that for every , is unique. This implies that must be pure-on-path. We will construct an optimal persuasion profile that it is a cheap-talk equilibrium. Consider the following : for all , let ; for , let for some . Since and coincide on path, and yield the same payoffs to both Sender and Receiver. Therefore, satisfies R-BR and yields the persuasion payoff. It remains to show that is S-BR, which is equivalent to Sender’s interim optimality: for each ,
(12) |
for all . First, note that it suffices to show that Equation holds for . Once we establish that, we know since . Therefore, since for , Equation holds for .
Now, suppose toward contradiction that there exist and such that . Consider an alternative messaging strategy : for while sends the same distribution of messages as with probability and otherwise sends message . Formally, .
Fix any . Since is finite, the fact that is the unique implies that remains the best response for a neighborhood of beliefs around . Therefore, for sufficiently small , is R-BR. Hence, is a persuasion profile and yields the payoff
This contradicts the fact that yields the persuasion payoff.
Finally, since we are considering a partitional-unique-response environment, the fact that (3) implies (2) is immediate. ∎
A.5 Proof of Theorem 2
A.6 Proof of Theorem 3
Recall that we consider a setting where for each , is drawn from and is drawn from . Both and are atomless, and all variables are mutually independent. Throughout this section, we fix some atomless and and some interior prior . When we say that the probability of some property is , we mean that when and , the likelihood that satisfies that property is . We use the word event to refer to a set of environments.
Given , let denote the set of states where is an ideal action for Sender.202020In the body of the paper we denoted this set as simply , but for the formal proofs, it is helpful to keep track of the fact that this set depends on the randomly drawn . Note that each must belong to at least one , but the same may appear in multiple . Say that is regular if for . Lemmas 2 and 3 jointly imply that the set of that are regular has full Lebesgue measure in . Since is atomless, this in turn implies that is regular with probability one.
Recall that an environment is obedient if for each non-empty ,
(13) |
A.6.1 Arbitrary state space
In this section, we establish that for any ,
Lemma 7.
In any obedient environment, commitment has no value.
Proof.
Select elements from and denote them by through . Consider a pure strategy profile such that
-
•
implies ;212121If is not regular, it could be that belongs to and for distinct and . If so, it does not matter whether is or . The fact that , implies there exists a such that implies .
-
•
for ;
-
•
for .
From (13), this strategy profile satisfies R-BR. In addition, in every state, Sender achieves his ideal payoff, so S-BR is satisfied and the profile yields the persuasion payoff. Therefore, is a cheap-talk equilibrium that yields the persuasion payoff. ∎
Lemma 8.
.
Proof.
Fix some regular . Consider any non-empty . Given independence and the fact that each is drawn from the atomless , each has an equal chance, , to maximize . In particular,
Moreover, this probability is independent across . Therefore,
(14) |
This is an inequality because some could be empty. So, we have established that for any regular , Since is regular with probability one, this in turn implies . ∎
A.6.2 Limit as
In this section, we establish that as ,
We first give an outline of the proof. The proof is broken up into two major parts. First, recall that obedience implies that commitment has no value, but the converse does not hold in general. We first show that generically, if the environment is jointly-inclusive,222222Recall that an environment is jointly-inclusive if for every action , there is some state such that is the unique ideal action for both Sender and Receiver in . then commitment having no value implies obedience (Lemma 9). We then show, that as , the probability of joint-inclusivity converges to one (Lemma 10). Combining these two results, we conclude that as , .
Second, recall that and that the reason this is an inequality is the possibility that some might be empty. When no is empty, it is indeed the case that (Lemma 12). We then show, that as , the probability that some is empty converges to zero (Lemma 13). Combining these two results, we conclude that as , .
Lemma 9.
If commitment has no value in a jointly-inclusive environment that satisfies partitional-unique-response and scant-indifferences, then this environment is obedient.
Proof.
Consider a jointly-inclusive environment that satisfies partitional-unique-response and scant-indifferences and suppose that commitment has no value. By Lemma 4, there is a partitional and a pure strategy such that and is a cheap-talk equilibrium and yields the persuasion payoff.
First note that every action is induced under ; that is, for any , there exists such that . To see why, suppose toward contradiction that there is an that is not induced. Since the environment is jointly-inclusive, there exists such that
(15) |
Since , there is an unsent message, say .
Consider the strategy profile :
-
•
for , and .
-
•
for , and .
We show that is R-BR for sufficiently small . For any , Receiver’s belief upon observing is unchanged, so remains a best response. For , (15) implies that is the best response. For , the fact the environment satisfies partitional-unique-response implies that is the unique best response to . Moreover, since is finite, this further implies that remains the best response for a neighborhood of beliefs around . Therefore, for sufficiently small , remains a best response.
Now, note that because is not induced under . By (15),
This contradicts the fact that yields the persuasion payoff. Hence, we have established that every action is induced under .
Next, we show that this fact, coupled with the maintained assumptions, implies that the environment is obedient. Recall that is a cheap-talk equilibrium; hence for each ,
Since every action is induced under , the inequality above is equivalent to
Moreover, since the environment satisfies scant-indifferences, Lemma 3 implies that
(16) |
Hence, and for . Let . For each and each , R-BR of implies
Summing over all , and noting that , we have
Thus, the environment is obedient. ∎
Lemma 10.
As , .
Proof.
Let denote the event that is the unique ideal action for both Sender and Receiver in state . Let denote the event that action is the unique ideal action for both Sender and Receiver in some state. Let denote joint-inclusivity: each action is uniquely ideal for for both Sender and Receiver in some state. Our goal is to show that as .
Since and are atomless and payoffs are independent, in each state , the probability that any given action is the unique ideal action for Sender is , and the same holds for Receiver. Hence, for any and .
Moreover, for each , the events are independent across . Therefore,
Finally,
∎
Lemma 11.
As , .
Proof.
Let PPS denote the event that the environment is jointly-inclusive and satisfies partitional-unique-response and scant-indifferences. We know that in any PPS environment, if commitment has no value, then the environment is obedient (Lemma 9) Hence, . As , (Lemmas 1, 2, and 10). Hence, As , . Moreover, in general . Thus, as , . ∎
Say an environment is Sender-inclusive if is non-empty for all .
Lemma 12.
Proof.
As noted earlier in Equation , . If the environment is Sender-inclusive, no is empty, so . Since is regular with probability one, we have . ∎
Lemma 13.
As , .
Proof.
Obviously, any jointly-inclusive environment is Sender-inclusive. Thus, this Lemma is a corollary of Lemma 10. ∎
Lemma 14.
As , .