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

Social Media and Democracy

Ronen Gradwohl Department of Economics and Business Administration, Ariel University. [email protected].    Yuval Heller Department of Economics, Bar-Ilan University & University of California San Diego. [email protected].    Arye Hillman Department of Economics, Bar-Ilan University. [email protected].
Abstract

We study the ability of a social media platform with a political agenda to influence voting outcomes. Our benchmark is Condorcet’s jury theorem, which states that the likelihood of a correct decision under majority voting increases with the number of voters. We show how information manipulation by a social media platform can overturn the jury theorem, thereby undermining democracy. We also show that sometimes the platform can do so only by providing information that is biased in the opposite direction of its preferred outcome. Finally, we compare manipulation of voting outcomes through social media to manipulation through traditional media.

Keywords: Bayesian persuasion; Political agenda; Information manipulation; Condorcet Jury Theorem; Biased signals. JEL codes: D72, D82, P16

1 Introduction

In early theories of voting (Hotelling, 1929; Downs, 1957), voters are fully informed and vote based on their given preferences. In subsequent expositions, however, voters do not know which policies or competing political candidates merit their support. They are then susceptible to influence by political advertising (Hillman and Ursprung, 1988; Grossman and Helpman, 2001; Prat, 2002) and by competing endorsements of policies and candidates (Grossman and Helpman, 1999; Lichter, 2017) through mass media.

Voters can also be influenced by social media. Rather than competition between media institutions, network externalities create natural monopolies for users of social media. In addition, rather than being exposed to the same, public information, users of social media face private persuasion through algorithms that select and order the information available to them. Facebook’s News Feed algorithm, for example, determines personally, for each user, the posts are visible and the order in which they appear (Facebook, 2022). Users of social media can also be influenced by censorship or by delays in access to information. Twitter, for example, places warning labels on tweets and sometimes blocks information dissemination by locking accounts (Twitter, 2022b, a).

In this paper, we study the ability of a monopoly social media platform with a political agenda to influence users’ views through such selective transmission of information. In our model voters may have outside information and preferences that are independent of the social media platform’s agenda; however, voters are not perfectly informed, and so do not know with certainty which candidate or policy to support. To what extent can the social media platform exploit this incomplete information?

Our beginning is Condorcet’s jury theorem (1785), which shows the merit of majority voting. In the setting of the theorem, voters face a choice between two alternatives, A and B. One alternative is objectively better for all voters, but voters do not know a priori which is the preferred alternative. Each voter has limited information, expressed in probabilities, indicating which alternative is better. The jury theorem states that the better alternative is more likely to be chosen when the decision is made by majority voting than when a single individual makes the decision. As the number of voters increases, the likelihood of the decision under majority voting being correct approaches certainty. The theorem therefore vindicates democracy.

We ask, in an extension of the theorem: Does a group of voters who obtain information through a social media platform that has a political agenda also necessarily successfully make the correct decision by majority voting? Or, can information manipulation by social media undermine the merit of majority voting?

We undertake our study and derive our results within the Bayesian persuasion framework (see Kamenica, 2019, for a survey). The media platform commits to how it will manipulate information, a commitment that in practice is implemented through the algorithms used by media platforms to select and order the information that individuals obtain. Individuals are aware of the manipulation and make correct inferences using Bayes’ rule based on the information available. We show that information manipulation can lead majority voting to result in the choice of the alternative sought by the social media platform rather than the alternative that is preferable for voters. Contrary to Condorcet’s jury theorem, the consequence of information manipulation can be that a single individual is more likely to choose the socially preferred alternative than a group that decides by majority voting, even when individuals are aware of and account for the platform’s information manipulation. Democracy is thus undermined.

In the remaining parts of the introduction we demonstrate our main results using examples, and then briefly describe our general model and results. Section 2 discusses the related literature. In Section 3 we formally present our model, and then, in Section 4, we describe our results. Various extensions are presented in Section 5, followed by a conclusion in Section 6.

1.1 Illustrative Example

Before we proceed to the formal model we provide an illustrative example. We begin with Condorcet’s jury theorem, proceed to the basic logic of Bayesian persuasion, and then show how social-media persuasion can overturn the conclusion of the theorem.

Condorcet’s Jury Theorem

There are two alternatives, A and B, one of which is “better” or socially preferred. Voters are a priori unsure about which of A and B is better, but they do have some limited prior information supporting one of the alternatives. Suppose that, independently for each voter, this prior information has accuracy 55%—namely, there is a 55% chance of it being correct. Specifically, if a voter has information indicating that one of the alternatives (say, A) is better, then this voter believes there is a 55% chance that A is, in fact, better (and a 45% chance that B is better).

Thus, if each voter chooses the alternative that is more-likely to be better based on this prior information, then she has a 55% chance of choosing the socially preferred alternative. Rather than a single voter deciding between A and B, suppose that the decision is made by majority voting. Condorcet’s jury theorem states that, with sufficiently many voters, if each voter votes for the alternative that is more-likely to be better based on her own information, then the correct alternative is chosen with near certainty (due to the Law of Large Numbers).

Bayesian Persuasion

We now introduce an information designer (the social media platform) that can send voters additional information in the form of a state-dependent message. The designer is interested in ensuring that alternative A is chosen, regardless of which alternative is socially better. Suppose the designer can send one of two messages—either “A is better” or “B is better”. The designer has to choose a rule that determines which message to send as a function of the true socially-better alternative. Importantly, we assume (a`\grave{\textrm{a}} la Kamenica and Gentzkow, 2011) that the voters know the designer’s rule. The simple rule of always sending “A is better” is useless because the voters are aware that this signal is non-informative. A designer who wants to influence voters to vote for A would instead have to be more subtle.

Consider the following messaging scheme: if A is better, the designer always sends the message “A is better”; if B is better, the designer sends the message “B is better” with probability 30%, and the “incorrect” message “A is better” with the remaining 70% probability. What can voters infer from the designer’s message? Observe first that if a voter obtains message “B is better” from the designer, then this voter can be certain that B is, in fact, better.

By contrast, if a voter obtains message “A is better”, then the voter cannot be certain about which alternative is better, since this message is sent both when A is actually better but also sometimes when B is better. The exact inference that a voter can make upon obtaining message “A is better” depends on this voter’s prior information—whether it supports A or B—and is calculated by Bayes’ rule. A simple calculation shows that a voter whose prior information supported A (i.e., she has a prior belief that AA is better with probability 55%55\%), updates her posterior belief that AA is better to 64%64\%:

P[A|“A is better”]\displaystyle\mathrm{P}\left[A|\mbox{``A is better''}\right] =P[A“A is better”]P[“A is better”]=100%×55%100%×55%+70%×45%64%.\displaystyle=\frac{\mathrm{P}\left[A\cap\mbox{``A is better''}\right]}{\mathrm{P}\left[\mbox{``A is better''}\right]}=\frac{100\%\times 55\%}{100\%\times 55\%+70\%\times 45\%}\approx 64\%.

Similarly, a voter whose prior supported B updates her posterior belief that AA is better to 54%54\%:

P[A|“A is better”]\displaystyle\mathrm{P}\left[A|\mbox{``A is better''}\right] =P[A“A is better”]P[“A is better”]=100%×45%100%×45%+70%×55%54%.\displaystyle=\frac{\mathrm{P}\left[A\cap\mbox{``A is better''}\right]}{\mathrm{P}\left[\mbox{``A is better''}\right]}=\frac{100\%\times 45\%}{100\%\times 45\%+70\%\times 55\%}\approx 54\%.

Persuasion Overturns Condorcet

We now consider the effect of the designer’s message on voting outcomes, and show that the consequence is to overturn the necessity of the conclusion of Condorcet’s jury theorem. Consider first a single voter who makes the decision based on which alternative is more likely to be better. Recall from the previous section that if this voter obtained message “B is better” from the designer, then the voter is certain that BB is better, and will choose alternative B. If the voter obtained message “A is better”, however, then her belief about the likelihood of AA being better is either 64% or 54%, depending on her initial information. Importantly, however, in both cases A is more likely to be better, and so in both cases the voter will choose A upon obtaining this message.

How likely is this voter to choose the alternative that is actually better? Recall that if A is actually better, then the designer always sends message “A is better”, and the voter makes the correct choice and votes for AA. However, if B is actually better, then the designer sends message “B is better” only with probability 30%. If this happens, then the voter is certain that B is better and makes the correct choice, B. However, with the remaining 70% probability, the designer sends message “A is better”, after which the voter chooses the incorrect alternative, A. Thus, if B is actually better, the voter makes the correct choice with probability 30% and the incorrect choice with probability 70%.

Rather than a single voter deciding between A and B, suppose that the decision is made by majority voting in a large population. If A is actually better then, as above, every voter obtains message “A is better” and votes for A. If B is actually better, however, then on average 30% of voters obtain message “B is better” and vote for B, whereas on average 70% of voters obtain message “A is better” and vote for A. In this case, by the Law of Large Numbers, if there are sufficiently many voters then with very high probability a majority votes for A, although A is the incorrect alternative. Thus, if B is better, majority voting never leads to the correct alternative being chosen. Note that this is worse than a single voter making the decision, as then there was a 30% chance that B is chosen when it is better.

In this example we have illustrated how additional information provided by a self-interested designer can overturn the conclusion of Condorcet’s jury theorem. When there is no designer, a large group deciding by majority rule is more likely to make the correct decision than a single voter deciding alone. With additional information from a designer, however, the conclusion is reversed: A single voter makes the correct decision with probability 30% if B is better, but majority voting never leads to the correct decision with when B is better (and in both cases the correct decision is made when AA is better).

Negatively Biased Signals and the Limits of Persuasion

We now expand on the example above in order to answer two questions. First, what are the properties of the messaging scheme used by the designer to overturn an election? In particular, is it necessarily biased towards the outcome desired by the designer? And second, can the designer always overturn the election, or are there limits to persuasion?

We begin with the first question. Observe that in the messaging scheme described above the designer sends the message “A is better” more often than the message “B is better”. This scheme is thus biased towards A. In the example above, this particular scheme is not unique, and there are other messaging schemes—some of which are biased towards B rather than A—that also allow the designer to overturn the election. We now describe such a scheme.

Suppose that, if A is better, the designer sends the message “A is better” with probability 53%, and the message “B is better” with probability 47%. If B is better, the designer sends the message “B is better” with probability 57% and the message “A is better” with probability 43%. Notice that the designer is more likely to lie in favor of B—to send message “B is better” when A is actually better (47%)—than to lie in favor of A—to send message “A is better” when B is actually better (43%). This messaging scheme is thus biased towards B.

What is the effect of this scheme? Consider first a voter whose prior information supported A, so that this voter initially believes A to be better with probability 55%. If this voter now obtains message “B is better” from the designer, the voter updates the probability of A being correct by conditioning on the obtained message. The new belief is:

P[A|“B is better”]\displaystyle\mathrm{P}\left[A|\mbox{``B is better''}\right] =P[A“B is better”]P[“B is better”]=47%×55%47%×55%+57%×45%50.2%.\displaystyle=\frac{\mathrm{P}\left[A\cap\mbox{``B is better''}\right]}{\mathrm{P}\left[\mbox{``B is better''}\right]}=\frac{47\%\times 55\%}{47\%\times 55\%+57\%\times 45\%}\approx 50.2\%.

Thus, a voter who initially believed A to be better with probability 55%, updates this belief to 50.2% upon obtaining message “B is better” from the designer. Critically, this updated belief is above 50%, and so the voter still believes that A is more likely to be the better alternative. Similarly, if this same voter obtained message “A is better” instead of “B is better”, the updated belief would be even higher (around 60%).

Consider now a voter whose prior information supported B, so that this voter initially believes B to be better with probability 55% (and A to be better with probability 45%). If this voter now obtains message “A is better” from the designer, the voter updates the probability of A being correct by conditioning on the obtained message. The new belief is:

P[A|“A is better”]\displaystyle\mathrm{P}\left[A|\mbox{``A is better''}\right] =P[A“A is better”]P[“A is better”]=53%×45%53%×45%+43%×55%50.2%.\displaystyle=\frac{\mathrm{P}\left[A\cap\mbox{``A is better''}\right]}{\mathrm{P}\left[\mbox{``A is better''}\right]}=\frac{53\%\times 45\%}{53\%\times 45\%+43\%\times 55\%}\approx 50.2\%.

Thus, a voter who initially believed A to be better with probability 45%, updates this belief to 50.2% upon obtaining message “A is better” from the designer. Critically, this updated belief is also above 50%, and so the voter now believes A is more likely to be the better alternative.

In fact, the only voters who vote for B are those whose prior information supported B, and who then additionally obtained message “B is better” from the designer. All other voters end up with a belief indicating that A is more likely to be better, and who then vote for A.

The final step is to determine the fraction of voters for A. If A is the better alternative, then only 45% of voters’ initial information supports B, and of those, only 47% obtain message “B is better”. Thus, on average only 45%×47%=21%45\%\times 47\%=21\% of voters vote for B, and the rest for A. With high probability, then, the majority vote for A. Similarly, if B is the better alternative, then 55% of voters’ initial information supports B, and of those, 57% obtain message “B is better”. Thus, on average 55%×57%=31%55\%\times 57\%=31\% of voters vote for B. Again, this implies that with high probability, the majority vote for A. Thus, regardless of which of A or B is actually better, the designer’s messaging scheme leads to alternative A always being elected.

The example just described shows that the designer can overturn the election with a messaging scheme biased towards B—that is, towards the opposite alternative of the one preferred by the designer. In the previous section we showed that the election can also be overturned with a scheme biased towards A. So which will the designer use?

In Section 4 we characterize the biases of the schemes that can be used to overturn the election, and how they are related to the accuracy of voters’ prior information. In particular, in Corollary 1 we show that, if this accuracy is between 1/21/2 and 2/32/3, then the designer can use both classes of schemes to overturn the election. However, we also show that if the accuracy is between 2/32/3 and 2/2\sqrt{2}/2, then only schemes that are biased towards B can overturn the election. That is, in this case, the only way for the designer to overturn the election is to design a messaging scheme that is more likely to give incorrect information supporting B.

Finally, Corollary 1 also points to the limits of persuasion. The corollary states that if the voters’ prior information has accuracy greater than 2/2\sqrt{2}/2 then there is no messaging scheme that allows the designer to overturn the election. The intuition is the following. In order to overturn the election, the designer needs to convince enough voters whose initial information supported B to switch to A. But the more accurate the voters’ prior information, the more difficult it is to convince them to switch. At the extreme, if voters’ prior information is perfectly accurate, and so they know with certainty which of the alternatives is actually better, then clearly no additional information from the designer could ever shift any of their beliefs. In Corollary 1 we show that even with less extreme accuracies, if the accuracies are above 2/2\sqrt{2}/2 then there is no messaging scheme that allows the designer to convince a majority of the voters to vote for A.

1.2 A General Model

Our general model, of which the above example is a special case, shows how in more encompassing circumstances the designer is able to sway the vote towards his desired outcome. As in the example, in some cases, the preferred outcome of the designer is chosen with probability one. In other cases, the designer is unable to exert any influence at all. The ability of the designer to influence outcomes depends both on the extent to which users are exogenously informed and on the heterogeneity in the accuracy levels of users’ exogenous information.

We begin with a setting in which some voters are uninformed, whereas others are exogenously informed with the same accuracy. We show that, as long as this accuracy is not too high, the social media platform can completely sway the outcome of the vote. Interestingly, we also show that, in this case, the designer can sway the outcome of the vote with an unbiased signal. We also show that, in some cases, the designer can only sway the outcome with a signal biased towards B—that is, one that sends message “B is better” more often than the message “A is better”. Finally, we show that when users’ exogenous signal accuracy is high, the designer can no longer affect the outcome.

Next, we extend the model to a scenario in which there are two kinds of voters corresponding to two levels of exogenous-signal accuracy. Here we show that if both accuracies are sufficiently low, the designer can determine the outcome of the vote with probability one; if both accuracies are sufficiently high, the designer cannot exert any influence; and if accuracies are in an intermediate range, then whether or not the designer has influence depends on both the specific accuracies of information and the fractions of users of each kind. We show that, in this last case, there is a nonmonotonicity wherein the designer can determine the outcome if most users are of one kind and if most users are of the other kind, but not when there is a substantial fraction of each kind. There is also a nonmonotonicity wherein the designer can determine the outcome of the vote when the two accuracies are sufficiently close or sufficiently far, but not in between. Finally, we provide conditions under which the designer can control the outcome of the vote only with a signal that is biased towards A and only with a signal that is biased towards B.

2 Related Literature

A literature on social media and transmission of information to voters through the lens of Bayesian persuasion and information design has focused on studying the extent to which a holder of information can manipulate others by selective disclosure of information (Kamenica and Gentzkow, 2011). In the terminology of this literature, we study a setting of private Bayesian persuasion with multiple, informed receivers. We also restrict our designer to conditionally independent signals.

A result that Condorcet’s jury theorem can be overturned has been derived based on costly acquisition of information (Mukhopadhaya, 2003; Koriyama and Szentes, 2009). We retain the assumption of the theorem that individuals incur no cost in acquiring information. On the contrary, we describe information as imposed upon individuals through the social media platform without individuals actually seeking information.111For scenarios with costly voting, see Sun et al. (2019), who study the effects of public persuasion and cheap talk on voter turnout and Chan et al. (2019), who study the impact of costly voting on uninformed voters.

A substantial literature conjoins an information designer with strategic voting, with conclusions relying critically on the interplay between the two (see next paragraph for details). In contrast, we view voters as personally optimally voting for the outcome that they believe is better or as voting “sincerely”. This allows us to focus on and cleanly characterize the direct effects of persuasion on voting outcomes. Strategic voting, in contrast, requires the assumption that voters believe that their vote can be pivotal (or decisive) in determining the outcome of a voting.222See, for example, Pons and Tricaud (2018) and Spenkuch (2018) and the references therein for the empirical literature on strategic voting. Although much of the literature detects some amount of strategic voting, in most instances the large majority of voters are not strategic. A concession to realism is that voters in usual two-party elections for political representatives know that the likelihood of their one vote being decisive is essentially zero. We assume that voters vote sincerely based on their information and do not regard themselves as possibly decisive or pivotal.333A paradox of voting is present (Downs, 1957) if voters have a negligible probability of being pivotal; what reason does the voter have to vote? A benefit imputed to voting is expressive utility (Hillman, 2010). The act of voting is used to express an identity or sense of belonging. In this context, voting is rational. We suppose that voters enjoy an expressive benefit to voting for the correct alternative, and that all voters vote with no expectation that their vote will be pivotal in determining an election outcome.

Austen-Smith and Banks (1996) study strategic voting in the context of Condorcet’s jury theorem; they describe strategic voters conditioning their behavior on being pivotal in an election, and show that it may no longer be personally optimal to vote sincerely. Feddersen and Pesendorfer (1998) show that under general voting rules, such strategic voting may lead to a failure of information aggregation, but Feddersen and Pesendorfer (1997) show that, nonetheless, the jury theorem holds: the probability that the outcome of the vote under majority voting is correct approaches certainty as the number of voters increases. Heese and Lauermann (2021) start with the general strategic voting framework of Feddersen and Pesendorfer (1997), and add an information designer. They show that, under strategic voting, the designer can provide additional information in a way that leads to any preferred outcome with high probability. Taneva (2019) studies a symmetric two-voter game; her main result is that, in this setting, it is never optimal for the designer to commit to a conditionally independent signal. More generally, Arieli and Babichenko (2019) study a general framework for private persuasion, and characterize optimal solutions under submodularity assumptions on designer’s utility. In our setting the utility function is neither supermodular nor submodular, so these results do not apply. Finally, Kerman et al. (2020) focus on persuading uninformed voters through correlated signals that induce sincere rather than strategic voting in equilibrium.

Other literature has studied public persuasion, where the designer commits to a signal and all voters observe the same realization, as opposed to private persuasion through social media where each voter obtains a personally distinct information realization. Public Bayesian persuasion is an appropriate model for traditional media such as newspapers and television. Private persuasion is appropriate for social media, which can use personal information garnered from individuals’ attributes and communications to design selective information directed at an individual. The literature includes Alonso and Câmara (2016), who study public persuasion of heterogeneous voters. Wang (2013) compares public signals to private, conditionally independent signals, and shows that the former is more informative (and hence worse for the designer) than the latter. Gitmez and Molavi (2022) also study public persuasion, with a focus on the interplay between the bias of the signal and voters’ polarization. While less related to our work in terms of focus and results, the model of Gitmez and Molavi (2022) is similar to ours in that there is a continuum of voters and each votes sincerely.

A sizable literature has studied bias in traditional and social media, both theoretically and empirically (see Gentzkow et al., 2015; Puglisi and Snyder Jr, 2015; Strömberg et al., 2015, for a variety of surveys). Much of this literature focuses on the informational effects of media bias, as well as its welfare implications. To the best of our knowledge, our insight that the manipulator’s optimal bias is in the opposite direction of the intended outcome is new.

Last, in other related literature, Denter et al. (2021) study media bias when those it targets also have exogenous information, and share this information via a social network. They study the effects of the network’s connectivity when voters suffer from correlation neglect on the optimal bias of media. Sun et al. (2019) study the effects of public persuasion and cheap talk on turnout in a model with costly voting. Relatedly, Levy (2021) perform a field experiment to study the effects of social media (specifically, Facebook) on user’s political leanings.

3 Model

There are two policies (or candidates) denoted AA and BB, and a continuum of voters who must decide between them. There are two, equally likely states of the world, Θ={θA,θB}\Theta=\{\theta_{A},\theta_{B}\}, such that the better policy is AA in state θA\theta_{A} and BB in state θB\theta_{B}. Each voter receives a symmetric binary signal about the state of the world. Signal realizations are either aa or bb, and a signal of accuracy qq is one where

P[a|θA]=P[b|θB]=q.\mathrm{P}\left[a|\theta_{A}\right]=\mathrm{P}\left[b|\theta_{B}\right]=q.

We allow heterogeneity in the signal accuracies. Specifically, we assume that a λ\lambda-fraction (where λ(0,1)\lambda\in(0,1)) of the population has low signal accuracy q[0.5,1)q_{\ell}\in[0.5,1), and the rest have high signal accuracy qh[q,1]q_{h}\in[q_{\ell},1]. We say that the population is homogeneous if q=qhq_{\ell}=q_{h}, and that it is heterogeneous otherwise.444In Section 5 we allow more general distributions over signal accuracies and extend some of our results to this setup.

In addition to the voters, there is an information designer. The designer can send the voters additional informative signals that depend on the state of the world. Unlike the voters, however, the designer wants to maximize the probability that policy AA is chosen, regardless of the state. In particular, the designer’s utility is 1 whenever AA is chosen, and 0 otherwise. In order to influence the voters, the designer chooses a binary signal ss—a probabilistic function from the state to a pair {𝔞,𝔟}\{\mathfrak{a},\mathfrak{b}\}—and sends each voter a conditionally independent realization of ss. We interpret this signal as having been sent through a social media platform that is controlled by the information designer. As in the Bayesian persuasion framework (Kamenica and Gentzkow, 2011), we assume that the designer commits to ss prior to learning the true state of the world. In addition, and without loss of generality, assume that the signal ss is such that P[θA|𝔞]P[θA|𝔟]\mathrm{P}\left[\theta_{A}|\mathfrak{a}\right]\geq\mathrm{P}\left[\theta_{A}|\mathfrak{b}\right]. If this were not the case, one could simply switch the meaning of the two signal realizations.

Remark 3.1.

The assumption that the designer’s signal is binary is without loss of generality, given that the set of actions per voter is binary. This follows from familiar ideas from information design, but is stated and proved formally in Lemma 2 of Appendix B.

Define the bias of the designer’s signal as the weighted difference in the sizes of the “lies” in the two directions, namely,

bias(s)=2(P[s(θB)=𝔞]P[θB]P[s(θA)=𝔟]P[θA])=P[s(θB)=𝔞]P[s(θA)=𝔟],\mathrm{bias}(s)=2\cdot(\mathrm{P}\left[s(\theta_{B})=\mathfrak{a}\right]\cdot\mathrm{P}\left[\theta_{B}\right]-\mathrm{P}\left[s(\theta_{A})=\mathfrak{b}\right]\cdot\mathrm{P}\left[\theta_{A}\right])=\mathrm{P}\left[s(\theta_{B})=\mathfrak{a}\right]-\mathrm{P}\left[s(\theta_{A})=\mathfrak{b}\right],

where the expression after the first equality presents the definition for a general prior, and the expression after the latter equality relies on having a uniform prior. Thus, under the uniform prior, symmetric signals in which P[𝔞|θA]=P[𝔟|θB]\mathrm{P}\left[\mathfrak{a}|\theta_{A}\right]=\mathrm{P}\left[\mathfrak{b}|\theta_{B}\right] are unbiased—that is, they have bias 0. Positive biases correspond to signals that are more likely to yield the signal 𝔞\mathfrak{a}, and negative biases to those that are more likely to yield the signal 𝔟\mathfrak{b}. Observe that for the canonical example of Bayesian persuasion, in which a prosecutor seeks to convince a judge that a defendant is guilty (which corresponds to state θA\theta_{A}), the optimal signal is one with positive bias (Kamenica, 2019). We note that this definition of bias is an instance of the definition of Gentzkow et al. (2015) for media bias, under the assumption that the fully informative signal in which P[s(θA)=𝔞]=P[s(θB)=𝔟]=1\mathrm{P}\left[s(\theta_{A})=\mathfrak{a}\right]=\mathrm{P}\left[s(\theta_{B})=\mathfrak{b}\right]=1 has bias 0.

A strategy σi\sigma_{i} of voter ii is a function from signals (both the original signal and the designer’s signal) to a distribution over two actions—a vote for AA or a vote for BB. The outcome of the vote is then determined by the majority, with ties decided in favor of AA.555Tie-breaking in favor of AA is assumed for simplicity only—the results are nearly identical for other tie-breaking rules; see Remark 4.1. We assume that voting is sincere: each voter votes according to their own information, which includes the prior and the two signals. Sincere voting can either directly reflect the voters’ preferences (namely, each voter obtains utility 1 if she votes for the better policy), or it can correspond to voters who care for the selected outcome (i.e., each voter obtains utility 1 if the better policy is chosen), yet when voting they do not take into account the strategic effects of pivotality.666The probability of being pivotal is decreasing in the population size (for finite populations), and it is equal to zero in our continuum-population model.

Thus, each voter votes for AA if her posterior on state θA\theta_{A} is above 1/21/2 and votes for BB if her posterior is below 1/21/2. As is standard in the Bayesian persuasion literature, we assume voters vote for AA, the outcome preferred by the designer, when their posterior is exactly 1/21/2; however, the exact tie-breaking rule is unimportant for our results.

Observe that if the designer sends an uninformative signal and either q>0.5q_{\ell}>0.5 or λ<0.5<qh\lambda<0.5<q_{h}, then AA is chosen in state θA\theta_{A} and BB in state θB\theta_{B}. (In the complimentary case where either qh=0.5q_{h}=0.5 or q=0.5<λq_{\ell}=0.5<\lambda, outcome AA is chosen in both states of the world, due to our tie-breaking rule.) Furthermore, due to the population being a continuum and signals being private and conditionally independent, the outcome of the vote is deterministic, conditional on the state of the world. This means that it is either the case that the designer cannot manipulate the election’s outcome (in which case AA is still chosen only in state θA\theta_{A}, regardless of the designer’s signal), or that he can perfectly manipulate the election’s outcome, such that AA is chosen in both states. In the latter case, we say that a designer’s signal ss is optimal if it induces the choice of policy AA in both states. Note that there might be multiple optimal signals.

4 Results

4.1 Preliminaries

Suppose a voter’s belief that the state is θA\theta_{A} is equal to 1/21/2. Then any additional signal s:Θ{𝔞,𝔟}s:\Theta\mapsto\{\mathfrak{a},\mathfrak{b}\} induces a pair of posteriors (α,β)(\alpha,\beta), where α=P[θA|𝔞]\alpha=\mathrm{P}\left[\theta_{A}|\mathfrak{a}\right] and β=P[θA|𝔟]\beta=\mathrm{P}\left[\theta_{A}|\mathfrak{b}\right]. The signal is uninformative if α=β=0.5\alpha=\beta=0.5. If the signal is informative we can assume without loss of generality that 0β<12<α10\leq\beta<\frac{1}{2}<\alpha\leq 1, and in this case there exists a (unique) signal that induces these posteriors. Thus, we can identify any informative signal with the pair of posterior distributions it induces when starting with prior 12\frac{1}{2}.777Representing signals as distributions over posteriors is standard in Bayesian persuasion (Kamenica, 2019). Representing them as posteriors starting with a prior of 12\frac{1}{2} is common in the literature on social learning (see, e.g., Acemoglu et al., 2011; Arieli et al., 2020, 2021). For any α<12<β\alpha<\frac{1}{2}<\beta, the exact mapping can be derived as follows: First, since the expected prior is equal to the posterior, we have

αp𝔞\displaystyle\alpha p_{\mathfrak{a}} +β(1p𝔞)=12p𝔞=12βαβ,p𝔟=α12αβ,\displaystyle+\beta(1-p_{\mathfrak{a}})=\frac{1}{2}~{}~{}~{}~{}\Rightarrow~{}~{}~{}~{}p_{\mathfrak{a}}=\frac{\frac{1}{2}-\beta}{\alpha-\beta},~{}~{}~{}~{}p_{\mathfrak{b}}=\frac{\alpha-\frac{1}{2}}{\alpha-\beta},

where p𝔞=P[𝔞]p_{\mathfrak{a}}=\mathrm{P}\left[\mathfrak{a}\right] and p𝔟=P[𝔟]=1pap_{\mathfrak{b}}=\mathrm{P}\left[\mathfrak{b}\right]=1-p_{a}. Next, we have that

P[s(θA)=𝔞]=P[𝔞|θA]=P[θA|𝔞]p𝔞P[θA]=αp𝔞1/2=α2αβαβP[𝔟|θA]=2αββαβ.\mathrm{P}\left[s(\theta_{A})=\mathfrak{a}\right]=\mathrm{P}\left[\mathfrak{a}|\theta_{A}\right]=\frac{\mathrm{P}\left[\theta_{A}|\mathfrak{a}\right]p_{\mathfrak{a}}}{\mathrm{P}\left[\theta_{A}\right]}=\frac{\alpha p_{\mathfrak{a}}}{1/2}=\frac{\alpha-2\alpha\beta}{\alpha-\beta}~{}~{}\Rightarrow~{}~{}\mathrm{P}\left[\mathfrak{b}|\theta_{A}\right]=\frac{2\alpha\beta-\beta}{\alpha-\beta}.

Similarly,

P[s(θB)=𝔞]=P[𝔞|θB]=P[θB|𝔞]p𝔞1/2=12βα+2αβαβP[𝔟|θB]=2α+β12αβαβ.\mathrm{P}\left[s(\theta_{B})=\mathfrak{a}\right]=\mathrm{P}\left[\mathfrak{a}|\theta_{B}\right]=\frac{\mathrm{P}\left[\theta_{B}|\mathfrak{a}\right]p_{\mathfrak{a}}}{1/2}=\frac{1-2\beta-\alpha+2\alpha\beta}{\alpha-\beta}~{}~{}\Rightarrow~{}~{}\mathrm{P}\left[\mathfrak{b}|\theta_{B}\right]=\frac{2\alpha+\beta-1-2\alpha\beta}{\alpha-\beta}.

Furthermore, this analysis implies that the bias of the signal (α,β)(\alpha,\beta) is:

bias(α,β)=P[s(θB)=𝔞]P[s(θA)=𝔟]=1βααβ.\mathrm{bias}(\alpha,\beta)=\mathrm{P}\left[s(\theta_{B})=\mathfrak{a}\right]-\mathrm{P}\left[s(\theta_{A})=\mathfrak{b}\right]=\frac{1-\beta-\alpha}{\alpha-\beta}. (1)

Next, we have the following lemma, which allows us to focus in our analysis on a small set of 2×32\times 3 signals, such that, if the election is manipulable, one of these signals must be optimal (and any other optimal signal has weakly higher values of α\alpha and β\beta).

Lemma 1.

Suppose that signal (α,β)(\alpha^{\prime},\beta^{\prime}) is optimal. Then the signal (α,β)(\alpha,\beta) is also optimal, where α=max{q{q,qh}:qα}\alpha=\max\big{\{}q\in\{q_{\ell},q_{h}\}:q\leq\alpha^{\prime}\big{\}} and β=max{q{0,1qh,1q}:qβ}\beta=\max\big{\{}q\in\{0,1-q_{h},1-q_{\ell}\}:q\leq\beta^{\prime}\big{\}}.

The intuition for Lemma 1 is that for any signal, slightly decreasing either α\alpha or β\beta increases the probability of the AA-favorable realization 𝔞\mathfrak{a}, and that if α{q,qh}\alpha\notin\{q_{\ell},q_{h}\} and β{0,1qh,1q}\beta\notin\{0,1-q_{h},1-q_{\ell}\}, then this slight decrease has no effect on the behavior of any voter conditional on her signals. See Appendix A for the proof. Table 1 summarizes the key properties of these 2×32\times 3 optimal signals (which are derived from straightforward calculations). Note that the share of voters who vote for policy AA in state θA\theta_{A} is always larger than in state θB\theta_{B}, and, thus, a signal is optimal if and only if it induces at least half of the agents to vote for policy AA in state θB\theta_{B}.

Table 1: Key Properties of the 2×32\times 3 Signals of Lemma 1
(α,β)\left(\alpha,\beta\right) P[s(θB)=𝔟]\mathrm{P}\left[s(\theta_{B})=\mathfrak{b}\right] Bias How voters vote Share of BB voters in θB\theta_{B}
(q,0)\left(q_{\ell},0\right) 21q2-\frac{1}{q_{\ell}} 1qq>0\begin{array}[]{c}\\ \\ \end{array}\frac{1-q_{\ell}}{q_{\ell}}>0\begin{array}[]{c}\\ \\ \end{array} qhq_{h}: Vote AA iff aa AND 𝔞\mathfrak{a} qq_{\ell}: Follow designer’s signal 1(1q)(1qh+λqh)q1-\frac{\left(1-q_{\ell}\right)\left(1-q_{h}+\lambda q_{h}\right)}{q_{\ell}} (decreases in λ\lambda)
(qh,0)\left(q_{h},0\right) 21qh2-\frac{1}{q_{h}} 1qhqh>0\begin{array}[]{c}\\ \\ \end{array}\frac{1-q_{h}}{q_{h}}>0\begin{array}[]{c}\\ \\ \end{array} Follow designer’s signal 2qh1qh\frac{2q_{h}-1}{q_{h}} (independent of λ\lambda)
(q,1q)\left(q_{\ell},1-q_{\ell}\right) q\begin{array}[]{c}\\ \\ \end{array}q_{\ell}\begin{array}[]{c}\\ \\ \end{array} 0\begin{array}[]{c}\\ \\ \end{array}0\begin{array}[]{c}\\ \\ \end{array} qhq_{h}: Follow original signal qq_{\ell}: Vote AA iff aa OR 𝔞\mathfrak{a} qhλ(qhq2)q_{h}-\lambda\left(q_{h}-q_{\ell}^{2}\right) (decreases in λ\lambda)
(q,1qh)\left(q_{\ell},1-q_{h}\right)\begin{array}[]{c}\\ \\ \end{array} qh(2q1)qh+q1\frac{q_{h}(2q_{\ell}-1)}{q_{h}+q_{\ell}-1} qhqq+qh1>0\frac{q_{h}-q_{\ell}}{q_{\ell}+q_{h}-1}>0 qhq_{h}: Follow original signal qq_{\ell}: Follow designer’s signal λqh(2q1)qh+q1+(1λ)qh\lambda\frac{q_{h}(2q_{\ell}-1)}{q_{h}+q_{\ell}-1}+\left(1-\lambda\right)q_{h} (decreases in λ\lambda)
(qh,1q)\left(q_{h},1-q_{\ell}\right)\begin{array}[]{c}\\ \\ \end{array} q(2qh1)qh+q1\frac{q_{\ell}(2q_{h}-1)}{q_{h}+q_{\ell}-1} qhqq+qh1<0-\frac{q_{h}-q_{\ell}}{q_{\ell}+q_{h}-1}<0 Vote AA iff aa OR 𝔞\mathfrak{a} (λq+(1λ)qh)q(2qh1)qh+q1\left(\lambda q_{\ell}+\left(1-\lambda\right)q_{h}\right)\frac{q_{\ell}(2q_{h}-1)}{q_{h}+q_{\ell}-1} (decreases in λ\lambda)
(qh,1qh)\left(q_{h},1-q_{h}\right)\begin{array}[]{c}\\ \\ \end{array} qhq_{h} 0 qhq_{h}: Vote AA iff aa OR 𝔞\mathfrak{a} qq_{\ell}: Follow designer’s signal qh2+λqh(1qh)q_{h}^{2}+\lambda q_{h}\left(1-q_{h}\right) (increases in λ\lambda)
Remark 4.1.

The tie-breaking rule has no significant impact on our results. In particular, if one assumes the opposite, BB-favorable tie-breaking rules (namely, each agent votes for BB when indifferent, and BB is chosen if supported by exactly half of the voters), then the only minor effect on our results will be that the optimal signals will be perturbed by a small ε>0\varepsilon>0. Formally, if the designer can manipulate the elections, then there would be an optimal signal of the form (12+ε,β+ε)(\frac{1}{2}+\varepsilon,\beta+\varepsilon) or (α+ε,β+ε)(\alpha+\varepsilon,\beta+\varepsilon), with α{q,qh}\alpha\in\{q_{\ell},q_{h}\} and β{0,1qh,1q}\beta\in\{0,1-q_{h},1-q_{\ell}\}, for a sufficiently small ε>0\varepsilon>0.

4.2 Partially Uninformed Populations (q=12q_{\ell}=\frac{1}{2})

In this section we focus on the case in which the low-accuracy signal is uninformative (i.e., q=12q_{\ell}=\frac{1}{2}). That is, we assume that a share λ\lambda of the population is uninformed, and the remaining agents obtain each a private signal with accuracy qhq_{h}. An interesting special case, discussed towards the end of the section, is that of homogeneous populations, in which all voters have the same signal accuracy (formally, λ=0\lambda=0).

Our first observation is that if the signal accuracy qhq_{h} is below some threshold, denoted by qNI(λ)q_{NI}(\lambda), then policy AA is always chosen, even without any manipulation by the designer.888 If one changes the tie-breaking rule to favor policy BB, then under the same condition on λ\lambda, the designer can perfectly manipulate the election’s outcome by sending the signal (12+ε,1qh)(\frac{1}{2}+\varepsilon,1-q_{h}) for a sufficiently small 0<ε10<\varepsilon\ll 1. This signal is almost-uninformative in the sense that with an arbitrarily high probability of 1O(ε)1-O(\varepsilon) the agents get the realization 𝔞\mathfrak{a}, which only slightly increases the likelihood of state θA\theta_{A}, and which is sufficient to make the uninformed voters to strictly prefer policy AA.

Claim 1.

Policy AA is chosen in both states with an uninformative designer’s signal iff

qhqNI(λ)12(1λ).q_{h}\leq q_{NI}(\lambda)\equiv\frac{1}{2(1-\lambda)}.
Proof.

In either state, uninformed voters always vote for AA, and informed voters vote for AA if they receive signal aa. In state θA\theta_{A}, the latter make up a qh>1/2q_{h}>1/2 share, and so overall a majority of voters always votes for AA. In state θB\theta_{B}, voters for AA consist of the λ\lambda-fraction of uninformed voters and the (1λ)(1qh)(1-\lambda)\cdot(1-q_{h})-fraction of informed voters who receive signal bb. Thus, at least half of the voters vote for policy AA in state θB\theta_{B} if and only if λ+(1λ)(1qh)12λ112qhqh12(1λ).\lambda+(1-\lambda)\cdot(1-q_{h})\geq\frac{1}{2}\Leftrightarrow\lambda\geq 1-\frac{1}{2q_{h}}\Leftrightarrow q_{h}\leq\frac{1}{2(1-\lambda)}.

It is straightforward to verify that qNI(λ)q_{NI}(\lambda) is increasing in λ\lambda, that qNI(25%)=23q_{NI}(25\%)=\frac{2}{3}, and that qNI(50%)=1q_{NI}(50\%)=1. This is illustrated by the solid (red) curve in Figure 1. In what follows we focus on the more interesting case in which qhq_{h} is above this threshold—namely, the case in which policy BB is chosen in state θB\theta_{B} unless the designer manipulates the outcome.

In order to state our result, we define q¯:[0,1)[0.5,1]\overline{q}:[0,1)\Rightarrow[0.5,1] as follows:

q¯(λ)=λ+λ2+22λ22λ.\overline{q}(\lambda)=\frac{-\lambda+\sqrt{\lambda^{2}+2-2\lambda}}{2-2\lambda}.

It is straightforward to verify the following, illustrated by the dashed (blue) line in Figure 1:

Fact 1.

q¯(λ)\overline{q}(\lambda) is decreasing in λ\lambda, q¯(0)=22\overline{q}(0)=\frac{\sqrt{2}}{2}, and q¯(25%)=23=qNI(25%)\overline{q}(25\%)=\frac{2}{3}=q_{NI}(25\%).

Our first result shows that the designer can manipulate the election’s outcome iff qhq¯(λ)q_{h}\leq\overline{q}(\lambda), and that manipulation (when possible) can be implemented by an unbiased signal. Moreover, for values of precision in the interval (23,q¯(λ)(\frac{2}{3},\overline{q}(\lambda) (values above the horizontal dotted (black) line in Figure 1), all optimal signals have non-positive biases.

Refer to caption
Figure 1: Illustration of Proposition 1 (q=0.5)q_{\ell}=0.5)
Proposition 1.

Suppose that q=12q_{\ell}=\frac{1}{2} and qh>qNI(λ).q_{h}>q_{NI}(\lambda).

  1. 1.

    If qh>q¯(λ)q_{h}>\overline{q}(\lambda) then the designer cannot manipulate the election’s result.

  2. 2.

    If qhq¯(λ)q_{h}\leq\overline{q}(\lambda) then the designer can manipulate the election’s outcome, and can do so by using the unbiased signal (qh,1qh)(q_{h},1-q_{h}).

  3. 3.

    If qh(23,q¯(λ)]q_{h}\in(\frac{2}{3},\overline{q}(\lambda)] then all optimal signals have non-positive biases.

An interesting feature of the optimal signals is that they have non-positive bias (bullets 2 and 3 of Proposition 1). Observe that this is the opposite direction of bias relative to the standard application of Bayesian persuasion (Kamenica and Gentzkow, 2011), in which the bias is positive (i.e., in favor of AA, the designer-optimal outcome). The intuition underlying the contrast between the standard application and our setup is the following. A voter who is informed and obtains signal aa is prepared to vote for AA, whereas a voter who is informed and obtains signal bb is prepared to vote for BB. The designer would like to convince the latter to also vote for AA, while at the same time not causing the former to switch. The way to do this is to choose a signal for which realization 𝔞\mathfrak{a} is stronger than realization 𝔟\mathfrak{b}, so that voters with realizations (b,𝔞)(b,\mathfrak{a}) switch to AA but voters with realizations (a,𝔟)(a,\mathfrak{b}) do not switch to BB. Of course, since 𝔞\mathfrak{a} is stronger than 𝔟\mathfrak{b}, it must be the case that 𝔟\mathfrak{b} is realized with higher probability, or, in other words, that the signal has non-positive bias. We now prove Proposition 1.

Proof.

Claim 1 and the inequality qh>qNI(λ)q_{h}>q_{NI}(\lambda) imply that policy AA is not chosen in state θB\theta_{B} if the signal is uninformative. Due to this we can focus on informative signals. Thus, Lemma 1 implies that if the designer can manipulate the election, then either (qh,0)(q_{h},0) or (qh,1qh)(q_{h},1-q_{h}) are optimal. Signal (qh,0)(q_{h},0) induces all voters to vote according to the designer’s signal ss (and to ignore the original signal). The probability of signal ss being in favor of AA in state θB\theta_{B} is Pr(s(θB)=𝔞)=12βα+2αβαβ=1qhqh,\Pr(s(\theta_{B})=\mathfrak{a})=\frac{1-2\beta-\alpha+2\alpha\beta}{\alpha-\beta}=\frac{1-q_{h}}{q_{h}}, which is weakly larger than 50%50\% iff qh23.q_{h}\leq\frac{2}{3}.

Signal (qh,1qh)(q_{h},1-q_{h}) induces informed (resp., uninformed) agents to vote for AA if either of their two signals (resp., the designer’s signal) is in favor of AA, which has probability of 1qh21-q_{h}^{2} (resp., 1qh1-q_{h}) in state θB\theta_{B}. Thus, the share of voters who vote for policy AA in state θB\theta_{B} is at least 50%50\% iff λ(1qh)+(1λ)(1qh2)50%qq¯(λ).\lambda\cdot(1-q_{h})+(1-\lambda)\cdot(1-q_{h}^{2})\geq 50\%\Leftrightarrow q\leq\overline{q}(\lambda). Combining these observartions with Fact 1 implies bullets (1) and (2) of the proposition.

The argument for bullet (3) is the following. Due to Lemma 1, if 23<qh22\frac{2}{3}<q_{h}\leq\frac{\sqrt{2}}{2}, then any optimal signal (α,β)(\alpha,\beta) must satisfy αqh\alpha\geq{q_{h}} and β1qh\beta\geq{1-q_{h}}. In this case, the numerator in (1), namely, 1(α+β)1-(\alpha+\beta), is non-positive. Since the denominator is always positive, this implies that the bias is non-positive. ∎

An interesting special case is a homogeneous population in which all agents have the same signal quality (i.e., λ=0\lambda=0). Applying Proposition 1 yields the following characterization of election manipulation in homogeneous populations.

Corollary 1 (Homogeneous populations).

Suppose that λ=0\lambda=0.

  1. 1.

    If qh>22q_{h}>\frac{\sqrt{2}}{2} then the designer cannot manipulate the election’s result.

  2. 2.

    If qh22q_{h}\leq\frac{\sqrt{2}}{2} then the designer can manipulate the election’s outcome, and can do so by using the unbiased signal (qh,1qh)(q_{h},1-q_{h}).

  3. 3.

    If qh(23,22]q_{h}\in(\frac{2}{3},\frac{\sqrt{2}}{2}] then all optimal signals have non-positive biases.

4.3 General Binary Signals (12<q<qh,λ[0,1])\left(\frac{1}{2}<q_{\ell}<q_{h},\,\,\lambda\in[0,1]\right)

In this section we return to the general binary model in which the low-accuracy signal is informative (q>1/2q_{\ell}>1/2). We prove two results: first, a characterization of conditions under which the designer can manipulate the election; and second, an identification of conditions under which optimal signals have positive or negative biases.

In order to state our first result we define λ¯:(12,22)][0,1]\underline{\lambda}:(\frac{1}{2},\frac{\sqrt{2}}{2})]\rightarrow[0,1] as follows: λ¯(qh)=0.5qh2qh(1qh).\underline{\lambda}(q_{h})=\frac{0.5-q_{h}^{2}}{q_{h}\left(1-q_{h}\right)}. We will show in the proof of Proposition 2 below that λ¯(qh)\underline{\lambda}(q_{h}) is the highest share of λ\lambda for which the signal (qh,1qh)(q_{h},1-q_{h}) induces a majority of the voters to vote for AA in state θB\theta_{B} for all values of qqhq_{\ell}\leq q_{h}. Observe that:

Fact 2.

The function λ¯(qh)\underline{\lambda}(q_{h}) is decreasing, λ¯(23)=25%\underline{\lambda}(\frac{2}{3})=25\%, and λ¯(22)=0\underline{\lambda}(\frac{\sqrt{2}}{2})=0.

Proposition 2.
  1. 1.

    If 22<q\frac{\sqrt{2}}{2}<q_{\ell}, then the designer cannot manipulate the election.

  2. 2.

    If q<22<qhq_{\ell}<\frac{\sqrt{2}}{2}<q_{h}, then the designer can manipulate the election iff λ\lambda is sufficiently large.

  3. 3.

    If 23<qh22\frac{2}{3}<q_{h}\leq\frac{\sqrt{2}}{2}, then the designer can manipulate the elections iff either (1) λλ¯(qh)\lambda\leq\underline{\lambda}(q_{h}), or (2) λ\lambda is sufficiently large.

  4. 4.

    If qh23q_{h}\leq\frac{2}{3}, then the designer can manipulate the elections for any qq_{\ell} and λ\lambda.

Proof.
  1. 1.

    Corollary 1 implies that for each q>22q>\frac{\sqrt{2}}{2} all signals induce less than 50%50\% of agents with signal accuracy qq to vote for policy AA in state θB.\theta_{B}. This implies that if q>22,q_{\ell}>\frac{\sqrt{2}}{2}, then a majority of the voters support policy BB in state θB\theta_{B} (i.e., the designer cannot manipulate the elections).

  2. 2.

    This is implied by the observation that when 22<qh\frac{\sqrt{2}}{2}<q_{h} both signals (qh,0)(q_{h},0) and (qh,1qh)(q_{h},1-q_{h}) cannot manipulate the elections, while the share of agents who support policy AA in state θB\theta_{B} is increasing in λ\lambda (and is greater than than 50% for sufficiently high λ\lambda) for each of the other optimal signals of Lemma 1 (see Table 1). Signal (qh,0)(q_{h},0) cannot manipulate the elections because the induced share of BB supporters in state θB\theta_{B} is 2qh1qh,\frac{2q_{h}-1}{q_{h}}, which is larger than 50%50\% iff qh>22q_{h}>\frac{\sqrt{2}}{2}. Signal (qh,1qh)(q_{h},1-q_{h}) induces a share qh2+λqh(1qh)q_{h}^{2}+\lambda q_{h}(1-q_{h}) of the voters to vote for policy BB in state θB\theta_{B} (see Table 1). This share is smaller than 50%50\% iff λλ¯(qh)\lambda\leq\underline{\lambda}(q_{h}) because qh2+λqh(1qh)0.5λ0.5qh2qh(1qh)λ¯(qh).q_{h}^{2}+\lambda q_{h}(1-q_{h})\leq 0.5\Leftrightarrow\lambda\leq\frac{0.5-q_{h}^{2}}{q_{h}(1-q_{h})}\equiv\underline{\lambda}(q_{h}). As observed in Fact 2, λ¯(22)=0,\underline{\lambda}(\frac{\sqrt{2}}{2})=0, which implies that signal (qh,1qh)(q_{h},1-q_{h}) cannot manipulate the elections if qh>22.q_{h}>\frac{\sqrt{2}}{2}.

  3. 3.

    Part (1) is implied by the observation that the designer’s signal (qh,1qh)\left(q_{h},1-q_{h}\right) induces a share qh2+λqh(1qh)q_{h}^{2}+\lambda q_{h}(1-q_{h}) to vote for policy BB in state θB\theta_{B}, and that this share is less than 50%50\% if λλ¯(qh).\lambda\leq\underline{\lambda}(q_{h}). Part (2) is implied by the fact that signal (qh,0)(q_{h},0) (resp., (qh,1qh)(q_{h},1-q_{h})) does not manipulate the elections when qh>23q_{h}>\frac{2}{3} (resp., λ>λ¯(qh)\lambda>\underline{\lambda}(q_{h})), and that the share of supporters of policy AA in state θB\theta_{B} is increasing in λ\lambda for each of the other four signals of Lemma 1.

  4. 4.

    Observe (Table 1) that the designer’s signal (qh,0)\left(q_{h},0\right) induces a share of 2qh1qh\frac{2q_{h}-1}{q_{h}} of the agents to vote for BB in state θB\theta_{B} (for all values of qqhq_{\ell}\leq q_{h}), and that this share is smaller than 50%50\% iff qh23.q_{h}\leq\frac{2}{3}.

Our results are illustrated in Figure 2. Bullet (3) of Proposition 2 implies an interesting non-monotonicity in λ\lambda: When qhq_{h} is in the interval (23,22)\left(\frac{2}{3},\frac{\sqrt{2}}{2}\right), then the elections are manipulable if either the share of agents with low accuracy is sufficiently small (namely, λλ¯\lambda\leq\underline{\lambda}) or if it is sufficiently large, but the elections cannot be manipulated if this share is intermediate. The intuition for this non-monotonicity is as follows. Our designer is constrained by the fact that he must choose the same signal distribution to all agents. When λ\lambda is either very low or very high, the designer can tune this distribution to the large majority of agents by sending an unbiased signal with the “right” level of accuracy (i.e., a level that induces most voters to vote AA if either of their signals is in favor of AA). By contrast, when λ\lambda is close to 50%50\%, the designer has a trade-off, and must send a “versatile” signal that can handle both groups of agents (and is not optimally “tailored” to either group), and this limits his ability to manipulate the elections.

Moreover, one can show that the ability to manipulate the elections is also non-monotonic in qq_{\ell}. Specifically, for each qhq_{h}, the interval of λ\lambda-s for which the elections cannot be manipulated is non-monotone in qq_{\ell}: the interval is small (and it might even disappear) when qq_{\ell} is either small (close to 50%50\%) or large (close to qhq_{h}), while it is largest when qq_{\ell} is intermediate. The intuition for the non-monotonicity in qq_{\ell} is as follows. When qq_{\ell} is low, it is easy to manipulate the low-accuracy agents. The designer can send a positively biased signal that with high probability sends a “weak-pro-AA” realization, which manipulates most low-accuracy agents (and a sufficient number of high-accuracy agents). When qq_{\ell} is close to qhq_{h}, the designer can exploit the relative homogeneity of the population by sending the negatively biased signal (qh,1q)(q_{h},1-q_{\ell}), which induces both types of agents to vote for AA if either of their signals is “pro-AA”. In contrast, when qq_{\ell} has an intermediate value the designer has neither of these two benefits, and thus his ability to manipulate the elections is limited.

Refer to caption
Figure 2: Outcome Manipulation for qh=70%q_{h}=70\% and Various Values of qq_{\ell} (values between 50%50\% and 70%70\% in steps of 1%1\%) and λ\lambda (values between 0 and 100%100\% in steps of 5%5\%)

Recall that in the special case of q=0.5q_{\ell}=0.5 (partially informed agents), manipulation, when possible, could always be implemented by an unbiased signal (and in some cases only by signals with non-positive biases). In what follows, we show that this is no longer the case in the general setup (with q>0.5q_{\ell}>0.5). Specifically, we characterize both setups in which manipulation can only be implemented by positively biased signals (in which the signal 𝔞\mathfrak{a} is sent more often than 𝔟\mathfrak{b}), and setups in which manipulation can only be implemented by negatively biased signals. Specifically, Proposition 3 below shows that the direction of the bias is uniquely determined (for an interior interval of λ\lambda-s) in the following setups:

  1. 1.

    All optimal signals must have a positive bias if qh>23q_{h}>\frac{2}{3} and qq_{\ell} is sufficiently low.

  2. 2.

    All optimal signal must have a negative bias if qh(23,22)q_{h}\in(\frac{2}{3},\frac{\sqrt{2}}{2}) and qq_{\ell} is sufficiently high.

Observe that in the second case, the manipulation is implemented by signals with the opposite direction of bias relative to the standard applications of Bayesian persuasion (see, e.g., Kamenica, 2019). The intuition for this is that the optimal negatively biased signal (qh,1q)(q_{h},1-q_{\ell}) exploits the (modest) heterogeneity of the population: the relatively infrequent signal 𝔞\mathfrak{a} is sufficiently informative to induce both types of agents to vote AA regardless of their exogenous signal, while the more frequently used signal 𝔟\mathfrak{b} is sufficiently weakly-informative, such that it does not change the voting of any agent who got exogenous signal in favor of policy AA.

Proposition 3.
  1. 1.

    For any qh>23q_{h}>\frac{2}{3} there is a q¯(0.5,qh)\overline{q}\in(0.5,q_{h}) such that, if q(0.5,q¯)q_{\ell}\in(0.5,\overline{q}), then there is an interior open interval of λ\lambda-s for which all optimal signals have positive biases.

  2. 2.

    For any qh(23,22)q_{h}\in\left(\frac{2}{3},\frac{\sqrt{2}}{2}\right) there is a q¯(0.5,qh)\underline{q}\in(0.5,q_{h}), such that, if q(q¯,qh)q_{\ell}\in(\underline{q},q_{h}), then there is an interior open interval of λ\lambda-s for which all optimal signals have negative biases.

Proof.

Fix qh>23.q_{h}>\frac{2}{3}. Proposition 2 and Fact 2 imply that the signals (qh,0)(q_{h},0) and (qh,1qh)(q_{h},1-q_{h}) are not optimal if λ>0.25ϵ\lambda>0.25-\epsilon for a sufficiently small ϵ>0.\epsilon>0.

  1. 1.

    The limit of the share of BB voters in state θB\theta_{B} when qq_{\ell} converges to 0.5 (see Table 1) is equal to qh(1λ)q_{h}(1-\lambda) for the positively biased signals (q,0)(q_{\ell},0) and (q,1qh)(q_{\ell},1-q_{h}), while it is strictly higher for the remaining two signals: it is equal to qh(1λ)+14q_{h}(1-\lambda)+\frac{1}{4} for signal (q,1q)(q_{\ell},1-q_{\ell}), and it is equal to qh(1λ)+λ2q_{h}(1-\lambda)+\frac{\lambda}{2} for signal (qh,1q)(q_{h},1-q_{\ell}). This implies that for sufficiently small qq_{\ell}-s, if λ\lambda is slightly above 112qh1-\frac{1}{2q_{h}}, then only the positively biased signals (q,0)(q_{\ell},0) and (q,1qh)(q_{\ell},1-q_{h}) are optimal in the set of six signals of Lemma 1. By Lemma 1, this implies that the only potentially optimal signals are (α,β)[q,qh)×[0,1qh)(\alpha^{\prime},\beta^{\prime})\in[q_{\ell},q_{h})\times[0,1-q_{h}) or (α,β)[q,qh)×[1qh,1q)(\alpha^{\prime},\beta^{\prime})\in[q_{\ell},q_{h})\times[1-q_{h},1-q_{\ell}). Note that the former are all positively biased. The latter, however, may be either positively or negatively biased.

    We now show that only the positively biased signals (α,β)[q,qh)×[1qh,1q)(\alpha^{\prime},\beta^{\prime})\in[q_{\ell},q_{h})\times[1-q_{h},1-q_{\ell}) are potentially optimal. Fix some (α,β)[q,qh)×[1qh,1q)(\alpha^{\prime},\beta^{\prime})\in[q_{\ell},q_{h})\times[1-q_{h},1-q_{\ell}), and define qq_{\ell}^{\prime} and qhq_{h}^{\prime} so that (α,β)=(q,1qh)(\alpha^{\prime},\beta^{\prime})=(q_{\ell}^{\prime},1-q_{h}^{\prime}). Observe that this signal is positively biased if q<qhq_{\ell}^{\prime}<q_{h}^{\prime}, and negatively biased if the inequality is flipped. Under this signal, the fraction of voters for BB in state θB\theta_{B} is

    P[B|θB]=λqh(2q1)qh+q1+(1λ)qh.\mathrm{P}\left[B|\theta_{B}\right]=\lambda\frac{q_{h}^{\prime}(2q_{\ell}^{\prime}-1)}{q_{h}^{\prime}+q_{\ell}^{\prime}-1}+\left(1-\lambda\right)q_{h}.

    Now, if the signal is negatively biased, and so qqhq_{\ell}^{\prime}\geq q_{h}^{\prime}, then 2q1qh+q12q_{\ell}^{\prime}-1\geq q_{h}^{\prime}+q_{\ell}^{\prime}-1, and so the first term of P[B|θB]\mathrm{P}\left[B|\theta_{B}\right] is bounded below by λqhλ/2\lambda q_{h}^{\prime}\geq\lambda/2. The total fraction of voters for BB is then at least qh(1λ)+λ/2q_{h}(1-\lambda)+\lambda/2, the same as for signal (qh,1q)(q_{h},1-q_{\ell}). But just like that signal, if λ\lambda is slightly above 112qh1-\frac{1}{2q_{h}} then a negatively biased signal (α,β)[q,qh)×[1qh,1q)(\alpha^{\prime},\beta^{\prime})\in[q_{\ell},q_{h})\times[1-q_{h},1-q_{\ell}) is also not optimal.

  2. 2.

    Assume qh(23,22).q_{h}\in(\frac{2}{3},\frac{\sqrt{2}}{2}). The limit of the share of BB voters in state θB\theta_{B} when qq_{\ell} converges to qhq_{h} (see Table 1) for each of the other four signals is equal to:

    1. (a)

      Signal (q,0)(q_{\ell},0): The limit is equal to 1(1qh)(1(1λ)qh)qh1-\frac{\left(1-q_{h}\right)\left(1-(1-\lambda)q_{h}\right)}{q_{h}}, which is increasing in qhq_{h} and decreasing in λ\lambda. When substituting qh=23q_{h}=\frac{2}{3} and λ=1\lambda=1, the expression is equal 50%50\%, which implies that it is larger than 50%50\% for each qh>23q_{h}>\frac{2}{3} and each λ\lambda.

    2. (b)

      Signal (q,1q)(q_{\ell},1-q_{\ell}): The limit is equal to qh(1λ(1qh))q_{h}\left(1-\lambda(1-q_{h}\right)), which is increasing in qhq_{h} and decreasing in λ\lambda. When substituting qh=23q_{h}=\frac{2}{3} and λ=23\lambda=\frac{2}{3}, the expression is equal 1427>50%\frac{14}{27}>50\%, which implies that the limit is larger than 50%50\% for each qh>23q_{h}>\frac{2}{3} and each λ<23\lambda<\frac{2}{3}.

    3. (c)

      Signal (q,1qh)(q_{\ell},1-q_{h}): The limit is equal to qh>23q_{h}>\frac{2}{3}, which implies that the limit is larger than 50%50\% for each qh>23q_{h}>\frac{2}{3} and each λ\lambda.

    4. (d)

      Signal (qh,1q)(q_{h},1-q_{\ell}): The limit is equal to qh2q_{h}^{2}, which is smaller than 50%50\% for all values of λ\lambda because qh<22.q_{h}<\frac{\sqrt{2}}{2}.

    This implies that when qq_{\ell} is sufficiently close to qhq_{h} and λ(0.25,23)\lambda\in(0.25,\frac{2}{3}), then the unique optimal signal in the set of six signals of Lemma 1 is (qh,1q)(q_{h},1-q_{\ell}), which implies that all optimal signals are negatively biased due to Lemma 1. ∎

5 Extensions

5.1 Continuous Signal Accuracies

In this section we extend our model to a general distribution over signal accuracies (and not just binary). Specifically, we consider here a variant of our model in which the exogenous signal’s accuracy is continuous, and is distributed according to density ff with a support supp(f){\textrm{supp}}(f) in [0.5,1][0.5,1]. We note that the closely related extension of the model to a setup with a finite (but greater than 2) number of signal accuracies is analogous (and is omitted for brevity).

Our result here is an extension of Proposition 2 to this general setup, showing that the election is manipulable if all agents have accuracies of at most 23\frac{2}{3}, and that it is non-manipulable if all agents have accuracies of at least 22\frac{\sqrt{2}}{2}. Formally,

Proposition 4.
  1. 1.

    If supp(f)[22,1]{\textrm{supp}}(f)\subseteq\left[\frac{\sqrt{2}}{2},1\right], then the designer cannot manipulate the election.

  2. 2.

    If supp(f)[12,23]{\textrm{supp}}(f)\subseteq\left[\frac{1}{2},\frac{2}{3}\right], then the designer can manipulate the election.

Proof.
  1. 1.

    Corollary 1 implies that for each q>22q>\frac{\sqrt{2}}{2} all signals induce less than 50%50\% of agents with signal accuracy qq to vote for policy AA in state θB.\theta_{B}. This implies that when supp(f)[22,1]{\textrm{supp}}(f)\subseteq\left[\frac{\sqrt{2}}{2},1\right], a majority of the voters support policy BB in state θB\theta_{B} irrespective of the exact distribution of signal accuracies (i.e., the designer cannot manipulate the elections).

  2. 2.

    Let qh=supqQqq_{h}=\sup_{q\in Q}q. Observe (Table 1) that the designer’s signal (qh,0)\left(q_{h},0\right) induces a share of 2qh1qh\frac{2q_{h}-1}{q_{h}} of the agents to vote for BB in state θB\theta_{B} (for all values of qqhq\leq q_{h}), and that this share is smaller than 50%50\% iff qh23.q_{h}\leq\frac{2}{3}.

5.2 Targeted Information

In our main analysis, we required the designer to design one signal for all voters. What if the designer can differentiate between voters based on their signal accuracies, and can thus design different signals for different voters?

Suppose that the designer can distinguish between the two types of voters, qq_{\ell} and qhq_{h}. Furthermore, suppose she can commit to two different signals, shs_{h} and ss_{\ell}, where the former targets qhq_{h} voters and the latter targets qq_{\ell} voters. Observe first that Proposition 2 applies: if q<qh2/3q_{\ell}<q_{h}\leq 2/3 then the (qh,0)(q_{h},0) signal is optimal regardless of the type of voter, and so the designer can manipulate the election, whereas if qh>q>2/2q_{h}>q_{\ell}>\sqrt{2}/2 then the designer cannot manipulate the election. The proof is the same as that of the proposition.

However, targeted signals differ in the intermediate case. Note that for either i{,h}i\in\{\ell,h\}, the signal that leads to the maximal fraction of qiq_{i} voters to vote for AA is one of (qi,0)(q_{i},0) or (qi,1qi)(q_{i},1-q_{i}), by (the proof of) Lemma 1. Both signals lead to a majority of voters for AA in state θA\theta_{A}. In state θB\theta_{B}, however, (qi,0)(q_{i},0) leads to P[A|θB]=1qiqi\mathrm{P}\left[A|\theta_{B}\right]=\frac{1-q_{i}}{q_{i}}, whereas (qi,1qi)(q_{i},1-q_{i}) leads to P[A|θB]=1qi2\mathrm{P}\left[A|\theta_{B}\right]=1-q_{i}^{2} (see Table 1). For qi[1/2,512)q_{i}\in[1/2,\frac{\sqrt{5}-1}{2}) the former is larger, whereas for qi(512,1)q_{i}\in(\frac{\sqrt{5}-1}{2},1) the latter is larger. Overall, the designer can manipulate the election if and only if

λmax{1qq,1q2}+(1λ)max{1qhqh,1qh2}12.\lambda\cdot\max\left\{\frac{1-q_{\ell}}{q_{\ell}},1-q_{\ell}^{2}\right\}+(1-\lambda)\cdot\max\left\{\frac{1-q_{h}}{q_{h}},1-q_{h}^{2}\right\}\geq\frac{1}{2}.

Observe that, in contrast with Proposition 2, there is no non-monotonicity here: the left-hand-side of the inequality decreases with qq_{\ell} and with λ\lambda.

This last necessary and sufficient condition on the designer’s ability to manipulate the election extends in a straightforward manner to the variant with a continuous distribution of signal accuracies from Section 5.1 above. In this case, the designer can manipulate the election if and only if

1/21max{1qq,1q2}f(q)𝑑q12.\int_{1/2}^{1}\max\left\{\frac{1-q}{q},1-q^{2}\right\}\cdot f(q)dq\geq\frac{1}{2}.

5.3 Strongly Targeted Information

What if the designer has even more finely grained information about voters, such that she knows not only each voter’s signal accuracy but also the realization of this exogenous signal? In this case, the designer can provide a strongly targeted signal, in which voters with different signal accuracies and different realizations get different signals.

For a given signal accuracy qq, a voter with realization aa has interim belief qq about the probability the state is AA, whereas a voter with realization bb has interim belief 1q1-q about this probability. If the designer knows these realizations, she faces a standard Bayesian persuasion problem relative to each one of these kinds voters. In order to maximize the probability that such voters vote for AA, the designer should supply the former voter with no additional signal, and the latter voter with additional signal (q,0)(q,0). The latter signal here is the optimal signal from the standard Bayesian persuasion setting (Kamenica and Gentzkow, 2011), supplied to a voter who has belief 1q1-q and is will to vote for AA once the belief is above 1/21/2. Given these signals, the former voter will always vote for AA, whereas the latter will vote for AA with probability 1qq\frac{1-q}{q} in state θB\theta_{B}. In state θB\theta_{B}, the total fraction of voters with accuracy qq who vote for AA is thus

(1q)1+q1qq=2(1q).(1-q)\cdot 1+q\cdot\frac{1-q}{q}=2(1-q).

For a homogeneous population in which all agents have accuracy qq, the designer can manipulate the elections iff 2(1q)12q34.2(1-q)\geq\frac{1}{2}\Leftrightarrow q\leq\frac{3}{4}. When there are two signals accuracies, qq_{\ell} and qhq_{h}, the designer can then manipulate the election if and only if

2λ(1q)+2(1λ)(1qh)12.2\lambda\cdot(1-q_{\ell})+2(1-\lambda)\cdot(1-q_{h})\geq\frac{1}{2}.

When there is a continuous distribution of signal accuracies, as in Section 5.1 above, the designer can manipulate the election if and only if

21/21(1q)f(q)𝑑q12.2\int_{1/2}^{1}(1-q)f(q)dq\geq\frac{1}{2}.

5.4 Social Media vs. Traditional Media

Our analysis and results lead to a straightforward comparison of the effects of social media (through private persuasion) and traditional media (through public persuasion). For the latter, suppose that instead of each voter obtaining a conditionally independent realization of the designer’s signal, all voters obtain the same realization. Is such a public signal better or worse for the designer?

Observe that with a public signal, the designer can never manipulate the election with probability 1. However, she can always at least slightly increase the probability that voters vote for AA (with a positively biased signal as in Kamenica and Gentzkow, 2011). Thus, the answer to whether this is better than private persuasion depends on whether or not the designer can manipulate the election in the latter case. If she can, then private persuasion by social media is better. If she cannot, then public persuasion by traditional media is better.

6 Conclusion

In portraying private beliefs that contradict public information, Kuran (1997) describes a government monopoly on information under autocracy. Monopoly on information also arises under democracy when, because of network externalities, a social media platform caters to designated users seeking to maintain contact with one another. In this paper we showed that manipulation through personalized private information in social media can influence beliefs. This, in turn, may invalidate the conclusion of Condorcet’s jury theorem, a theorem that captures the benefits of majority voting. In particular, information manipulation through private persuasion can result in a majority voting for an information designer’s preferred policy rather than for a socially preferred alternative. This compromise of Condorcet’s jury theorem undermines the merits of democracy.

From the perspective of theory, we focused on the direct effect of informational persuasion on voting outcomes by dispensing with the assumption, prominent in the literature on information design, that voters regard themselves as possibly pivotal. Instead, we viewed voting as sincere, and accounted for the paradox of voting by assuming that voters derive direct utility from expressing themselves through voting. Our general model covers a range of circumstances that differ in the extent to which users are exogenously informed and in the amount of heterogeneity in the accuracy levels of users’ exogenous information. In all these circumstances we provided tight characterizations of when Condorcet’s jury theorem can be overturned.

Our analysis and results provide a comparison between information manipulation by private persuasion through social media and by public persuasion through traditional media. Under public persuasion, the designer can always slightly increase the probability that voters choose the designer’s preferred outcome, but can never determine the outcome with probability one. Under private persuasion, in contrast, our results show that the designer either completely determines the outcome, or has no effect at all, depending on the circumstances. In the former case, a designer with a political agenda would thus prefer control of social media to information manipulation through traditional media, whereas in the latter case, the designer’s preference would be reversed.

Appendix A Appendix: Proof of Lemma 1

Fix any optimal (α,β)(\alpha^{\prime},\beta^{\prime}), and note that, under this signal,

P[𝔞|θB]=12α+β12αβαβ=(α1)(2β1)αβ.\mathrm{P}\left[\mathfrak{a}|\theta_{B}\right]=1-\frac{2\alpha^{\prime}+\beta^{\prime}-1-2\alpha^{\prime}\beta^{\prime}}{\alpha^{\prime}-\beta^{\prime}}=\frac{(\alpha^{\prime}-1)(2\beta^{\prime}-1)}{\alpha^{\prime}-\beta^{\prime}}.

Observe that this probability is decreasing in α\alpha^{\prime} and β\beta^{\prime}, and so lowering either of these leads to a higher probability of realization 𝔞\mathfrak{a} in state θB\theta_{B}.

Suppose now that α{q,qh}\alpha^{\prime}\notin\{q_{\ell},q_{h}\}. First, observe that α\alpha^{\prime} cannot lie in the interval [1/2,q)[1/2,q_{\ell}). This is because, if it did, then when a voter obtains exogenous signal bb, neither the pair (b,𝔞)(b,\mathfrak{a}) nor the pair (b,𝔟)(b,\mathfrak{b}) will cause the voter to vote AA. This means that voters always vote BB on signal bb. However, in state θB\theta_{B} the signal bb is more likely than aa, and so a majority will always vote for BB in this state. But this implies that (α,β)(\alpha^{\prime},\beta^{\prime}) is not optimal, a contradiction.

Suppose next that α(q,qh)\alpha^{\prime}\in(q_{\ell},q_{h}). In this case, switching to signal (α,β)(\alpha,\beta^{\prime}), with α=q\alpha=q_{\ell} does not affect the behavior of any voter: Voters with signals (a,𝔟)(a,\mathfrak{b}) and (b,𝔟)(b,\mathfrak{b}) still make the same inferences, whereas voters with signals (a,𝔞)(a,\mathfrak{a}) still vote for AA, qq_{\ell} voters with signals (b,𝔞)(b,\mathfrak{a}) still vote for AA, and qhq_{h} voters with signals (b,𝔞)(b,\mathfrak{a}) still vote for BB. Similarly, if α(qh,1)\alpha^{\prime}\in(q_{h},1), then switching to signal (α,β)(\alpha,\beta^{\prime}), with α=qh\alpha=q_{h} does not affect the behavior of any voter. In all cases, however, lowering α\alpha^{\prime} to α\alpha increases the probability of signal 𝔞\mathfrak{a}, and hence a weakly greater fraction of voters votes for AA. This implies that (α,β)(\alpha,\beta^{\prime}) is optimal.

Finally, suppose β{0,1qh,1q}\beta^{\prime}\notin\{0,1-q_{h},1-q_{\ell}\}. If β(0,1qh)\beta^{\prime}\in(0,1-q_{h}) (resp., β(1qh,1q)\beta^{\prime}\in(1-q_{h},1-q_{\ell}) or β(1q,1)\beta^{\prime}\in(1-q_{\ell},1)) then lowering β\beta^{\prime} to β=0\beta=0 (resp., β=1qh\beta=1-q_{h} or β=1q\beta=1-q_{\ell}) does not affect the behavior of any voter. In all cases, however, lowering β\beta^{\prime} to β\beta increases the probability of signal 𝔞\mathfrak{a}, and hence a weakly larger share of voters votes for AA. This implies that (α,β)(\alpha,\beta) is optimal.

Appendix B Appendix: Binary Signals are Optimal

In this section we show that the restriction of the designer’s signal to a binary one is without loss of generality. Kamenica and Gentzkow (2011) show that, in the standard Bayesian persuasion setting with a single, uninformed receiver, it is without loss of generality to restrict the designer to a straightforward signal—one where each signal realization corresponds to a distinct action, these realizations are interpreted by the receiver as recommendations, and the receiver optimally follows the recommendation.

When there are different types of receivers (in our case, ones with different exogenous-signal accuracies) who have different information (in our case, different realizations of the exogenous signal), the argument of Kamenica and Gentzkow (2011) does not directly apply. This is because different receivers would optimally take different actions even given the same signal realization, and so these realizations cannot be interpreted as recommendations. For a simple example consider homogeneous voters with signal accuracy q(0.5,1)q\in(0.5,1), and where the designer’s signal is (0.5+ε,0.5ε)(0.5+\varepsilon,0.5-\varepsilon) for small ε>0\varepsilon>0. In this case each voter votes according to their own exogenous information, and not according to the sender’s “recommended” action 𝔞\mathfrak{a} or 𝔟\mathfrak{b}.

However, an extended argument does show that binary signals are sufficient. Consider the general model of Section 4.3. Then:

Lemma 2.

If there exists an optimal signal, then there exists an optimal binary signal.

Proof.

In our model there are four different types of voters, distinguished by their signal accuracies (qq_{\ell} or qhq_{h}) and the realization of their exogenous signal (aa or bb). We note that our argument works for any finite, arbitrarily large number of voters’ types.

Now, suppose there exists an optimal signal. We first argue that there also exists an optimal signal with a finite number of realizations. This follows from the argument of Kamenica and Gentzkow (2011), which implies that there exists an optimal signal in which there are at most 16 realizations, as follows: Each realization of the signal is a recommendation to vote either for AA or for BB for each of the four different types of voters. There are 242^{4} such four-tuples of recommendations, hence 16 signal realizations.

Next, let ss be an optimal designer signal with the minimal number of signal realizations, and suppose towards a contradiction that ss is not binary. Let n>2n>2 be the number of its signal realizations, and denote these realizations by supp(s)={r1,,rn}{\textrm{supp}}(s)=\{r_{1},\ldots,r_{n}\}. By Lemma 3 below, the signal ss is equal to a distribution over two signals, s1s_{1} and s2s_{2}, with the following four properties: (1) sηs1+(1η)s2s\equiv\eta s_{1}+(1-\eta)s_{2} with η(0,1)\eta\in(0,1), (2) |supp(s1)|,|supp(s2)|<n\left|{\textrm{supp}}(s_{1})\right|,\left|{\textrm{supp}}(s_{2})\right|<n, (3) |supp(s1)supp(s2)|1\left|{\textrm{supp}}(s_{1})\cap{\textrm{supp}}(s_{2})\right|\leq 1, and (4) if risupp(s1)supp(s2)r_{i}\in{\textrm{supp}}(s_{1})\cap{\textrm{supp}}(s_{2}) then P[θB|s1=ri]=P[θB|s2=ri]\mathrm{P}\left[\theta_{B}|s_{1}=r_{i}\right]=\mathrm{P}\left[\theta_{B}|s_{2}=r_{i}\right].

Now, ss is optimal if and only if the probability it induces a random voter to vote for AA in state θB\theta_{B} is at least 1/21/2. Since ss is a mixture of s1s_{1} and s2s_{2} (and the unique shared realization induces the same posterior), either s1s_{1} or s2s_{2} must also be optimal. For otherwise, if in state θB\theta_{B} a random voter has probability less than 1/21/2 of voting for AA under each of s1s_{1} and s2s_{2}, then this must also be the case under ss. However, s1s_{1} and s2s_{2} have fewer realizations than ss, contradicting the assumption that ss is an optimal signal with the minimal number of realizations. ∎

Lemma 3.

Fix a non-binary signal ss with n>2n>2 signal realizations, and denote those realizations by supp(s)={r1,,rn}{\textrm{supp}}(s)=\{r_{1},\ldots,r_{n}\}. Then there exist signals s1,s2s_{1},s_{2} with the following properties:

  1. 1.

    sηs1+(1η)s2s\equiv\eta s_{1}+(1-\eta)s_{2}, where η(0,1)\eta\in(0,1),

  2. 2.

    |supp(s1)|,|supp(s2)|<n.\left|{\textrm{supp}}(s_{1})\right|,\left|{\textrm{supp}}(s_{2})\right|<n.

  3. 3.

    |supp(s1)supp(s2)|1\left|{\textrm{supp}}(s_{1})\cap{\textrm{supp}}(s_{2})\right|\leq 1, and

  4. 4.

    if risupp(s1)supp(s2)r_{i}\in{\textrm{supp}}(s_{1})\cap{\textrm{supp}}(s_{2}) then P[θB|s1=ri]=P[θB|s2=ri]\mathrm{P}\left[\theta_{B}|s_{1}=r_{i}\right]=\mathrm{P}\left[\theta_{B}|s_{2}=r_{i}\right].

Proof.

Denote by (α1,,αn)(\alpha_{1},\ldots,\alpha_{n}) the posteriors induced by the nn signal realizations of ss on state θA\theta_{A}, starting with prior 1/21/2. This is simply the generalization of the (α,β)(\alpha,\beta) notation for binary signals to signals with more than two realizations. Suppose rir_{i} is the signal realization associated with posterior αi\alpha_{i}, and denote by pi=P[s=ri]p_{i}=\mathrm{P}\left[s=r_{i}\right] (the unconditional probability of this realization).

If signal ss is non-informative, then the result is immediate (as each sis_{i} can be a non-informative signal with a single realization). Otherwise, there must be at least one αi\alpha_{i} above 1/21/2 and at least one αj\alpha_{j} below 1/21/2. Without loss of generality, assume that α1>>αn\alpha_{1}>\ldots>\alpha_{n}, and note that α1>1/2\alpha_{1}>1/2 and αn<1/2\alpha_{n}<1/2.

Consider the binary signal s1=(α1,αn)s_{1}=(\alpha_{1},\alpha_{n}) with supp(s1)={r1,rn}{\textrm{supp}}(s_{1})=\{r_{1},r_{n}\}. For this signal, let

p𝔞=P[s1=r1]=12αnα1αn and p𝔟=P[s1=rn]=α112α1αn,p_{\mathfrak{a}}=\mathrm{P}\left[s_{1}=r_{1}\right]=\frac{\frac{1}{2}-\alpha_{n}}{\alpha_{1}-\alpha_{n}}~{}\mbox{ and }~{}p_{\mathfrak{b}}=\mathrm{P}\left[s_{1}=r_{n}\right]=\frac{\alpha_{1}-\frac{1}{2}}{\alpha_{1}-\alpha_{n}},

where the respective probabilities are computed as in Section 4.1.

We now consider three cases. First, if p𝔞p𝔟=p1pn\frac{p_{\mathfrak{a}}}{p_{\mathfrak{b}}}=\frac{p_{1}}{p_{n}}, then let η=p1+pn\eta=p_{1}+p_{n}, and let s2s_{2} be the signal whose realizations are {r2,,rn1}\{r_{2},\ldots,r_{n-1}\}, and where P[s2(θ)=ri]=P[s(θ)=ri]/(1η)\mathrm{P}\left[s_{2}(\theta)=r_{i}\right]=\mathrm{P}\left[s(\theta)=r_{i}\right]/(1-\eta) for each i{2,,n1}i\in\{2,\ldots,n-1\} and θ{θA,θB}\theta\in\{\theta_{A},\theta_{B}\}. Observe that s2s_{2} yields posterior beliefs (α2,,αn1)(\alpha_{2},\ldots,\alpha_{n-1}). It is straightforward to verify that these satisfy the claim of the lemma.

Second, suppose p𝔞p𝔟<p1pn\frac{p_{\mathfrak{a}}}{p_{\mathfrak{b}}}<\frac{p_{1}}{p_{n}}. In this case, let η=p𝔞p𝔟pn+pn\eta=\frac{p_{\mathfrak{a}}}{p_{\mathfrak{b}}}p_{n}+p_{n}, and let s2s_{2} be the signal whose realizations are {r1,r2,,rn1}\{r_{1},r_{2},\ldots,r_{n-1}\}, where P[s2(θ)=ri]=P[s(θ)=ri]/(1η)\mathrm{P}\left[s_{2}(\theta)=r_{i}\right]=\mathrm{P}\left[s(\theta)=r_{i}\right]/(1-\eta) for each for each i{2,,n1}i\in\{2,\ldots,n-1\} and θ{θA,θB}\theta\in\{\theta_{A},\theta_{B}\}, and where P[s2(θ)=r1]=(P[s(θ)=r1]ηP[s1(θ)=r1])/(1η)\mathrm{P}\left[s_{2}(\theta)=r_{1}\right]=\left(\mathrm{P}\left[s(\theta)=r_{1}\right]-\eta\mathrm{P}\left[s_{1}(\theta)=r_{1}\right]\right)/(1-\eta) for each θ{θA,θB}\theta\in\{\theta_{A},\theta_{B}\}. Observe that s2s_{2} yields posterior beliefs (α1,α2,,αn1)(\alpha_{1},\alpha_{2},\ldots,\alpha_{n-1}). Again, it is straightforward to verify that these satisfy the claim of the lemma. In particular, the only shared realization r1r_{1} induces the same posterior belief under both signals: P[θA|s1=r1]=P[θA|s2=r1]\mathrm{P}\left[\theta_{A}|s_{1}=r_{1}\right]=\mathrm{P}\left[\theta_{A}|s_{2}=r_{1}\right].

Finally, suppose p𝔞p𝔟>p1pn\frac{p_{\mathfrak{a}}}{p_{\mathfrak{b}}}>\frac{p_{1}}{p_{n}}. This case is analogous to the second case, except that η=p1+p𝔟p𝔞p1\eta=p_{1}+\frac{p_{\mathfrak{b}}}{p_{\mathfrak{a}}}p_{1}, rnr_{n} replaces r1r_{1} in supp(s2){\textrm{supp}}(s_{2}), the signal s2s_{2} yields beliefs (α2,,αn1,αn)(\alpha_{2},\ldots,\alpha_{n-1},\alpha_{n}), and s1s_{1} and s2s_{2} share the realization rnr_{n}. ∎

References

  • Acemoglu et al. (2011) Acemoglu, D., Dahleh, M. A., Lobel, I. and Ozdaglar, A. (2011). Bayesian learning in social networks. The Review of Economic Studies, 78 1201–1236.
  • Alonso and Câmara (2016) Alonso, R. and Câmara, O. (2016). Persuading voters. American Economic Review, 106 3590–3605.
  • Arieli and Babichenko (2019) Arieli, I. and Babichenko, Y. (2019). Private bayesian persuasion. Journal of Economic Theory, 182 185–217.
  • Arieli et al. (2020) Arieli, I., Babichenko, Y. and Smorodinsky, R. (2020). Identifiable information structures. Games and Economic Behavior, 120 16–27.
  • Arieli et al. (2021) Arieli, I., Gradwohl, R. and Smorodinsky, R. (2021). Herd design. Available at SSRN 3917729.
  • Austen-Smith and Banks (1996) Austen-Smith, D. and Banks, J. S. (1996). Information aggregation, rationality, and the condorcet jury theorem. American Political Science Review, 90 34–45.
  • Chan et al. (2019) Chan, J., Gupta, S., Li, F. and Wang, Y. (2019). Pivotal persuasion. Journal of Economic theory, 180 178–202.
  • De Condorcet (1785) De Condorcet, N. (1785). Essai sur l’Application de l’Analyse à la Probabilité des Décisions Rendues à la Pluralité des Voix. Paris. Reprinted by Cambridge University Press, 2014.
  • Denter et al. (2021) Denter, P., Dumav, M. and Ginzburg, B. (2021). Social connectivity, media bias, and correlation neglect. The Economic Journal, 131 2033–2057.
  • Downs (1957) Downs, A. (1957). An Economic Theory of Democracy. Harper & Row New York, NY.
  • Facebook (2022) Facebook (2022). Facebook News Feed: An introduction for content creators. https://www.facebook.com/business/learn/lessons/facebook-news-feed-creators. [Online; accessed 12-June-2022].
  • Feddersen and Pesendorfer (1997) Feddersen, T. and Pesendorfer, W. (1997). Voting behavior and information aggregation in elections with private information. Econometrica: Journal of the Econometric Society 1029–1058.
  • Feddersen and Pesendorfer (1998) Feddersen, T. and Pesendorfer, W. (1998). Convicting the innocent: The inferiority of unanimous jury verdicts under strategic voting. American Political science review, 92 23–35.
  • Gentzkow et al. (2015) Gentzkow, M., Shapiro, J. M. and Stone, D. F. (2015). Media bias in the marketplace: Theory. In Handbook of Media Economics, vol. 1. Elsevier, 623–645.
  • Gitmez and Molavi (2022) Gitmez, A. A. and Molavi, P. (2022). Polarization and media bias. arXiv preprint arXiv:2203.12698.
  • Grossman and Helpman (1999) Grossman, G. M. and Helpman, E. (1999). Competing for endorsements. American Economic Review, 89 501–524.
  • Grossman and Helpman (2001) Grossman, G. M. and Helpman, E. (2001). Special Interest Politics. MIT press.
  • Heese and Lauermann (2021) Heese, C. and Lauermann, S. (2021). Persuasion and information aggregation in elections. Tech. rep., ECONtribute Discussion Paper.
  • Hillman (2010) Hillman, A. L. (2010). Expressive behavior in economics and politics. European Journal of political economy, 26 403–418.
  • Hillman and Ursprung (1988) Hillman, A. L. and Ursprung, H. W. (1988). Domestic politics, foreign interests, and international trade policy. American Economic Review 729–745.
  • Hotelling (1929) Hotelling, H. (1929). Stability in competition. The Economic Journal, 39 41–57.
  • Kamenica (2019) Kamenica, E. (2019). Bayesian persuasion and information design. Annual Review of Economics, 11 249–272.
  • Kamenica and Gentzkow (2011) Kamenica, E. and Gentzkow, M. (2011). Bayesian persuasion. American Economic Review, 101 2590–2615.
  • Kerman et al. (2020) Kerman, T., Herings, P. J.-J. and Karos, D. (2020). Persuading strategic voters.
  • Koriyama and Szentes (2009) Koriyama, Y. and Szentes, B. (2009). A resurrection of the condorcet jury theorem. Theoretical Economics, 4 227–252.
  • Kuran (1997) Kuran, T. (1997). Private Truths, Public Lies: The Social Consequences of Preference Falsification. Harvard University Press.
  • Levy (2021) Levy, R. (2021). Social media, news consumption, and polarization: Evidence from a field experiment. American Economic Review, 111 831–70.
  • Lichter (2017) Lichter, S. R. (2017). Theories of media bias. In The Oxford Handbook of Political Communication. Oxford University Press New York, NY, 403–416.
  • Mukhopadhaya (2003) Mukhopadhaya, K. (2003). Jury size and the free rider problem. Journal of Law, Economics, and Organization, 19 24–44.
  • Pons and Tricaud (2018) Pons, V. and Tricaud, C. (2018). Expressive voting and its cost: Evidence from runoffs with two or three candidates. Econometrica, 86 1621–1649.
  • Prat (2002) Prat, A. (2002). Campaign spending with office-seeking politicians, rational voters, and multiple lobbies. Journal of Economic Theory, 103 162–189.
  • Puglisi and Snyder Jr (2015) Puglisi, R. and Snyder Jr, J. M. (2015). Empirical studies of media bias. In Handbook of media economics, vol. 1. Elsevier, 647–667.
  • Spenkuch (2018) Spenkuch, J. L. (2018). Expressive vs. strategic voters: An empirical assessment. Journal of Public Economics, 165 73–81.
  • Strömberg et al. (2015) Strömberg, D. et al. (2015). Media and politics. Annual Review of Economics, 7 173–205.
  • Sun et al. (2019) Sun, J., Schram, A. and Sloof, R. (2019). A theory on media bias and elections. Tech. rep., Tinbergen Institute Discussion Paper.
  • Taneva (2019) Taneva, I. (2019). Information design. American Economic Journal: Microeconomics, 11 151–85.
  • Twitter (2022a) Twitter (2022a). Help with locked or limited account. https://help.twitter.com/en/managing-your-account/locked-and-limited-accounts. [Online; accessed 12-June-2022].
  • Twitter (2022b) Twitter (2022b). Notices on Twitter and what they mean. https://help.twitter.com/en/rules-and-policies/notices-on-twitter. [Online; accessed 12-June-2022].
  • Wang (2013) Wang, Y. (2013). Bayesian persuasion with multiple receivers. Available at SSRN 2625399.