This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Commitment and Randomization in Communication

Emir Kamenica and Xiao Lin

October 2024
Kamenica: Booth School of Business, University of Chicago, 5807 S. Woodlawn Ave., Chicago, IL 60637 ([email protected]); Lin: Department of Economics, University of Pennsylvania, 133 S. 36th St., Philadelphia PA 19104 ([email protected]). We are grateful to Nima Haghpanah, Ilwoo Hwang, Yuhta Ishii, Elliot Lipnowski, Eric Mbakop, John Moore, Daniel Rappoport, Ina Taneva for helpful comments.
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 |A|\left|A\right| actions, the likelihood that commitment has no value is at least 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}. As the number of states grows large, this likelihood converges precisely to 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}.

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 uSu_{S} and Receiver’s utility by uRu_{R}, it is easy to see that when uS=uRu_{S}=u_{R}, neither commitment nor randomization is valuable (because full information is optimal and achievable via a cheap-talk equilibrium). Similarly, when uS=uRu_{S}=-u_{R}, 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 |A|\left|A\right| 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 FF and we draw Receiver’s utility i.i.d. from some distribution GG. 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 (FF and GG), the likelihood that commitment has no value is bounded below by 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}; moreover, as the number of states grows large, the likelihood that commitment has no value converges precisely to 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}} (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 14\frac{1}{4}.

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 0.30.3.

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 37\frac{3}{7} 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.

More distantly, we appertain to the literature on partial commitment in mechanism design (Skreta 2006; Doval and Skreta 2022).

2 Set-up and definitions

Preference and beliefs

Receiver (she) has a utility function uR(a,ω)u_{R}\left(a,\omega\right) that depends on her action aAa\in A and the state of the world ωΩ\omega\in\Omega. Both AA and Ω\Omega are finite; our results rely heavily on this assumption.555At the risk of being excessively philosophical, we consider environments with finite AA and Ω\Omega to be more realistic than any alternative. The use of infinite sets often provides tractability, but rarely improves realism. For any finite set XX, we denote its cardinality by |X|\left|X\right|. Sender (he) has a utility function uS(a,ω)u_{S}\left(a,\omega\right) that depends on Receiver’s action and the state. The players share an interior common prior μ0\mu_{0} on Ω\Omega. For each player ii, we say action aa^{*} is ii’s ideal action in ω\omega if aargmaxaAui(a,ω)a^{*}\in\operatorname*{arg\,max}_{a\in A}u_{i}(a,\omega).

Genericity

Since our theorems will hold “generically,” we now formalize that notion. We refer to the triplet (uS,uR,μ0)\left(u_{S},u_{R},\mu_{0}\right) as the (preference-prior) environment. The set of all environments is 2|A||Ω|×ΔΩ\mathbb{R}^{2\,\left|A\right|\,\left|\Omega\right|}\times\Delta\Omega.666For any finite set XX, we denote the set of all distributions on XX by ΔX\Delta X. A set of environments is generic if its complement has zero Lebesgue measure in 2|A||Ω|×ΔΩ\mathbb{R}^{2\,\left|A\right|\,\left|\Omega\right|}\times\Delta\Omega. 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 MM be a finite message space with |M|>|A||M|>|A|. Sender chooses a messaging strategy σ:ΩΔM\sigma:\Omega\rightarrow\Delta M. Receiver chooses an action strategy ρ:MΔA\rho:M\rightarrow\Delta A.

A profile of strategies (σ,ρ)(\sigma,\rho) induces expected payoffs

Ui(σ,ρ)=ω,m,aμ0(ω)σ(m|ω)ρ(a|m)ui(a,ω)for i=S,R.U_{i}(\sigma,\rho)=\sum_{\omega,m,a}\,\mu_{0}(\omega)\,\sigma(m|\omega)\,\rho(a|m)\,u_{i}(a,\omega)\quad\text{for }i=S,R.

A profile (σ,ρ)(\sigma^{*},\rho^{*}) is S-BR if σargmaxσU(σ,ρ)\sigma^{*}\in\operatorname*{arg\,max}_{\sigma}U(\sigma,\rho^{*}). A profile (σ,ρ)(\sigma^{*},\rho^{*}) is R-BR if ρargmaxρUR(σ,ρ)\rho^{*}\in\operatorname*{arg\,max}_{\rho}U_{R}(\sigma^{*},\rho).

Sender’s ideal payoff is the maximum USU_{S} 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 USU_{S} 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 USU_{S} 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 AA and Ω\Omega, 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 σ\sigma is partitional if for every ω\omega, there is a message mm such that σ(m|ω)=1\sigma\left(m|\omega\right)=1. A profile (σ,ρ)\left(\sigma,\rho\right) is a partitional profile if σ\sigma 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 USU_{S} induced by a partitional persuasion profile. The cheap-talk partitional payoff is the maximum USU_{S} 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 (σ,ρ)\left(\sigma,\rho\right). Let MσM_{\sigma} be the set of messages that are sent in equilibrium. For each mMσ,m\in M_{\sigma}, let Ωm\Omega_{m} be the set of states that lead to message mm, and let μm\mu_{m} be the belief induced by mm. For a generic set of environments, Receiver’s optimal action given belief μm\mu_{m} (call it ama_{m}) is unique. Since AA is finite, ama_{m} must be the uniquely optimal action in a neighborhood of beliefs around μm\mu_{m}. Subtly, this implies that every action ama_{m} taken in equilibrium must be Sender’s preferred action, among the actions taken in equilibrium, in all states where action ama_{m} is taken. That is a mouthful, so in other words: let A={am|mMσ}A^{*}=\left\{a_{m}|m\in M_{\sigma}\right\}; for each amAa_{m}\in A^{*}, we must have uS(am,ω)uS(am,ω)u_{S}\left(a_{m},\omega\right)\geq u_{S}\left(a_{m^{\prime}},\omega\right) for all amAa_{m^{\prime}}\in A^{*} and all ωΩm\omega\in\Omega_{m}. Why does this hold? If it were not the case, Sender could attain a higher payoff with an alternative strategy. Suppose uS(am,ω)<uS(am,ω)u_{S}\left(a_{m},\omega\right)<u_{S}\left(a_{m^{\prime}},\omega\right) for some amAa_{m^{\prime}}\in A^{*}, ωΩm\omega\in\Omega_{m}. Sender could send mm^{\prime} in ω\omega with a small probability and still keep ama_{m} optimal given mm. Finally, the fact that uS(am,ω)uS(am,ω)u_{S}\left(a_{m},\omega\right)\geq u_{S}\left(a_{m^{\prime}},\omega\right) for all amAa_{m^{\prime}}\in A^{*} and all ωΩm\omega\in\Omega_{m} implies that strategy under consideration also constitutes a cheap-talk equilibrium.131313Deviating to an on-path message mMm\in M^{*} obviously cannot be profitable; for any off-path message mMm\neq M^{*}, we can just set σR(|m)=σR(|m)\text{$\sigma_{R}$$\left(\cdot|m\right)$}=\sigma_{R}\left(\cdot|m^{*}\right) for some mM,m^{*}\in M^{*}, 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 σ\sigma and a (pure strategy) ρ\rho such that (σ,ρ)(\sigma,\rho) 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 (σ,ρ)\left(\sigma,\rho\right) is R-BR and yields the persuasion payoff, then ρ\rho must be a pure strategy on-path. Consider toward contradiction that there is an mm sent with positive probability under σ\sigma, and there are two distinct actions, say aa and aa^{\prime}, in the support of ρ(|m)\rho\left(\cdot|m\right). It must be that both Sender and Receiver are indifferent between aa and aa^{\prime} under belief μm\mu_{m}: Receiver has to be indifferent because (σ,ρ)\left(\sigma,\rho\right) is R-BR; Sender has to be indifferent because (σ,ρ)\left(\sigma,\rho\right) yields the persuasion payoff, which maximizes USU_{S} over all persuasion profiles.141414If Sender strictly prefers one action over the other, say aa over aa^{\prime}, at μm\mu_{m}, then Sender would obtain a higher payoff if Receiver always takes aa following mm (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 a1a_{1} and a2a_{2} are in the support of ρ(|m)\rho\left(\cdot|m\right). Region RiR_{i} denotes beliefs where Receiver prefers aia_{i}. Region SiS_{i} denotes beliefs where Sender prefers aia_{i}. Generically, the border between R1R_{1} and R2R_{2} is distinct from the border between S1S_{1} and S2S_{2} and thus the two borders have at most one intersection, μm\mu_{m}. Moreover, generically μm\mu_{m} (if it exists) is an interior belief. But now, Sender could deviate to an alternate strategy that induces beliefs μ1\mu_{1} and μ2\mu_{2} instead of μm\mu_{m}, with Receiver still indifferent between a1a_{1} and a2a_{2} at both μ1\mu_{1} and μ2\mu_{2}. Suppose that Receiver takes action aia_{i} following belief μi\mu_{i}. 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.

Refer to caption
Figure 1: Indifference incompatible with optimality

The second step (Lemma 6 in the Appendix) shows that, generically, if (σ,ρ)\left(\sigma,\rho\right) is a cheap-talk equilibrium that yields the persuasion payoff, and ρ\rho 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 ω\omega and any aaa\neq a^{\prime}, we have uS(a,ω)uS(a,ω)u_{S}\left(a,\omega\right)\neq u_{S}\left(a^{\prime},\omega\right). Now, consider some cheap-talk equilibrium (σ,ρ)\left(\sigma,\rho\right) that yields the persuasion payoff with ρ\rho is a pure strategy on-path. If σ\sigma is partitional, our result is immediate. Suppose to the contrary that in some ω\omega, both mm and mm^{\prime} are sent with positive probability. Then, mm and mm^{\prime} must induce the same action: if mm induces some aa and mm^{\prime} induces a distinct aa^{\prime}, the fact that uS(a,ω)uS(a,ω)u_{S}\left(a,\omega\right)\neq u_{S}\left(a^{\prime},\omega\right) would mean that σ\sigma cannot be S-BR. Given that any two messages sent in ω\omega induce the same action, we can define ρ(σ(ω))\rho\left(\sigma\left(\omega\right)\right) as the action that Receiver takes in state ω\omega given (σ,ρ)\left(\sigma,\rho\right).

Now, we can consider an alternative, partitional profile (σ^,ρ^)\left(\hat{\sigma},\hat{\rho}\right). Let ff be any injective function from AA to MM. Let σ^(ω)=f(ρ(σ(ω)))\hat{\sigma}\left(\omega\right)=f\left(\rho\left(\sigma\left(\omega\right)\right)\right) and ρ(f(a))=a\rho\left(f\left(a\right)\right)=a. It is immediate that (σ^S,σ^R)\left(\hat{\sigma}_{S},\hat{\sigma}_{R}\right) is also a cheap-talk equilibrium and yields the persuasion payoff.

It is perhaps worth noting that 1 and 2 jointly imply the following:

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 uS=uRu_{S}=u_{R} or uS=uRu_{S}=-u_{R}, 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 μ0\mu_{0} and generate random environments by drawing Sender’s utility for each action-state i.i.d. from some atomless distribution FF and Receiver’s utility for each action-state i.i.d from some atomless distribution GG. We further assume that for each (a,ω)\left(a,\omega\right), the random variables uS(a,ω)u_{S}\left(a,\omega\right) and uR(a,ω)u_{R}\left(a,\omega\right) are independent from one another.

We should note that this structure does not preclude any particular configuration of preferences. For any FF and GG, 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 AA and Ω\Omega, 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 Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right) that turn out to be independent of FF, GG, and μ0\mu_{0}.

Theorem 3.

For any interior μ0\mu_{0} and any atomless FF and GG:

  • Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right)\geq 1|A||A|.\frac{1}{\left|A\right|^{\left|A\right|}}.

  • as |Ω|\left|\Omega\right|\rightarrow\infty, Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right)\rightarrow 1|A||A|.\frac{1}{\left|A\right|^{\left|A\right|}}.

Denote the action space by A={a1,a2,,a|A|}A=\left\{a_{1},a_{2},...,a_{\left|A\right|}\right\} and denote |A|\left|A\right| elements of MM by m1m_{1} through m|A|m_{\left|A\right|}. Let Ωi\Omega_{i} be the set of states where aia_{i} is Sender’s ideal action. The requesting messaging strategy sets σ(ω)=mi\sigma\left(\omega\right)=m_{i} for ωΩi\omega\in\Omega_{i}.151515Generically, Ωi\Omega_{i} and Ωj\Omega_{j} do not intersect. An obliging action strategy sets ρ(mi)=ai\rho\left(m_{i}\right)=a_{i}. 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 Ωi\Omega_{i} and each ajAa_{j}\in A, we have

ωΩiμ0(ω)(uR(ai,ω)uR(aj,ω))0.\sum_{\omega\in\Omega_{i}}\mu_{0}\left(\omega\right)\left(u_{R}\left(a_{i},\omega\right)-u_{R}\left(a_{j},\omega\right)\right)\geq 0. (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 uR(a,ω())=ω(a)2u_{R}\left(a,\omega\left(\cdot\right)\right)=\omega\left(a\right)^{2} and uS(a,ω())=(ω(a)b)2u_{S}\left(a,\omega\left(\cdot\right)\right)=\left(\omega\left(a\right)-b\right)^{2} for some b>0b>0 where ω:A\omega:A\rightarrow\mathbb{R} is the realized path of a Brownian motion. They identify features of bb and AA that make the environment obedient.

Now, for any Ωi\Omega_{i} that is not empty, the probability that inequality (1)\left(\ref{eq:obedient}\right) is satisfied is 1|A|\frac{1}{\left|A\right|}, since for each aja_{j}, uR(ai,ω)u_{R}\left(a_{i},\omega\right) and uR(aj,ω)u_{R}\left(a_{j},\omega\right) are i.i.d. with an atomless distribution. Moreover, given two non-empty Ωi\Omega_{i} and Ωj\Omega_{j}, the probability that inequality (1)\left(\ref{eq:obedient}\right) is satisfied for Ωj\Omega_{j} is independent of the probability that it is satisfied for Ωi\Omega_{i}. Thus if every Ωi\Omega_{i} is non-empty, the probability that the environment is obedient (i.e., inequality (1)\left(\ref{eq:obedient}\right) is satisfied for each of the Ωi\Omega_{i} sets) is (1|A|)|A|\left(\frac{1}{\left|A\right|}\right)^{\left|A\right|}, or 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}.

If an Ωi\Omega_{i} is empty, inequality (1)\left(\ref{eq:obedient}\right) is satisfied vacuously for that Ωi\Omega_{i}. Thus, for any μ0\mu_{0} and any atomless FF and GG the overall probability that the environment is obedient must be weakly greater than 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}. Since commitment has no value in obedient environments, we conclude that Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right)\geq 1|A||A|.\frac{1}{\left|A\right|^{\left|A\right|}}.

We establish the second part of the theorem by showing that as |Ω|\left|\Omega\right| grows large: (i) the likelihood that an Ωi\Omega_{i} is empty converges to zero so Pr(obedience)\Pr\left(\text{obedience}\right) converges to 1|A||A|\frac{1}{\left|A\right|^{\left|A\right|}}, and (ii) Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right) converges to Pr(obedience)\Pr\left(\text{obedience}\right).

Part (i) is easy to see. For any aAa\in A, as Ω\Omega grows large, the chance that there is no state where aa is Sender’s ideal action vanishes.

To establish part (ii), say that an environment is jointly-inclusive if for every action aa, there is some state ω\omega such that aa is the ideal action for both Sender and Receiver in ω\omega. Analogously to part (i), it is easy to see that as Ω\Omega grows large, the probability that the environment is jointly-inclusive converges to 11. 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 (σ,ρ)\left(\sigma,\rho\right) that is a cheap-talk equilibrium and yields the persuasion payoff. Next, we note that every action aAa\in A must be induced by (σ,ρ)\left(\sigma,\rho\right): there is a state ω\omega where aa is both Sender’s and Receiver’s ideal action, so if aa were never taken, the committed Sender could profitably deviate by sometimes171717Sender could reveal ω\omega with some probability ϵ\epsilon; Receiver’s response to all other messages would remain unchanged if ϵ\epsilon is sufficiently small. revealing ω\omega and thus inducing aa, thus contradicting the fact that (σ,ρ)\left(\sigma,\rho\right) yields the persuasion payoff. This in turn implies that, for every ω\omega, the action induced in ω\omega, ρ(σ(ω))\rho\left(\sigma\left(\omega\right)\right), must be Sender’s ideal action in ω\omega. If Sender strictly preferred some other aa^{\prime} in ω\omega, (σ,ρ)\left(\sigma,\rho\right) could not be S-BR as the cheap-talk Sender would profitably deviate and set σ\sigma(ω)\left(\omega\right) to be whatever message induces aa^{\prime}; since all actions are induced by (σ,ρ)\left(\sigma,\rho\right), there must be such a message. Taking stock, we have established that (σ,ρ)\left(\sigma,\rho\right) 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 σ\sigma 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 |Ω|\left|\Omega\right| 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 AA and Ω\Omega as being not merely finite but also “unstructured,” without a natural metric. For example, if AA includes actions such as “buy one apple” and “buy two apples”, or Ω\Omega includes states such as “temperature will be 88 Fahrenheit” and “temperature will be 89 Fahrenheit,” then assuming that uS(a,ω)u_{S}\left(a,\omega\right) is independent of uS(a,ω)u_{S}\left(a^{\prime},\omega^{\prime}\right) as soon as aaa\neq a^{\prime} or ωω\omega\neq\omega^{\prime} would be unreasonable.

Third, in the second part of Theorem 3, a reader might be concerned that, by keeping FF and GG fixed as Ω\Omega grows, we are “squishing” utilities together and making the difference in payoffs become vanishingly small. We could let FF and GG depend on |A|\left|A\right| and |Ω|\left|\Omega\right| in an arbitrary way, however, and the Theorem would still hold. We formulate the Theorem with a fixed FF and GG 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 0.70.7 rather than 0.30.3; 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 A={a1,,a|A|}A=\left\{a_{1},...,a_{\left|A\right|}\right\}. Let Ω={ω1,,ω|Ω|}\Omega=\left\{\omega_{1},...,\omega_{\left|\Omega\right|}\right\}.

Given a messaging strategy σ\sigma, let Mσ={mM|σ(m|ω)>0 for some ω}M_{\sigma}=\{m\in M|\sigma(m|\omega)>0\text{ for some }\omega\} be the set of messages that are sent with positive probability under σ\sigma. For any ω\omega, if σ(|ω)\sigma(\cdot|\omega) is degenerate (i.e., there exists a message mm such that σ(m|ω)=1\sigma(m|\omega)=1), we abuse notation and let σ(ω)\sigma(\omega) denote the message that is sent in state ω\omega. Similarly, if ρ(|m)\rho(\cdot|m) is degenerate, we let ρ(m)\rho\left(m\right) denote the action taken following message mm.

We say that ρ\rho is pure if ρ(|m)\rho(\cdot|m) is degenerate for all mMm\in M. Given a profile (σ,ρ)\left(\sigma,\rho\right), we say ρ\rho is pure-on-path if ρ(|m)\rho\left(\cdot|m\right) is degenerate for all mMσm\in M_{\sigma}.

We denote a vector all of whose elements are equal to rr by 𝒓\boldsymbol{r}. We sometimes use μ\mu and sometimes use [μ]\left[\mu\right] for an element of ΔΩ\Delta\Omega.

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 (uS,uR,μ0)\left(u_{S},u_{R},\mu_{0}\right) satisfies partitional-unique-response if for every non-empty Ω^Ω\hat{\Omega}\subseteq\Omega,

argmaxaAωΩ^μ0(ω)uR(a,ω)\arg\max_{a\in A}\sum_{\omega\in\hat{\Omega}}\mu_{0}(\omega)u_{R}(a,\omega)

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 (Ω^,ai,aj)\left(\hat{\Omega},a_{i},a_{j}\right) such that Ω^Ω\hat{\Omega}\subseteq\Omega, ai,ajAa_{i},a_{j}\in A, and aiaja_{i}\neq a_{j}, let Q(Ω^,ai,aj)Q(\hat{\Omega},a_{i},a_{j}) denote the set of (uR,μ0)(u_{R},\mu_{0}) such that

ωΩ^u0(ω)uR(ai,ω)=ωΩ^u0(ω)uR(aj,ω).\sum_{\omega\in\hat{\Omega}}\,u_{0}(\omega)u_{R}(a_{i},\omega)=\sum_{\omega\in\hat{\Omega}}\,u_{0}(\omega)u_{R}(a_{j},\omega). (2)

An environment (uS,uR,μ0)\left(u_{S},u_{R},\mu_{0}\right) does not satisfy partitional-unique-response only if (uR,μ0)aiaj,Ω^ΩQ(Ω^,ai,aj)\left(u_{R},\mu_{0}\right)\in\cup_{a_{i}\neq a_{j},\hat{\Omega}\subseteq\Omega}Q(\hat{\Omega},a_{i},a_{j}).

We wish to show that aiaj,Ω^ΩQ(Ω^,ai,aj)\cup_{a_{i}\neq a_{j},\hat{\Omega}\subseteq\Omega}Q(\hat{\Omega},a_{i},a_{j}) has measure zero in |Ω|×|A|×ΔΩ\mathbb{R}^{|\Omega|\times|A|}\times\Delta\Omega, which implies that the set of partitional-unique-response environments is generic.

Fix any aiaja_{i}\neq a_{j} and Ω^Ω\hat{\Omega}\subseteq\Omega. For any μ0ΔΩ\mu_{0}\in\Delta\Omega, the set of uRu_{R} that satisfy (2) can be written as:

ω,auR(a,ω)η(a,ω)=0\sum_{\omega,a}u_{R}(a,\omega)\eta(a,\omega)=0 (3)

where

η(a,ω)={μ0(ω) if a=ai,ωΩ^μ0(ω) if a=aj,ωΩ^0 otherwise.\eta(a,\omega)=\begin{cases}\mu_{0}(\omega)&\text{ if }a=a_{i},\omega\in\hat{\Omega}\\ -\mu_{0}(\omega)&\text{ if }a=a_{j},\omega\in\hat{\Omega}\\ 0&\text{ otherwise.}\end{cases}

So (3) defines a hyperplane of |Ω|×|A|\mathbb{R}^{|\Omega|\times|A|}, and thus has Lebesgue measure zero in |Ω|×|A|\mathbb{R}^{|\Omega|\times|A|}.

Thus, by Fubini’s Theorem, the set of pairs (uR,μ0)\left(u_{R},\mu_{0}\right) that satisfy (2) has Lebesgue measure zero in |Ω|×|A|×ΔΩ\mathbb{R}^{|\Omega|\times|A|}\times\Delta\Omega. Finally, since there is finite number of possible ai,aja_{i},a_{j}, and Ω^\hat{\Omega}, the set aiaj,Ω^ΩQ(Ω^,ai,aj)\cup_{a_{i}\neq a_{j},\hat{\Omega}\subseteq\Omega}Q(\hat{\Omega},a_{i},a_{j}) also has Lebesgue measure zero in |Ω|×|A|×ΔΩ\mathbb{R}^{|\Omega|\times|A|}\times\Delta\Omega

A.2.2 Scant-indifferences environments

For each aiAa_{i}\in A, let 𝐮S(ai)=uS(ai,)|Ω|\mathbf{u}_{S}(a_{i})=u_{S}(a_{i},\cdot)\in\mathbb{R}^{\left|\Omega\right|} and 𝐮R(ai)=uR(ai,)|Ω|\mathbf{u}_{R}(a_{i})=u_{R}(a_{i},\cdot)\in\mathbb{R}^{|\Omega|} denote the payoff vectors across the states.

For each ai,a_{i}, define the expanded-indifference matrix TiT^{i} as follows. Let TSiT_{S}^{i} be the matrix with |A|1\left|A\right|-1 rows and |Ω|\left|\Omega\right| columns, with each row associated with jij\neq i and equal to 𝐮S(aj)𝐮S(ai)\mathbf{u}_{S}(a_{j})-\mathbf{u}_{S}(a_{i}). Let TRiT_{R}^{i} be the matrix with |A|1\left|A\right|-1 rows and |Ω|\left|\Omega\right| columns, with each row associated with jij\neq i and equal to 𝐮R(aj)𝐮R(ai)\mathbf{u}_{R}(a_{j})-\mathbf{u}_{R}(a_{i}). Let II be the identity matrix of size |Ω|\left|\Omega\right|. Then, let

Ti=[TSiTRiI].T^{i}=\begin{bmatrix}T_{S}^{i}\\ T_{R}^{i}\\ I\end{bmatrix}.

Given any matrix TT, a row-submatrix of TT is a matrix formed by removing some of the rows of TT.

Finally, we say that an environment satisfies scant-indifferences if every row-submatrix of every expanded-indifference matrix TiT^{i} 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 R1R_{1} and R2R_{2} is distinct from the border between S1S_{1} and S2S_{2} and thus the two borders have at most one intersection, μm\mu_{m}. Second, generically μm\mu_{m} (if it exists) is an interior belief. Moreover, the argument behind Lemma 6 relied on the fact that, generically, for any ω\omega and aiaja_{i}\neq a_{j}, uS(ai,ω)uS(aj,ω)u_{S}(a_{i},\omega)\neq u_{S}(a_{j},\omega).

We now illustrate why these three facts hold in any scant-indifferences environment. With only two actions, we can look at T1T^{1} only, since the argument for T2T^{2} is identical. We have

T1=[uΔS(ω1)uΔS(ω2)uΔS(ω3)uΔR(ω1)uΔR(ω2)uΔR(ω3)100010001]T^{1}=\begin{bmatrix}\begin{array}[]{ccc}\overset{\Delta}{u}_{S}\left(\omega_{1}\right)&\overset{\Delta}{u}_{S}\left(\omega_{2}\right)&\overset{\Delta}{u}_{S}\left(\omega_{3}\right)\\ \overset{\Delta}{u}_{R}\left(\omega_{1}\right)&\overset{\Delta}{u}_{R}\left(\omega_{2}\right)&\overset{\Delta}{u}_{R}\left(\omega_{3}\right)\\ 1&0&0\\ 0&1&0\\ 0&0&1\end{array}\end{bmatrix}

where uΔS(ω1)=uS(a2,ω1)uS(a1,ω1)\overset{\Delta}{u}_{S}\left(\omega_{1}\right)=u_{S}\left(a_{2},\omega_{1}\right)-u_{S}\left(a_{1},\omega_{1}\right) and analogously for other states and uΔR\overset{\Delta}{u}_{R}.

First, consider the row-submatrix

TΔ=[uΔS(ω1)uΔS(ω2)uΔS(ω3)uΔR(ω1)uΔR(ω2)uΔR(ω3)].\overset{\Delta}{T}=\begin{bmatrix}\overset{\Delta}{u}_{S}\left(\omega_{1}\right)&\overset{\Delta}{u}_{S}\left(\omega_{2}\right)&\overset{\Delta}{u}_{S}\left(\omega_{3}\right)\\ \overset{\Delta}{u}_{R}\left(\omega_{1}\right)&\overset{\Delta}{u}_{R}\left(\omega_{2}\right)&\overset{\Delta}{u}_{R}\left(\omega_{3}\right)\end{bmatrix}.

Note that both Sender and Receiver are indifferent between the two actions at a belief μ\mu if and only if TΔμ=0\overset{\Delta}{T}\mu=0. Thus, requiring that TΔ\overset{\Delta}{T} be full-rank is equivalent to requiring that the border between R1R_{1} and R2R_{2} not be parallel to the border between S1S_{1} and S2S_{2}. A fortiori, the environment satisfying scant-indifferences implies that the two borders do not coincide.

Second, consider the row-submatrix

[uΔS(ω1)uΔS(ω2)uΔS(ω3)uΔR(ω1)uΔR(ω2)uΔR(ω3)100].\begin{bmatrix}\overset{\Delta}{u}_{S}\left(\omega_{1}\right)&\overset{\Delta}{u}_{S}\left(\omega_{2}\right)&\overset{\Delta}{u}_{S}\left(\omega_{3}\right)\\ \overset{\Delta}{u}_{R}\left(\omega_{1}\right)&\overset{\Delta}{u}_{R}\left(\omega_{2}\right)&\overset{\Delta}{u}_{R}\left(\omega_{3}\right)\\ 1&0&0\end{bmatrix}.

Requiring that this matrix be full-rank yields that μm\mu_{m} puts strictly positive probability on ω1\omega_{1}. Considering the row-submatrices that alternatively include the other two rows of the identity matrix yields that μm\mu_{m} puts strictly positive probability on ω2\omega_{2} and ω3\omega_{3}.

Finally, suppose that in, say state ω1\omega_{1}, uΔS(ω1)=0\overset{\Delta}{u}_{S}\left(\omega_{1}\right)=0. Consider the row-submatrix

[0uΔS(ω2)uΔS(ω3)010001].\begin{bmatrix}0&\overset{\Delta}{u}_{S}\left(\omega_{2}\right)&\overset{\Delta}{u}_{S}\left(\omega_{3}\right)\\ 0&1&0\\ 0&0&1\end{bmatrix}.

Clearly, this matrix is not full-rank, so scant-indifferences rules out the possibility that uS(a1,ω1)=uS(a2,ω2)u_{S}(a_{1},\omega_{1})=u_{S}(a_{2},\omega_{2}).

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 μ0\mu_{0}. Accordingly, we seek to show that the set of (uS,uR)(u_{S},u_{R}) such that every row-submatrix of every expanded-indifference matrix is full-rank has full Lebesgue measure on |Ω|×|A|×2\mathbb{R}^{|\Omega|\times|A|\times 2}.

First, observe that given any expanded-indifference matrix TiT^{i}, if every square row-submatrix of TiT^{i} is full-rank, than every row-submatrix of TiT^{i} is full-rank. To see why, suppose every square row-submatrix of TiT^{i} is full-rank. Now, consider an arbitrary row-submatrix T^\hat{T} of TiT^{i}. If T^\hat{T} square, it obviously has full-rank. Suppose that T^\hat{T} has more than |Ω|\left|\Omega\right| rows. In that case, every square row-submatrix of T^\hat{T} is also a square row-submatrix of TiT^{i}. This row-submatrix has rank |Ω|\left|\Omega\right|. Therefore, T^\hat{T} has rank |Ω|\left|\Omega\right| and is thus full-rank. Finally, suppose hat T^\hat{T} has fewer than |Ω|\left|\Omega\right| rows. We know that T^\hat{T} is a row-submatrix of some square row-submatrix T~\tilde{T} of TiT^{i}. We know T~\tilde{T} has full-rank so all of its rows are linearly independent. Consequently, the subset of its rows that constitute T^\hat{T} is also linearly independent.

Now that we can consider only square row-submatrices of TiT^{i}, 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 (uS,uR)\left(u_{S},u_{R}\right), the determinant of every square row-submatrix of every expanded-indifference matrix is non-zero. Given (uS,uR)\left(u_{S},u_{R}\right), consider some square row-submatrix T^\hat{T} of some expanded-indifference matrix. The determinant of T^\hat{T} is a non-zero polynomial function of (uS,uR)|Ω|×|A|×2(u_{S},u_{R})\in\mathbb{R}^{|\Omega|\times|A|\times 2}. The zero set of any non-zero polynomial function has Lebesgue measure zero, so the set of (uS,uR)\left(u_{S},u_{R}\right) for which T^\hat{T} 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 ω\omega and aiaja_{i}\neq a_{j}, uS(ai,ω)uS(aj,ω)u_{S}(a_{i},\omega)\neq u_{S}(a_{j},\omega).

Proof.

Suppose, toward a contradiction, that there exist some ω\omega, aia_{i}, and aja_{j} such that uS(ai,ω)=uS(aj,ω)u_{S}(a_{i},\omega)=u_{S}(a_{j},\omega). Without loss, suppose this holds for ω1\omega_{1}. Then, the vector 𝐮S(ai)𝐮S(aj)\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{j}) has zero as its first element. Now consider the |Ω|×|Ω||\Omega|\times|\Omega| row sub-matrix of TjT^{j}

[𝐮S(ai)𝐮S(aj)e2e|Ω|].\begin{bmatrix}\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{j})\\ e_{2}\\ ...\\ e_{|\Omega|}\end{bmatrix}.

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

In this section we establish a key lemma that implies both the if-part of Theorem 1 and Theorem 2.

Lemma 4.

In a scant-indifferences environment, if commitment has no value, then there is a partitional σ^\hat{\sigma} and a pure strategy ρ^\hat{\rho} such that (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is a cheap-talk equilibrium and yields the persuasion payoff (and |Mσ^||A|\left|M_{\hat{\sigma}}\right|\leq\left|A\right|).

Lemma 4 will be useful for proofs of Theorems 1, 2, and 3. The parenthetical remark that |Mσ^||A|\left|M_{\hat{\sigma}}\right|\leq\left|A\right| 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 (σ,ρ)\left(\sigma,\rho\right) is R-BR and yields the persuasion payoff, then ρ\rho must pure-on-path.

Proof.

Suppose by contradiction that the environment satisfies scant-indifferences, profile (σ,ρ)\left(\sigma,\rho\right) is R-BR and yields the persuasion payoff, yet there exists a message mMσm\in M_{\sigma} such that |supp(ρ(|m))|=k>1|supp(\rho(\cdot|m))|=k>1.

We first note that both Sender and Receiver must be indifferent among all the actions in supp(ρ(|m))supp(\rho(\cdot|m)) given μm\mu_{m}, the belief induced by message mm. In other words, for all ai,ajsupp(ρ(|m))a_{i},a_{j}\in supp(\rho(\cdot|m)),

ωμm(ω)uR(ai,ω)=ωμm(ω)uR(aj,ω),\displaystyle\sum_{\omega}\mu_{m}(\omega)u_{R}(a_{i},\omega)=\sum_{\omega}\mu_{m}(\omega)u_{R}(a_{j},\omega), (4)
ωμm(ω)uS(ai,ω)=ωμm(ω)uS(aj,ω).\displaystyle\sum_{\omega}\mu_{m}(\omega)u_{S}(a_{i},\omega)=\sum_{\omega}\mu_{m}(\omega)u_{S}(a_{j},\omega). (5)

Equation (4) follows immediately from R-BR. Equation (5) follows from the fact that (σ,ρ)(\sigma,\rho) yields the persuasion payoff: if say ωμm(ω)uS(ai,ω)>ωμm(ω)uS(aj,ω)\sum_{\omega}\mu_{m}(\omega)u_{S}(a_{i},\omega)>\sum_{\omega}\mu_{m}(\omega)u_{S}(a_{j},\omega), 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 μΔΩ\mu\in\Delta\Omega, let AR(μ)A_{R}^{*}(\mu) denote the set of Receiver’s optimal actions under belief μ\mu; that is, AR(μ)=argmaxaA𝐮R(a)μA_{R}^{*}(\mu)=\arg\max_{a\in A}\mathbf{u}_{R}(a)\cdot\mu. Clearly, supp(ρ(|m))AR(μm)supp(\rho(\cdot|m))\subseteq A_{R}^{*}(\mu_{m}), meaning that AR(μm)A_{R}^{*}(\mu_{m}) contains at least the kk actions in the support of ρ(|m)\rho(\cdot|m), but may also contain additional optimal actions that are not played following mm. Without loss of generality, let supp(ρ(|m))={a1,,ak}supp(\rho(\cdot|m))=\{a_{1},...,a_{k}\} and AR(μ)={a1,,ak,ak+1,,ak+r}A_{R}^{*}(\mu)=\{a_{1},...,a_{k},a_{k+1},...,a_{k+r}\} for some r0r\geq 0. Note that for any i=2,,k+r,i=2,...,k+r, 𝐮R(a1)μm=𝐮R(ai)μm\mathbf{u}_{R}(a_{1})\cdot\mu_{m}=\mathbf{u}_{R}(a_{i})\cdot\mu_{m}.

In addition, Equation (5) implies that for any i=2,,k,i=2,...,k, 𝐮S(a1)μm=𝐮S(ai)μm\mathbf{u}_{S}(a_{1})\cdot\mu_{m}=\mathbf{u}_{S}(a_{i})\cdot\mu_{m}. Combining both Sender’s and Receiver’s indifference conditions, we have

[𝐮S(a2)𝐮S(a1)𝐮S(ak)𝐮S(a1)𝐮R(a2)𝐮R(a1)𝐮R(ak+r)𝐮R(a1)]μm=𝟎.\begin{bmatrix}\mathbf{u}_{S}(a_{2})-\mathbf{u}_{S}(a_{1})\\ ...\\ \mathbf{u}_{S}(a_{k})-\mathbf{u}_{S}(a_{1})\\ \\ \mathbf{u}_{R}(a_{2})-\mathbf{u}_{R}(a_{1})\\ ...\\ \mathbf{u}_{R}(a_{k+r})-\mathbf{u}_{R}(a_{1})\end{bmatrix}\mu_{m}=\boldsymbol{0}. (6)

Let Ω^={ω|μm(ω)=0}\hat{\Omega}=\{\omega|\mu_{m}(\omega)=0\}, the (potentially empty) set of states that are not in the support of μm\mu_{m}. Without loss, suppose that Ω^={ω1,ωl}\hat{\Omega}=\left\{\omega_{1},...\omega_{l}\right\} where 0\ell\geq 0. If >0\ell>0 (i.e., Ω^\hat{\Omega}\neq\emptyset), then we have

[e1e]μm=𝟎.\begin{bmatrix}e_{1}\\ ...\\ e_{\ell}\end{bmatrix}\mu_{m}=\boldsymbol{0}. (7)

Let T^S=[𝐮S(a2)𝐮S(a1)𝐮S(ak)𝐮S(a1)]\hat{T}_{S}=\begin{bmatrix}\mathbf{u}_{S}(a_{2})-\mathbf{u}_{S}(a_{1})\\ ...\\ \mathbf{u}_{S}(a_{k})-\mathbf{u}_{S}(a_{1})\end{bmatrix}, T^R=[𝐮R(a2)𝐮R(a1)𝐮R(ak+r)𝐮R(a1)]\hat{T}_{R}=\begin{bmatrix}\mathbf{u}_{R}(a_{2})-\mathbf{u}_{R}(a_{1})\\ ...\\ \mathbf{u}_{R}(a_{k+r})-\mathbf{u}_{R}(a_{1})\end{bmatrix}, E^=[e1e]\hat{E}=\begin{bmatrix}e_{1}\\ ...\\ e_{\ell}\end{bmatrix}, and T^=[T^ST^RE^]\hat{T}=\begin{bmatrix}\hat{T}_{S}\\ \hat{T}_{R}\\ \hat{E}\end{bmatrix}. Note that T^\hat{T} is a row-submatrix of the expanded-indifference matrix T1T^{1}.

Combining (6) and (7), we know T^μm=𝟎\hat{T}\mu_{m}=\boldsymbol{0}. Moreover, since μmΔΩ\mu_{m}\in\Delta\Omega, we know 𝟏μm=1\boldsymbol{1}\mu_{m}=1.

Next we make two observations: (i) rank(T^)<|Ω|rank(\hat{T})<|\Omega|, otherwise the unique solution to T^μ=𝟎\text{$\hat{T}$}\mu=\boldsymbol{0} is μ=𝟎\mu=\boldsymbol{0}. Since we are in a scant-indifferences environment, this means that T^\hat{T} has full row rank; (ii) vector 𝟏\boldsymbol{1} can not be represented as a linear combination of rows of T^\hat{T}. To see why, assume toward contradiction that there exists a row vector λ2k+r+2\lambda\in\mathbb{R}^{2k+r+\ell-2} such that λT^=𝟏\lambda\hat{T}=\boldsymbol{1}. This would lead to a contradiction that 1=𝟏μm=λT^μm=λ𝟎=01=\boldsymbol{1}\mu_{m}=\lambda\hat{T}\mu_{m}=\lambda\boldsymbol{0}=0.

Observations (i) and (ii) together imply that the matrix [T^𝟏]\begin{bmatrix}\hat{T}\\ \boldsymbol{1}\end{bmatrix} has full row rank. Consequently, we know rank([T^𝟏])>rank([T^RE^𝟏]).rank\left(\left[\begin{array}[]{c}\text{$\hat{T}$}\\ \boldsymbol{1}\end{array}\right]\right)>rank\begin{pmatrix}\begin{bmatrix}\hat{T}_{R}\\ \hat{E}\\ \boldsymbol{1}\end{bmatrix}\end{pmatrix}.

Now, we claim that there exists xnx\in\mathbb{R}^{n} such that

[T^RE^𝟏]x=0\begin{bmatrix}\hat{T}_{R}\\ \hat{E}\\ \boldsymbol{1}\end{bmatrix}x=0 (8)

and

T^Sx0.\hat{T}_{S}\,x\neq 0. (9)

To see this, suppose by contradiction that for any xx that solves (8), we have T^Sx=0\hat{T}_{S}\,x=0. This would imply that the set of solutions to (8) and the set of solutions to

[T^𝟏]x=0\begin{bmatrix}\hat{T}\\ \boldsymbol{1}\end{bmatrix}x=0 (10)

coincide. By the Rank-Nullity Theorem, however, the subspace defined by (10) has dimension |Ω|rank([T^𝟏])|\Omega|-rank\left(\begin{bmatrix}\hat{T}\\ \boldsymbol{1}\end{bmatrix}\right), while the subspace defined by (8) has a higher dimension |Ω|rank([T^RE^𝟏])|\Omega|-rank\left(\begin{bmatrix}\hat{T}_{R}\\ \hat{E}\\ \boldsymbol{1}\end{bmatrix}\right).

Consider two vectors, [μm+εx]\left[\mu_{m}+\varepsilon x\right] and [μmεx]\left[\mu_{m}-\varepsilon x\right], where ε>0\varepsilon\in\mathbb{R}_{>0}. First we verify that for sufficiently small ε\varepsilon, [μm±εx]ΔΩ\left[\mu_{m}\pm\varepsilon x\right]\in\Delta\text{$\Omega$}. Since 𝟏x=0\boldsymbol{1}x=0, it follows that 𝟏[μm±εx]=𝟏[μm]=1\boldsymbol{1}\left[\mu_{m}\pm\varepsilon x\right]=\boldsymbol{1}\left[\mu_{m}\right]=1. For ωjΩ^\omega_{j}\notin\hat{\Omega}, we have [μm]j>0\left[\mu_{m}\right]_{j}>0, so for small enough ε\varepsilon, [μm±εx]j0\left[\mu_{m}\pm\varepsilon x\right]_{j}\geq 0. For ωjΩ^\omega_{j}\in\hat{\Omega}, we know eje_{j} is a row of E^\hat{E}, so ejx=0e_{j}x=0. Consequently, [μm±εx]j=ej[μm±εx]=[μm]j=0.\left[\mu_{m}\pm\varepsilon x\right]_{j}=e_{j}\left[\mu_{m}\pm\varepsilon x\right]=\left[\mu_{m}\right]_{j}=0. Thus, [μm±εx]ΔΩ\left[\mu_{m}\pm\varepsilon x\right]\in\Delta\text{$\Omega$}.

Observe that AR(μm)=AR(μm±εx)A_{R}^{*}(\mu_{m})=A_{R}^{*}(\mu_{m}\pm\varepsilon x). First, for any aAR(μm)a\notin A_{R}^{*}(\mu_{m}), if ε\varepsilon is sufficiently small, aAR(μm±εx)a\notin A_{R}^{*}(\mu_{m}\pm\varepsilon x). Therefore, AR(μm±εx)AR(μm)A_{R}^{*}(\mu_{m}\pm\varepsilon x)\subseteq A_{R}^{*}(\mu_{m}). But, T^Rx=0\hat{T}_{R}\,x=0 implies that [μm±εx]𝐮R(a)\left[\mu_{m}\pm\varepsilon x\right]\cdot\mathbf{u}_{R}(a) is constant across aAR(μm)a\in A_{R}^{*}(\mu_{m}), so AR(μm±εx)=AR(μm)A_{R}^{*}(\mu_{m}\pm\varepsilon x)=A_{R}^{*}(\mu_{m}).

Consider an alternative messaging strategy σ^\hat{\sigma} that is identical to σ\sigma, except that the message mm is split into two new messages, m+m^{+} and mm^{-}, which induce the beliefs μm+εx\mu_{m}+\varepsilon x and μmεx\mu_{m}-\varepsilon x, respectively.191919It is possible for Mσ=MM_{\sigma}=M, but we can consider an alternative strategy that induces the same outcome as σ\sigma and uses only |A|\left|A\right| messages. We can also let mm play the role of m+m^{+} or mm^{-}, so our assumption that |M||A|+1\left|M\right|\geq\left|A\right|+1 suffices. We consider ρ^\hat{\rho} that agrees with ρ\rho on messages other than {m,m+,m}\left\{m,m^{+},m^{-}\right\} and leads Receiver to break indifferences in Sender’s favor following m+m^{+} and mm^{-}. We will show that (σ^,ρ^)\left(\hat{\sigma},\hat{\rho}\right) yields a strictly higher payoff to Sender, thus contradicting the assumption that (σ,ρ)\left(\sigma,\rho\right) yields the persuasion payoff.

Since T^Sx0\hat{T}_{S}\,x\neq 0, we know there is an ai{a2,,ak}a_{i}\in\{a_{2},...,a_{k}\} such that x[𝐮S(ai)𝐮S(a1)]0x\cdot[\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{1})]\neq 0.

Because a1AR(μm±εx)=AR(μm)a_{1}\in A_{R}^{*}(\mu_{m}\pm\varepsilon x)=A_{R}^{*}(\mu_{m}), we have

maxaA(μm)[μm+εx][𝐮S(a)𝐮S(a1)]0\max_{a\in A^{*}(\mu_{m})}\left[\mu_{m}+\varepsilon x\right]\cdot[\mathbf{u}_{S}(a)-\mathbf{u}_{S}(a_{1})]\geq 0

and

maxaA(μm)[μmεx][𝐮S(a)𝐮S(a1)]0.\max_{a\in A^{*}(\mu_{m})}\left[\mu_{m}-\varepsilon x\right]\cdot[\mathbf{u}_{S}(a)-\mathbf{u}_{S}(a_{1})]\geq 0.

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 [μm+εx][𝐮S(ai)𝐮S(a1)]0\left[\mu_{m}+\varepsilon x\right]\cdot[\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{1})]\leq 0, which combined with the fact that μm𝐮S(ai)=μm𝐮S(a1)\mu_{m}\cdot\mathbf{u}_{S}(a_{i})=\mu_{m}\cdot\mathbf{u}_{S}(a_{1}) implies that x[𝐮S(ai)𝐮S(a1)]0x\cdot[\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{1})]\leq 0. Similarly, the second equality implies that x[𝐮S(ai)𝐮S(a1)]0-x\cdot[\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{1})]\leq 0. Together, this yields that x[𝐮S(ai)𝐮S(a1)]=0x\cdot[\mathbf{u}_{S}(a_{i})-\mathbf{u}_{S}(a_{1})]=0, a contradiction. Hence, one of the inequalities has to be strict.

Consequently, Sender’s interim payoff under σ^\hat{\sigma} (in the event that mm is sent under σ\sigma) is

12maxaA(μm)[μm+εx]𝐮S(a)+12maxaA(μm)[μmεx]𝐮S(a)\displaystyle\frac{1}{2}\max_{a\in A^{*}(\mu_{m})}\left[\mu_{m}+\varepsilon x\right]\cdot\mathbf{u}_{S}(a)+\frac{1}{2}\max_{a\in A^{*}(\mu_{m})}\left[\mu_{m}-\varepsilon x\right]\cdot\mathbf{u}_{S}(a)
>\displaystyle> 12[μm+εx]𝐮S(a1)+12[μmεx]𝐮S(a1)\displaystyle\frac{1}{2}\left[\mu_{m}+\varepsilon x\right]\cdot\mathbf{u}_{S}(a_{1})+\frac{1}{2}\left[\mu_{m}-\varepsilon x\right]\cdot\mathbf{u}_{S}(a_{1})
=\displaystyle= μm𝐮S(a1)\displaystyle\mu_{m}\cdot\mathbf{u}_{S}(a_{1})

Thus, (σ^,ρ^)\left(\hat{\sigma},\hat{\rho}\right) yields a strictly higher payoff to Sender, contradicting the assumption that (σ,ρ)\left(\sigma,\rho\right) yields the persuasion payoff. ∎

Lemma 6.

In a scant-indifferences environment, if a cheap-talk equilibrium (σ,ρ)(\sigma,\rho) yields the persuasion payoff and ρ\rho is pure-on-path, then there exists a partitional σ^\hat{\sigma} and a pure strategy ρ^\hat{\rho} such that |Mσ^||A|\left|M_{\hat{\sigma}}\right|\leq\left|A\right| and (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is a cheap-talk equilibrium and yields the persuasion payoff.

Proof.

Suppose a cheap-talk equilibrium (σ,ρ)(\sigma,\rho) yields the persuasion payoff and ρ\rho is pure-on-path.

First, we show that for any ω\omega and any m,mm,m^{\prime} such that σ(m|ω),σ(m|ω)>0\sigma(m|\omega),\sigma(m^{\prime}|\omega)>0, ρ(m)=ρ(m)\rho(m)=\rho(m^{\prime}). The fact that both mm and mm^{\prime} are sent in ω\omega implies that uS(ρ(m),ω)=uS(ρ(m),ω)u_{S}(\rho(m),\omega)=u_{S}(\rho(m^{\prime}),\omega). Moreover, by Lemma 3, there exist no distinct aa and aa^{\prime} such that uS(a,ω)=uS(a,ω)u_{S}(a,\omega)=u_{S}(a^{\prime},\omega), so it must be that ρ(m)=ρ(m)\rho(m)=\rho(m^{\prime}).

Let A={aA|a=ρ(m) for some mMσ}A^{*}=\{a\in A|a=\rho(m)\text{ for some }m\in M_{\sigma}\} be the set of actions that are taken on-path. Without loss, let A={a1,,ak}A^{*}=\{a_{1},...,a_{k}\}. For each aia_{i}, let Mi={mMσ|ρ(m)=ai}M_{i}=\{m\in M_{\sigma}|\rho(m)=a_{i}\} be the set of on-path messages that induce action aia_{i}, and Ωi={ωΩ|supp(σ(|ω))Mi}\Omega_{i}=\{\omega\in\Omega|supp(\sigma(\cdot|\omega))\subseteq M_{i}\} be the set of states that induce action aia_{i}. Note that {Mi}i=1k\left\{M_{i}\right\}_{i=1}^{k} is a partition of Mσ.M_{\sigma}. Moreover, it is easy to see that {Ωi}i=1k\{\Omega_{i}\}_{i=1}^{k} is a partition of Ω\Omega. First, Ωi\Omega_{i} cannot be empty because every aiAa_{i}\in A^{*} is taken on-path. Second, every ωΩ\omega\in\Omega belongs to some Ωi\Omega_{i} as only actions in AA^{*} are taken on-path; hence, iΩi=Ω\cup_{i}\Omega_{i}=\Omega. Finally, the fact that for any ω\omega and any m,mm,m^{\prime} such that σ(m|ω),σ(m|ω)>0\sigma(m|\omega),\sigma(m^{\prime}|\omega)>0 we have ρ(m)=ρ(m)\rho(m)=\rho(m^{\prime}) implies that if iji\neq j, Ωi\Omega_{i} and Ωj\Omega_{j} are disjoint. To see why, suppose toward contradiction that some ωΩiΩj.\omega\in\Omega_{i}\cap\Omega_{j}. The fact that ωΩi\omega\in\Omega_{i} implies there is a message mMim\in M_{i} such that σ(m|ω)>0\sigma\left(m|\omega\right)>0. The fact that ωΩj\omega\in\Omega_{j} implies there is a message mMjm^{\prime}\in M_{j} such that σ(m|ω)>0\sigma\left(m^{\prime}|\omega\right)>0. But this cannot be since ρ(m)=aiaj=ρ(m)\rho\left(m\right)=a_{i}\neq a_{j}=\rho\left(m^{\prime}\right).

Now select one message in each MiM_{i}, and label it as mim_{i}.

Next, consider the following alternative strategy profile (σ^,ρ^)(\hat{\sigma},\hat{\rho}):

  • σ^(mi|ω)=1\hat{\sigma}(m_{i}|\omega)=1 if ωΩi\omega\in\Omega_{i}.

  • ρ^(mi)=ai.\hat{\rho}(m_{i})=a_{i}.

  • ρ^(m)=a1\hat{\rho}(m)=a_{1} if mM\{m1,.mk}m\in M\backslash\{m_{1},....m_{k}\}.

Note that σ^\hat{\sigma} is well defined because {Ωi}i=1k\{\Omega_{i}\}_{i=1}^{k} is a partition of Ω\Omega. By construction, σ^\hat{\sigma} is partitional, |Mσ^||A|,\left|M_{\hat{\sigma}}\right|\leq\left|A\right|, and ρ^\hat{\rho} is a pure strategy. Moreover, under both (σ,ρ)(\sigma,\rho) and (σ^,ρ^)(\hat{\sigma},\hat{\rho}), every state in Ωi\Omega_{i} induces action aia_{i} with probability 1. Thus, the two strategy profiles induce the same distribution over states and actions, so (σ^,ρ^)(\hat{\sigma},\hat{\rho}) also yields the persuasion payoff. It remains to show that (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is a cheap-talk equilibrium.

Note that S-BR of (σ,ρ)(\sigma,\rho) implies that for any ω\omega and msupp(σ(|ω))m\in supp(\sigma(\cdot|\omega)), we have

uS(ρ(m),ω)uS(ρ(m),ω) for all mMσ.u_{S}(\rho(m),\omega)\geq u_{S}(\rho(m^{\prime}),\omega)\text{ for all }m^{\prime}\in M_{\sigma}.

Therefore, for any ωΩi\omega\in\Omega_{i}, uS(ai,ω)uS(aj,ω)u_{S}(a_{i},\omega)\geq u_{S}(a_{j},\omega) for all ajAa_{j}\in A^{*}. This implies that uS(ρ^(σ^(ω)),ω)uS(ρ^(m),ω)u_{S}(\hat{\rho}(\hat{\sigma}(\omega)),\omega)\geq u_{S}(\hat{\rho}(m^{\prime}),\omega) for all mMm^{\prime}\in M. Hence, (σ^,ρ^)(\hat{\sigma},\hat{\rho}) satisfies S-BR.

Fact (σ,ρ)(\sigma,\rho) is R-BR requires that for all mMσm\in M_{\sigma},

ωΩμ0(ω)σ(m|ω)uR(ρ(m),ω)ωΩμ0(ω)σ(m|ω)uR(a,ω)for all aA.\sum_{\omega\in\Omega}\mu_{0}(\omega)\sigma(m|\omega)u_{R}(\rho(m),\omega)\geq\sum_{\omega\in\Omega}\mu_{0}(\omega)\sigma(m|\omega)u_{R}(a^{\prime},\omega)\quad\text{for all }a^{\prime}\in A.

For any i{1,,k}i\in\left\{1,...,k\right\}, we sum the inequality above over all mMim\in M_{i}. Since for mMim\in M_{i} we have ρ(m)=ai\rho\left(m\right)=a_{i}, this yields

ωΩμ0(ω)mMiσ(m|ω)uR(ai,ω)ωΩμ0(ω)mMiσ(m|ω)uR(a,ω)for all aA.\sum_{\omega\in\Omega}\mu_{0}(\omega)\sum_{m\in M_{i}}\sigma(m|\omega)u_{R}(a_{i},\omega)\geq\sum_{\omega\in\Omega}\mu_{0}(\omega)\sum_{m\in M_{i}}\sigma(m|\omega)u_{R}(a^{\prime},\omega)\quad\text{for all }a^{\prime}\in A.

Since for any mMim\in M_{i} and ωΩi\omega\in\Omega_{i}, we have σ(m|ω)=0\sigma(m|\omega)=0, the inequality above implies

ωΩiμ0(ω)mMiσ(m|ω)uR(ai,ω)ωΩiμ0(ω)mMiσ(m|ω)uR(a,ω)for all aA.\sum_{\omega\in\Omega_{i}}\mu_{0}(\omega)\sum_{m\in M_{i}}\sigma(m|\omega)u_{R}(a_{i},\omega)\geq\sum_{\omega\in\Omega_{i}}\mu_{0}(\omega)\sum_{m\in M_{i}}\sigma(m|\omega)u_{R}(a^{\prime},\omega)\quad\text{for all }a^{\prime}\in A.

Since mMiσ(m|ω)=1\sum_{m\in M_{i}}\sigma(m|\omega)=1 if ωΩi\omega\in\Omega_{i}, we have

ωΩiμ0(ω)uR(ai,ω)ωΩiμ0(ω)uR(a,ω)for all aA.\sum_{\omega\in\Omega_{i}}\mu_{0}(\omega)u_{R}(a_{i},\omega)\geq\sum_{\omega\in\Omega_{i}}\mu_{0}(\omega)u_{R}(a^{\prime},\omega)\quad\text{for all }a^{\prime}\in A. (11)

To establish (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is R-BR, we need to show that for any miMσ^m_{i}\in M_{\hat{\sigma}}, we have

ωΩμ0(ω)σ^(mi|ω)aAρ^(a|mi)uR(a,ω)ωΩμ0(ω)σ^(mi|ω)uR(a,ω)for all aA.\sum_{\omega\in\Omega}\mu_{0}(\omega)\hat{\sigma}\left(m_{i}|\omega\right)\sum_{a\in A}\hat{\rho}\left(a|m_{i}\right)u_{R}(a,\omega)\geq\sum_{\omega\in\Omega}\mu_{0}(\omega)\hat{\sigma}\left(m_{i}|\omega\right)u_{R}(a^{\prime},\omega)\quad\text{for all }a^{\prime}\in A.

But, by definition of (σ^,ρ^)(\hat{\sigma},\hat{\rho}), we know that σ^(mi|ω)=0\hat{\sigma}\left(m_{i}|\omega\right)=0 for ωΩi\omega\notin\Omega_{i} and that ρ^(ai|mi)=1\hat{\rho}\left(a_{i}|m_{i}\right)=1. Hence, the inequality above is equivalent to Equation (11)\eqref{eq:R-BR-pure}. ∎

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. 1.

    Commitment is valuable.

  2. 2.

    Committed Sender values randomization.

  3. 3.

    For any optimal persuasion profile (σ,ρ)(\sigma,\rho), there exists mMσm\in M_{\sigma} such that

    |argmaxaAωμm(ω)uR(a,ω)|2,|\arg\max_{a\in A}\sum_{\omega}\mu_{m}(\omega)u_{R}(a,\omega)|\geq 2,

    where μm\mu_{m} is defined as μm(ω)=μ0(ω)σ(m|ω)ωμ0(ω)σ(m|ω).\mu_{m}(\omega)=\frac{\mu_{0}(\omega)\sigma(m|\omega)}{\sum_{\omega}\mu_{0}(\omega)\sigma(m|\omega)}.

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 (σ,ρ)(\sigma,\rho) such that for every mMσm\in M_{\sigma}, argmaxaAωμm(ω)uR(a,ω)\arg\max_{a\in A}\sum_{\omega}\mu_{m}(\omega)u_{R}(a,\omega) is unique. This implies that ρ\rho must be pure-on-path. We will construct an optimal persuasion profile (σ,ρ^)(\sigma,\hat{\rho}) that it is a cheap-talk equilibrium. Consider the following ρ^\hat{\rho}: for all mMσm\in M_{\sigma}, let ρ^(m)=ρ(m)\hat{\rho}(m)=\rho(m); for mMσm\notin M_{\sigma}, let ρ^(m)=ρ(m0)\hat{\rho}(m)=\rho(m_{0}) for some m0Mσm_{0}\in M_{\sigma}. Since ρ^\hat{\rho} and ρ\rho coincide on path, (σ,ρ)(\sigma,\rho) and (σ,ρ^)(\sigma,\hat{\rho}) yield the same payoffs to both Sender and Receiver. Therefore, (σ,ρ^)(\sigma,\hat{\rho}) satisfies R-BR and yields the persuasion payoff. It remains to show that (σ,ρ^)(\sigma,\hat{\rho}) is S-BR, which is equivalent to Sender’s interim optimality: for each ω\omega,

mσ(m|ω)uS(ρ^(m),ω)uS(ρ^(m),ω)\sum_{m}\sigma(m|\omega)u_{S}(\hat{\rho}(m),\omega)\geq u_{S}(\hat{\rho}(m^{\prime}),\omega) (12)

for all mMm^{\prime}\in M. First, note that it suffices to show that Equation (12)\left(\ref{eq:S-BR-interim}\right) holds for mMσm^{\prime}\in M_{\sigma}. Once we establish that, we know mσ(m|ω)uS(ρ^(m),ω)uS(ρ^(m0),ω)\sum_{m}\sigma(m|\omega)u_{S}(\hat{\rho}(m),\omega)\geq u_{S}(\hat{\rho}(m_{0}),\omega) since m0Mσm_{0}\in M_{\sigma}. Therefore, since ρ^(m)=ρ(m0)=ρ^(m0)\hat{\rho}(m^{\prime})=\rho(m_{0})=\hat{\rho}(m_{0}) for mMσm^{\prime}\notin M_{\sigma}, Equation (12)\left(\ref{eq:S-BR-interim}\right) holds for mMσm^{\prime}\notin M_{\sigma}.

Now, suppose toward contradiction that there exist ω^\hat{\omega} and m^Mσ\hat{m}\in M_{\sigma} such that mσ(m|ω^)uS(ρ^(m),ω^)<uS(ρ^(m^),ω^)\sum_{m}\sigma(m|\hat{\omega})u_{S}(\hat{\rho}(m),\hat{\omega})<u_{S}(\hat{\rho}(\hat{m}),\hat{\omega}). Consider an alternative messaging strategy σ^\hat{\sigma}: σ^(ω)=σ(ω)\hat{\sigma}(\omega)=\sigma(\omega) for ωω^\omega\neq\hat{\omega} while σ^(ω^)\hat{\sigma}\left(\hat{\omega}\right) sends the same distribution of messages as σ(ω^)\sigma\left(\hat{\omega}\right) with probability 1ε1-\varepsilon and otherwise sends message m^\hat{m}. Formally, σ^(m|ω^)={(1ε)σ(m|ω^)if mm^(1ε)σ(m|ω^)+εif m=m^\hat{\sigma}\left(m|\hat{\omega}\right)=\begin{cases}\left(1-\varepsilon\right)\sigma\left(m|\hat{\omega}\right)&\text{if }m\neq\hat{m}\\ \left(1-\varepsilon\right)\sigma\left(m|\hat{\omega}\right)+\varepsilon&\text{if }m=\hat{m}\end{cases}.

Fix any mMσm\in M_{\sigma}. Since AA is finite, the fact that ρ^(m)=ρ(m)\hat{\rho}(m)=\rho\left(m\right) is the unique argmaxaAωμm(ω)uR(a,ω)\arg\max_{a\in A}\sum_{\omega}\mu_{m}(\omega)u_{R}(a,\omega) implies that ρ^(m)\hat{\rho}(m) remains the best response for a neighborhood of beliefs around μm\mu_{m}. Therefore, for sufficiently small ε\varepsilon, (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is R-BR. Hence, (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is a persuasion profile and yields the payoff

US(σ^,ρ^)\displaystyle U_{S}(\hat{\sigma},\hat{\rho}) =US(σ,ρ^)+ε[uS(ρ^(m^),ω^)mσ(m|ω^)uS(ρ^(m),ω^)]\displaystyle=U_{S}(\sigma,\hat{\rho})+\varepsilon[u_{S}(\hat{\rho}(\hat{m}),\hat{\omega})-\sum_{m}\sigma(m|\hat{\omega})u_{S}(\hat{\rho}(m),\hat{\omega})]
>US(σ,ρ^).\displaystyle>U_{S}(\sigma,\hat{\rho}).

This contradicts the fact that (σ,ρ^)(\sigma,\hat{\rho}) 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

Lemmas 2 and 4 jointly imply Theorem 2.

A.6 Proof of Theorem 3

Recall that we consider a setting where for each (a,ω)(a,\omega), uS(a,ω)u_{S}(a,\omega) is drawn from FF and uR(a,ω)u_{R}(a,\omega) is drawn from GG. Both FF and GG are atomless, and all variables {uS(a,ω),uR(a,ω)}(a,ω)A×Ω\{u_{S}(a,\omega),u_{R}(a,\omega)\}_{(a,\omega)\in A\times\Omega} are mutually independent. Throughout this section, we fix some atomless FF and GG and some interior prior μ0\mu_{0}. When we say that the probability of some property is qq, we mean that when uSFu_{S}\sim F and uRGu_{R}\sim G, the likelihood that (uS,uR,μ0)\left(u_{S},u_{R},\mu_{0}\right) satisfies that property is qq. We use the word event to refer to a set of environments.

Given uSu_{S}, let ΩiuS={ωΩ|aiargmaxaAuS(a,ω)}\Omega_{i}^{u_{S}}=\{\omega\in\Omega|a_{i}\in\arg\max_{a\in A}u_{S}(a,\omega)\} denote the set of states where aia_{i} is an ideal action for Sender.202020In the body of the paper we denoted this set as simply Ωi\Omega_{i}, but for the formal proofs, it is helpful to keep track of the fact that this set depends on the randomly drawn uSu_{S}. Note that each ω\omega must belong to at least one ΩiuS\Omega_{i}^{u_{S}}, but the same ω\omega may appear in multiple ΩiuS\Omega_{i}^{u_{S}}. Say that uSu_{S} is regular if ΩiuSΩjuS=\Omega_{i}^{u_{S}}\cap\Omega_{j}^{u_{S}}=\emptyset for iji\neq j. Lemmas 2 and 3 jointly imply that the set of uSu_{S} that are regular has full Lebesgue measure in |A||Ω|\mathbb{R}^{\left|A\right|\,\left|\Omega\right|}. Since FF is atomless, this in turn implies that uSu_{S} is regular with probability one.

Recall that an environment is obedient if for each non-empty ΩiuS\Omega_{i}^{u_{S}},

aiargmaxaωΩiuSμ0(ω)uR(a,ω).a_{i}\in\arg\max_{a}\sum_{\omega\in\Omega_{i}^{u_{S}}}\mu_{0}(\omega)u_{R}(a,\omega). (13)

A.6.1 Arbitrary state space

In this section, we establish that for any Ω\Omega, Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right)\geq 1|A||A|.\frac{1}{\left|A\right|^{\left|A\right|}}.

Lemma 7.

In any obedient environment, commitment has no value.

Proof.

Select |A||A| elements from MM and denote them by m1m_{1} through m|A|m_{|A|}. Consider a pure strategy profile (σ,ρ)(\sigma,\rho) such that

  • σ(ω)=mi\sigma(\omega)=m_{i} implies ωΩiuS\omega\in\Omega_{i}^{u_{S}};212121If uSu_{S} is not regular, it could be that ω\omega belongs to ΩiuS\Omega_{i}^{u_{S}}and ΩjuS\Omega_{j}^{u_{S}} for distinct ii and jj. If so, it does not matter whether σ(ω)\sigma\left(\omega\right) is mim_{i} or mjm_{j}. The fact that iΩiuS=Ω\cup_{i}\Omega_{i}^{u_{S}}=\Omega, implies there exists a σ\sigma such that σ(ω)=mi\sigma(\omega)=m_{i} implies ωΩiuS\omega\in\Omega_{i}^{u_{S}}.

  • ρ(m)=ai\rho(m)=a_{i} for m=mim=m_{i} ;

  • ρ(m)=a1\rho(m)=a_{1} for m{m1,,m|A|}m\notin\{m_{1},...,m_{|A|}\}.

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, (σ,ρ)(\sigma,\rho) is a cheap-talk equilibrium that yields the persuasion payoff. ∎

Lemma 8.

Pr(obedience)1|A||A|\Pr(\text{obedience})\geq\frac{1}{|A|^{|A|}}.

Proof.

Fix some regular uSu_{S}. Consider any non-empty ΩiuS\Omega_{i}^{u_{S}}. Given independence and the fact that each uR(a,ω)u_{R}(a,\omega) is drawn from the atomless GG, each aAa\in A has an equal chance, 1/|A|1/|A|, to maximize ωΩiuSμ0(ω)uR(a,ω)\sum_{\omega\in\Omega_{i}^{u_{S}}}\mu_{0}(\omega)u_{R}(a,\omega). In particular,

Pr(aiargmaxaωΩiuSμ0(ω)uR(a,ω)|uS)=1|A|.\Pr\bigg{(}a_{i}\in\arg\max_{a}\sum_{\omega\in\Omega_{i}^{u_{S}}}\mu_{0}(\omega)u_{R}(a,\omega)\big{|}u_{S}\bigg{)}=\frac{1}{|A|}.

Moreover, this probability is independent across ii. Therefore,

Pr(obedience|uS)=i:ΩiuS is non-empty(1/|A|)1|A||A|.\Pr(\text{obedience}|u_{S})=\prod_{i:\Omega_{i}^{u_{S}}\text{ is non-empty}}(1/|A|)\geq\frac{1}{|A|^{|A|}}. (14)

This is an inequality because some ΩiuS\Omega_{i}^{u_{S}} could be empty. So, we have established that for any regular uSu_{S}, Pr(obedience|uS)1|A||A|.\Pr(\text{obedience}|u_{S})\geq\frac{1}{|A|^{|A|}}. Since uSu_{S} is regular with probability one, this in turn implies Pr(obedience)1|A||A|\Pr(\text{obedience})\geq\frac{1}{|A|^{|A|}}. ∎

Lemmas 7 and 8 jointly imply that Pr(commitment has no value)1|A||A|.\Pr\left(\text{commitment has no value}\right)\geq\frac{1}{\left|A\right|^{\left|A\right|}}.

A.6.2 Limit as |Ω|\left|\Omega\right|\rightarrow\infty

In this section, we establish that as |Ω|\left|\Omega\right|\rightarrow\infty, Pr(commitment has no value)\Pr\left(\text{commitment has no value}\right)\rightarrow 1|A||A|.\frac{1}{\left|A\right|^{\left|A\right|}}.

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 aa, there is some state ω\omega such that aa is the unique ideal action for both Sender and Receiver in ω\omega. then commitment having no value implies obedience (Lemma 9). We then show, that as |Ω|\left|\Omega\right|\rightarrow\infty, the probability of joint-inclusivity converges to one (Lemma 10). Combining these two results, we conclude that as |Ω|\left|\Omega\right|\rightarrow\infty, Pr(commitment has no value)Pr(obedience)\Pr\left(\text{commitment has no value}\right)\rightarrow\Pr\left(\text{obedience}\right).

Second, recall that Pr(obedience)1|A||A|\Pr\left(\text{obedience}\right)\geq\frac{1}{\left|A\right|^{\left|A\right|}} and that the reason this is an inequality is the possibility that some ΩiuS\Omega_{i}^{u_{S}} might be empty. When no ΩiuS\Omega_{i}^{u_{S}} is empty, it is indeed the case that Pr(obedience)=1|A||A|\Pr\left(\text{obedience}\right)=\frac{1}{\left|A\right|^{\left|A\right|}} (Lemma 12). We then show, that as |Ω|\left|\Omega\right|\rightarrow\infty, the probability that some ΩiuS\Omega_{i}^{u_{S}} is empty converges to zero (Lemma 13). Combining these two results, we conclude that as |Ω|\left|\Omega\right|\rightarrow\infty, Pr(obedience)1|A||A|\Pr\left(\text{obedience}\right)\rightarrow\frac{1}{\left|A\right|^{\left|A\right|}}.

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 σ\sigma and a pure strategy ρ\rho such that |Mσ||A|\left|M_{\sigma}\right|\leq\left|A\right| and (σ,ρ)(\sigma,\rho) is a cheap-talk equilibrium and yields the persuasion payoff.

First note that every action is induced under (σ,ρ)(\sigma,\rho); that is, for any aAa\in A, there exists ω\omega such that a=ρ(σ(ω))a=\rho(\sigma(\omega)). To see why, suppose toward contradiction that there is an aAa^{*}\in A that is not induced. Since the environment is jointly-inclusive, there exists ω\omega^{*} such that

uS(a,ω)>uS(a,ω) and uR(a,ω)>uR(a,ω) for all aa.u_{S}(a^{*},\omega^{*})>u_{S}(a,\omega^{*})\text{ and }u_{R}(a^{*},\omega^{*})>u_{R}(a,\omega^{*})\text{ for all }a\neq a^{*}. (15)

Since |Mσ||A|<|M|\left|M_{\sigma}\right|\leq\left|A\right|<\left|M\right|, there is an unsent message, say mm^{*}.

Consider the strategy profile (σ^,ρ^)(\hat{\sigma},\hat{\rho}):

  • σ^(ω)=σ(ω)\hat{\sigma}(\omega)=\sigma(\omega) for ωω\omega\neq\omega^{*}, and σ^(m|ω)={(1ε)if m=σ(ω)εif m=m0otherwise\hat{\sigma}\left(m|\omega^{*}\right)=\begin{cases}\left(1-\varepsilon\right)&\text{if }m=\sigma(\omega^{*})\\ \varepsilon&\text{if }m=m^{*}\\ 0&\text{otherwise}\end{cases}.

  • ρ^(m)=ρ(m)\hat{\rho}(m)=\rho(m) for mmm\neq m^{*}, and ρ^(m)=a\hat{\rho}(m^{*})=a^{*}.

We show that (σ^,ρ^)(\hat{\sigma},\hat{\rho}) is R-BR for sufficiently small ε\varepsilon. For any m{σ(ω),m}m\notin\{\sigma(\omega^{*}),m^{*}\}, Receiver’s belief upon observing mm is unchanged, so ρ^(m)=ρ(m)\hat{\rho}(m)=\rho(m) remains a best response. For m=mm=m^{*}, (15) implies that ρ^(m)=a\hat{\rho}(m^{*})=a^{*} is the best response. For m=σ(ω)m=\sigma(\omega^{*}), the fact the environment satisfies partitional-unique-response implies that ρ^(m)=ρ(m)\hat{\rho}\left(m\right)=\rho(m) is the unique best response to μm\mu_{m}. Moreover, since AA is finite, this further implies that ρ^(m)\hat{\rho}(m) remains the best response for a neighborhood of beliefs around μm\mu_{m}. Therefore, for sufficiently small ε\varepsilon, ρ^(m)\hat{\rho}(m) remains a best response.

Now, note that ρ(σ(ω))a\rho(\sigma(\omega^{*}))\neq a^{*} because aa^{*} is not induced under (σ,ρ)(\sigma,\rho). By (15),

US(σ^,ρ^)\displaystyle U_{S}(\hat{\sigma},\hat{\rho}) =US(σ,ρ)+ε[uS(a,ω)uS(ρ(σ(ω)),ω)]\displaystyle=U_{S}(\sigma,\rho)+\varepsilon[u_{S}(a^{*},\omega^{*})-u_{S}(\rho(\sigma(\omega^{*})),\omega^{*})]
>US(σ,ρ).\displaystyle>U_{S}(\sigma,\rho).

This contradicts the fact that (σ,ρ)(\sigma,\rho) yields the persuasion payoff. Hence, we have established that every action is induced under (σ,ρ)(\sigma,\rho).

Next, we show that this fact, coupled with the maintained assumptions, implies that the environment is obedient. Recall that (σ,ρ)(\sigma,\rho) is a cheap-talk equilibrium; hence for each ω\omega,

uS(ρ(σ(ω)),ω)uS(ρ(m),ω) for all mM.u_{S}(\rho(\sigma(\omega)),\omega)\geq u_{S}(\rho(m),\omega)\text{ for all }m\in M.

Since every action is induced under (σ,ρ)(\sigma,\rho), the inequality above is equivalent to

uS(ρ(σ(ω)),ω)uS(a,ω) for all aA.u_{S}(\rho(\sigma(\omega)),\omega)\geq u_{S}(a,\omega)\text{ for all }a\in A.

Moreover, since the environment satisfies scant-indifferences, Lemma 3 implies that

uS(ρ(σ(ω)),ω)>uS(a,ω) for all aρ(σ(ω)).u_{S}(\rho(\sigma(\omega)),\omega)>u_{S}(a,\omega)\text{ for all }a\neq\rho(\sigma(\omega)). (16)

Hence, ΩiuS={ωΩ|ρ(σ(ω))=ai}\Omega_{i}^{u_{S}}=\{\omega\in\Omega|\rho(\sigma(\omega))=a_{i}\} and ΩiuSΩjuS=\Omega_{i}^{u_{S}}\cap\Omega_{j}^{u_{S}}=\emptyset for iji\neq j. Let Mi={mMσ|ρ(m)=ai}M_{i}=\{m\in M_{\sigma}|\rho(m)=a_{i}\}. For each ii and each mMim\in M_{i}, R-BR of (σ,ρ)(\sigma,\rho) implies

ω{ω:σ(ω)=m}μ0(ω)uR(ai,ω)ω{ω:σ(ω)=m}μ0(ω)uR(a,ω) for all aA.\sum_{\omega\in\{\omega:\sigma(\omega)=m\}}\mu_{0}(\omega)u_{R}(a_{i},\omega)\geq\sum_{\omega\in\{\omega:\sigma(\omega)=m\}}\mu_{0}(\omega)u_{R}(a^{\prime},\omega)\text{ for all }a^{\prime}\in A.

Summing over all mMim\in M_{i}, and noting that mMi{ω:σ(ω)=m}={ωΩ|ρ(σ(ω))=ai}=ΩiuS\cup_{m\in M_{i}}\{\omega:\sigma(\omega)=m\}=\{\omega\in\Omega|\rho(\sigma(\omega))=a_{i}\}=\Omega_{i}^{u_{S}}, we have

ωΩiuSμ0(ω)uR(ai,ω)ωΩiuSμ0(ω)uR(a,ω) for all aA.\sum_{\omega\in\Omega_{i}^{u_{S}}}\mu_{0}(\omega)u_{R}(a_{i},\omega)\geq\sum_{\omega\in\Omega_{i}^{u_{S}}}\mu_{0}(\omega)u_{R}(a^{\prime},\omega)\text{ for all }a^{\prime}\in A.

Thus, the environment is obedient. ∎

Lemma 10.

As |Ω||\Omega|\rightarrow\infty, Pr(joint-inclusivity)1\Pr(\text{joint-inclusivity})\rightarrow 1.

Proof.

Let Ea,ωE_{a,\omega} denote the event that aa is the unique ideal action for both Sender and Receiver in state ω\omega. Let Ea=ωΩEa,ωE_{a}=\cup_{\omega\in\Omega}E_{a,\omega} denote the event that action aa is the unique ideal action for both Sender and Receiver in some state. Let E=aAEaE=\cap_{a\in A}E_{a} denote joint-inclusivity: each action is uniquely ideal for for both Sender and Receiver in some state. Our goal is to show that Pr(E)1\Pr(E)\rightarrow 1 as |Ω||\Omega|\rightarrow\infty.

Since FF and GG are atomless and payoffs are independent, in each state ω\omega, the probability that any given action aa is the unique ideal action for Sender is 1/|A|1/|A|, and the same holds for Receiver. Hence, Pr(Ea,ω)=1/|A|2\Pr(E_{a,\omega})=1/|A|^{2} for any aa and ω\omega.

Moreover, for each aa, the events Ea,ωE_{a,\omega} are independent across ω\omega. Therefore,

Pr(Ea)\displaystyle\Pr(E_{a}) =Pr(ωEa,ω)\displaystyle=\Pr(\cup_{\omega}E_{a,\omega})
=1Pr(ωEa,ωc)\displaystyle=1-\Pr(\cap_{\omega}E_{a,\omega}^{c})
=1ωΩPr(Ea,ωc)\displaystyle=1-\prod_{\omega\in\Omega}\Pr(E_{a,\omega}^{c})
=1(11|A|2)|Ω|.\displaystyle=1-\left(1-\frac{1}{|A|^{2}}\right)^{|\Omega|}.

Finally,

Pr(E)=\displaystyle\Pr(E)= Pr(aAEa)\displaystyle\Pr(\cap_{a\in A}E_{a})
=1Pr(aAEac)\displaystyle=1-\Pr(\cup_{a\in A}E_{a}^{c})
1aAPr(Eac)\displaystyle\geq 1-\sum_{a\in A}\Pr(E_{a}^{c})
=1|A|(11|A|2)|Ω|\displaystyle=1-|A|\left(1-\frac{1}{|A|^{2}}\right)^{|\Omega|}
1as |Ω|.\displaystyle\rightarrow 1\quad\text{as }|\Omega|\rightarrow\infty.

Lemma 11.

As |Ω||\Omega|\rightarrow\infty, Pr(commitment has no value)Pr(obedience)\Pr(\text{commitment has no value})\rightarrow\Pr(\text{\text{obedience}}).

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, Pr(obedience|PPS )Pr(commitment has no value|PPS)\Pr\left(\text{obedience}|\text{PPS }\right)\geq\Pr\left(\text{commitment has no value}|\text{PPS}\right). As |Ω||\Omega|\rightarrow\infty, Pr(PPS)1\Pr\left(\text{PPS}\right)\rightarrow 1 (Lemmas 1, 2, and 10). Hence, As |Ω||\Omega|\rightarrow\infty, Pr(obedience)Pr(commitment has no value)\Pr\left(\text{obedience}\right)\geq\Pr\left(\text{commitment has no value}\right). Moreover, in general Pr(commitment has no value)Pr(obedience)\Pr\left(\text{commitment has no value}\right)\geq\Pr\left(\text{obedience}\right). Thus, as |Ω||\Omega|\rightarrow\infty, Pr(commitment has no value)Pr(obedience)\Pr(\text{commitment has no value})\rightarrow\Pr(\text{\text{obedience}}). ∎

Say an environment is Sender-inclusive if ΩiuS\Omega_{i}^{u_{S}} is non-empty for all ii.

Lemma 12.

Pr(obedience|Sender-inclusivity)=1|A||A|\Pr(\text{obedience}|\text{Sender-inclusivity})=\frac{1}{|A|^{|A|}}

Proof.

As noted earlier in Equation (14)\left(\ref{eq:obedient-probability}\right), Pr(obedience|regular uS)=i:ΩiuS is non-empty1|A|\Pr(\text{obedience}|\text{regular }u_{S})=\prod_{i:\Omega_{i}^{u_{S}}\text{ is non-empty}}\frac{1}{\left|A\right|}. If the environment is Sender-inclusive, no ΩiuS\Omega_{i}^{u_{S}} is empty, so Pr(obedience|Sender-inclusivity & regular uS)=\Pr(\text{obedience}|\text{Sender-inclusivity \& regular }u_{S})=1|A||A|\frac{1}{|A|^{|A|}}. Since uSu_{S} is regular with probability one, we have Pr(obedience|Sender-inclusivity)=1|A||A|\Pr\left(\text{obedience}|\text{Sender-inclusivity}\right)=\frac{1}{|A|^{|A|}}. ∎

Lemma 13.

As |Ω||\Omega|\rightarrow\infty, Pr(Sender-inclusivity)1\Pr(\text{Sender-inclusivity})\rightarrow 1.

Proof.

Obviously, any jointly-inclusive environment is Sender-inclusive. Thus, this Lemma is a corollary of Lemma 10. ∎

Lemma 14.

As |Ω||\Omega|\rightarrow\infty, Pr(obedience)1|A||A|\Pr(\text{obedience})\rightarrow\frac{1}{|A|^{|A|}}.

Proof.

This follows from Lemmas 12 and 13. ∎

Lemmas 11 and 14 jointly yield the fact that, a |Ω||\Omega|\rightarrow\infty, Pr(commitment has no value)1|A||A|\Pr(\text{commitment has no value})\rightarrow\frac{1}{\left|A\right|^{\left|A\right|}}.