Jeanne Hagenbach
email: jeanne.hagenbach@polytechnique.edu

Frédéric Koessler
email: frederic.koessler@psemail.eu

Eduardo Perez-Richet
email: eduardo.perez@polytechnique.edu

Alfred Galichon

Johannes Horner

Navin Kartik

Yukio Koriyama

Rida Laraki

Ludovic Re- Nou

Francisco Ruiz-Aliseda

Larry Samuelson

Karl Schlag

Joel Sobel

Bruno Strulovici

Certifiable Pre-Play Communication: Full Disclosure *

Keywords: Strategic communication, hard information, information disclosure, masquerade relation, belief consistency, single crossing differences, deliberation, supermodular games. JEL classification: C72; D82

and research institutions in France or abroad, or from public or private research centers.

Introduction

Before most individual or collective decisions, concerned parties can communicate with each other and exchange information. The availability of communication may influence outcomes in important ways. This simple observation has given rise to a rich literature in game theory that aims at characterizing achievable equilibrium outcomes in strategic decision problems extended with communication (see, e.g., Myerson, 1994). In this paper, we adopt a different approach and try to understand when pre-play communication leads to full disclosure of privately held information, under the assumption that the players can make certifiable statements (i.e., the availability of messages depends on types). 1 We consider general Bayesian games augmented by a communication stage at which players can publicly disclose information about their type before choosing their actions in a second stage.

In order to enforce full disclosure, players must be able to coordinate on second stage actions that deter any unilateral attempt to conceal information at the communication stage.

To understand when this is possible, we define the masquerade relation, which is a simple description of the incentives of a player with given private information (or type) to pretend that her information is different (i.e., to masquerade as another type). This relation is easy to build. If, in the communication phase, each player fully reveals her type, the game played at the action stage is a complete information game that depends on the type profile. Hence, in a fully revealing equilibrium, each player expects to get the payoff associated with the equilibrium 2 of the complete information game that unfolds. If a player could convince all the others that her type is different from the truth, she might benefit by following up on her lie and bestresponding to the misguided equilibrium that the other players coordinate on. If she benefits from masquerading as a certain target type, we say that her true type wants to masquerade as the targeted type. The masquerade relation is best represented as a directed graph on the type set of a player, such that an arrow points from one type to another whenever the former wants to masquerade as the latter. This summary of a player's incentives suggests a natural way to deter obfuscation at the communication stage. To support a fully revealing equilibrium, we must ensure that, for any player and any possible message from this player, other players can attribute this message to a worst case type, that is, a type that none of the other types who could have possibly sent this message wants to masquerade as. This idea of assigning a worst case type to any message captures the idea of [START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF] that, in order to enforce full information revelation, the players should exercise skepticism. Thus, our analysis provides a simple operational definition of what it means to be skeptical: it consists in interpreting any message as coming from a minimal element of the masquerade relation. Whenever the masquerade relation is acyclic, these worst case types are sure to exist. The best-known examples of the literature have a monotonicity property that makes it easy to identify minimal elements, but our approach provides a systematic way of evaluating more general models.

Our first main result characterizes the necessary and sufficient conditions for the existence of a fully revealing sequential equilibrium [START_REF] Kreps | Sequential Equilibria[END_REF] when we restrict players to hold extremal beliefs off the equilibrium path, that is, beliefs that put probability 1 on a single type of a deviating player. 3 We say that the communication game admits an evidence base if every type of a player has access to a distinct message that certifies a set of types for which it is a worst case type. 4 We show that there exists a fully revealing sequential equilibrium with extremal beliefs if and only if the communication game admits an evidence base and every certifiable subset of types admits a worst case type.

Most of our results rely on this general characterization and on the following simple observation: the existence of a worst case type for every subset of types of a player is equivalent to the acyclicity of her masquerade relation, which, in turn, is equivalent to the existence of a function that weakly represents the masquerade relation of the player. 5 For the class of games satisfying this property, there exists a fully revealing equilibrium (with any beliefs off path) if and only if there exists an evidence base for each player. While apparently quite theoretical, this characterization is extremely useful to pin down sufficient conditions for the existence of a fully revealing equilibrium in large classes of games and economic applications. The first of these conditions is monotonicity. If the masquerading payoff of a player is increasing in the type she masquerades as, the acyclicity condition is clearly satisfied. This is the case in the seller-buyer models of [START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF] and [START_REF] Grossman | The Informational Role of Warranties and Private Disclosure about Product Quality[END_REF], where a seller always prefers to appear as having a higher quality product. Most of the literature has followed in these steps by relying on a monotonicity condition in more complicated games (see [START_REF] Okuno-Fujiwara | Strategic Information Revelation[END_REF][START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF][START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF]. A notable exception is [START_REF] Giovannoni | Secrecy, Two-Sided Bias and the Value of Evidence[END_REF], in which full revelation relies on a combination of two conditions6 : single-peakedness of the masquerading payoff in the target type, and (in our terminology) a no reciprocal masquerade condition ensuring that no two types want to masquerade as each other. We provide a simple and more general approach by showing that these two conditions prevent the existence of cycles in the masquerade relation.

In many interesting games and economic problems, the single-peakedness or the monotonicity conditions are not satisfied. For instance, they are not satisfied in coordination games in which each player wants to be close to her ideal action and to the actions of other players, in games of influence in which each player wants to convince all others to choose her own ideal action, or in voting games such as the jury model with a non-unanimous voting rule. We show that the acyclic masquerade property holds whenever the masquerading payoff has single crossing differences7 ; that is, if the return from masquerading as a higher type is positive for a given true type, then it is also positive for higher true types.

To illustrate our approach, we provide new applied results that contribute to different literatures. Our first application considers supermodular Bayesian games with complementarities between own actions and all types (as in [START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF]. We show that if the preferences of the players also exhibit complementarities in own type and the actions of other players, then the masquerading payoffs have increasing differences and there exists a fully revealing equilibrium.8 Our second application contributes to the literature on deliberation before voting9 by considering a general voting game that includes the jury model. This model can be applied to voting in a parliament, for example, and has both voters and experts that testify in front of the voters. The experts could have evidence about the virtues of a proposal, and the members of the parliament may have evidence about how it would affect their constituency, for example. The voters choose between two alternatives such that, for each player, the difference in payoff between the alternatives is non-decreasing in the types of all players. We show that the ex post masquerading payoffs satisfy increasing differences for each player under every non-unanimous voting rule, so that there is a fully revealing equilibrium of the voting game preceded by a debate. 10 The case of unanimity is even simpler since the masquerade relations of the voters then satisfy the monotonicity condition.

The sufficient conditions used above are especially suited for incomplete information games in which each player's type set is unidimensional. But the acyclic property and the weak representation of the masquerade relation can also be used to analyze information revelation in games with multidimensional types. In particular, we prove existence of a fully revealing equilibrium in lobbying or conformity games with multidimensional types and actions and in which the masquerade relation of a player can be written as the sum of two terms: a first one maximized when the sender masquerades as her true type; a second one proportional to a function of the type that she masquerades as. We also study sender-receiver games where the sender has a multidimensional and type-dependent bias. In such games, for every type of the sender, the bias vector points to the direction toward which this expert wants to masquerade as. We provide a sufficient condition on the bias function to induce acyclic masquerades. This includes cases in which the bias function is centrifugal (the sender wants to pretend she is further away from a central type than she really is) or mildly centripetal (the sender wants to pretend she is closer to a central type than she really is).

The Model

The Base Game. There is a set N = {1, . . . , n} of players who are to interact in a base game with action set

11 A = A 1 × • • • × A n .
Each player i is privately informed about her type t i ∈ T i , where T i is a finite set or a subset of R K , and

T = T 1 × • • • × T n is the set of type
profiles endowed with its natural topology. Let p(•) ∈ ∆(T ) be a full support common prior probability distribution over type profiles, and p(•|t i ) ∈ ∆(T -i ) the interim belief of player i when she is of type t i .12 The preferences of the players are given by von Neumann-Morgenstern utility functions u i : A × T → R.

Let Γ = N, T, A, p, (u i ) i∈N denote this Bayesian game. To every type profile t ∈ T , we can associate the complete information normal form game Γ(t) = N, A, (u i (•, t)) i∈N . To avoid introducing additional conditions on Γ(t), we make the following assumption throughout the paper:

Assumption 1. For every type profile t ∈ T , the best-reply correspondence of the game Γ(t) is well defined, and the set of Nash equilibria of Γ(t), denoted by NE(t) ⊆ A, is nonempty.

The Communication Phase. Before choosing their actions in A, but after learning their types, the players have the opportunity to publicly and simultaneously disclose hard evidence about their type at no cost. To formalize this, suppose that player i is restricted to send messages in a finite set

M i (t i ) if her type is t i . Let M i = t i ∈T i M i (t i ) be the set of possible messages of player i, and M = M 1 × • • • × M n the message space. Then a message m i ∈ M i provides evidence to other players that i's type is in M -1 i (m i ) := {t i ∈ T i : m i ∈ M i (t i )}. A subset S i of T i is certifiable if there exists a message m i ∈ M i such that M -1 i (m i ) = S i .
We assume that all certifiable sets are compact subsets of T i . The message structure satisfies own type certifiability, if for every player i, every singleton {t i } is certifiable.

Fully Revealing Equilibria Our equilibrium concept is the notion of sequential equilibrium of [START_REF] Kreps | Sequential Equilibria[END_REF]. It is defined as a profile of strategies and a belief system satisfying strong belief consistency and sequential rationality at every information set. A pair of a strategy profile and a belief system is strongly consistent if it can be obtained as the limit of a completely mixed strategy profile and of the corresponding belief system obtained by Bayesian updating. 13

In the rest of the paper, the term equilibrium refers to this definition. 14

We are interested in equilibria of the augmented game in which all players perfectly reveal their type in the communication phase-henceforth, fully revealing equilibria. In a fully revealing equilibrium, the second stage game on the equilibrium path corresponds to the complete information game Γ(t), and therefore the action profile played on the equilibrium path must be in NE(t). We choose a selection a * (t) from NE(t) and reformulate our objective as finding conditions under which there exists a fully revealing equilibrium of the augmented game such that a * (t) is played on the equilibrium path.

The Masquerade. As [START_REF] Seidmann | Strategic Information Transmission with Verifiable Messages[END_REF] already noticed in the sender-receiver case, the key to discouraging obfuscation is to attribute any message m i to a type s i in the set M -1 i (m i ) of its possible senders such that none of the other types in M -1 i (m i ) would like to masquerade as s i . This naturally leads us to investigate when a type t i would like to masquerade 13 The notion of strong belief consistency in [START_REF] Kreps | Sequential Equilibria[END_REF] is only defined for extensive form games with finite information sets; in general, it is hard to appropriately define sequential equilibria in infinite games (see [START_REF] Myerson | Sequential Equilibria of Multi-Stage Games with Infinite Sets of Types and Actions[END_REF]; hence, when the type sets are not finite, we simply adopt the same restrictions on beliefs as those imposed by strong consistency in the finite case (see Lemma 1).

14 In the web appendix, we also consider weak sequential equilibria in the sense of [START_REF] Myerson | Game Theory, Analysis of Conflict[END_REF] to obtain additional results. They are equilibria that satisfy sequential rationality and weak belief consistency, where weak consistency here means Bayesian consistency on the equilibrium path and off-path beliefs that are consistent with evidence. as another type s i . For this purpose, let

v i (t i |t i ) = E t -i u i a * (t), t | t i
denote the expected utility of player i on the equilibrium path of a fully revealing equilibrium if she is of type t i , and

v i (s i |t i ) = E t -i u i BR i (a * -i (s i , t -i ), t), a * -i (s i , t -i ), t | t i ,
the utility that she would obtain by masquerading as s i . In the remainder of the paper, the following notation for the utility in the expectation will be useful:

v i (s i |t i ; t -i ) = u i BR i (a * -i (s i , t -i ), t), a * -i (s i , t -i ), t .
We call v i (s i |t i ) and v i (s i |t i ; t -i ) the interim and ex post masquerading payoff functions. We will assume the following continuity property of v i (s i |t i ). This assumption is automatically satisfied when T i is finite. It is not innocuous, but often satisfied in commonly studied situations.

Together with the assumptions of compactness of the certifiable subsets made above, it allows us to extend the results that hold for finite type sets to infinite type sets. 15Assumption 2 (Semicontinuity). For every player i, the function

v i (s i |t i ) is lower semi- continuous in s i .
We can define a binary relation M -→ on T i , the masquerade relation, that summarizes the incentives of different types to masquerade as one another.

Definition 1 (Masquerade). We say that t i wants to masquerade as s i , denoted by

t i M -→ s i , whenever v i (s i |t i ) > v i (t i |t i ).
This relation is, by definition, irreflexive (t i M -→ s i ⇒ t i = s i ), but generally not transitive.

We can use this relation to define a worst case type for S i ⊆ T i as a type in S i that no other type in S i would like to masquerade as:

S ′ i wct(S ′ i ) S i wct(S i ) = ∅
wct(S i ) := s i ∈ S i | t i ∈ S i , t i M -→ s i .
This set may be empty, or have more than one element. It is useful to represent the masquerade relation by a directed graph on T i , as illustrated in Figure 1. A worst case type for S i is an element s i ∈ S i with no incoming arrow from other elements of S i .

Evidence Base. An evidence base is a set of messages that a player can use to certify each of her possible types.

Definition 2 (Evidence Base). An evidence base for player i is a set of messages E i ⊆ M i such that there exists a one-to-one function e i : T i → E i that satisfies e i (t i ) ∈ M i (t i ) and

t i ∈ wct M -1 i e i (t i ) for every t i .
Equivalently, an evidence base allocates to each type t i of player i a message e i (t i ) that certifies a set in which no type of player i would like to masquerade as t i , that is,

M -1 i (e i (t i )) ⊆ {s i ∈ T i : s i M -→ t i } for every t i ∈ T i .
Note that when own type certifiability holds, any collection of messages certifying the singletons {t i } for t i ∈ T i forms an evidence base, regardless of the masquerade relation. The set of evidence bases, however, depends on the masquerade relation.

For example, if T i can be linearly ordered such that the masquerade is monotonic (i.e., t i M -→ t i for every t i higher than t i ), as in [START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF] or [START_REF] Okuno-Fujiwara | Strategic Information Revelation[END_REF] The existence of an evidence base is important since it is necessary for a fully revealing equilibrium to exist. 17

Remark 1 (Evidence Base: Necessity). If there exists a fully revealing equilibrium, then there must exist an evidence base E i for every player i.

Indeed, consider a fully revealing equilibrium communication strategy profile σ that implements some Nash equilibrium a * (•) of the contingent complete information games. Then the sets of messages sent with positive probability by each type t i under σ i must be disjoint across types. Let σi (t i ) be a selection of one message in the support of σ i (t i ) for each t i , and suppose that t i / ∈ wct(M -1 i (σ i (t i ))). Then there exists a type t i = t i that wants to masquerade as t i and can send the message σi (t i ). Since σi (t i ) is not in the support of σ i (t i ), this contradicts the fact that σ is an equilibrium. Therefore, the selection σi (•) must form an evidence base for M i (•).

16 These examples also show that the existence of an evidence base is not related to the "nested range condition" [START_REF] Green | Partially Verifiable Information and Mechanism Design[END_REF] or the "minimal closure" / "normality" condition [START_REF] Forges | Communication Equilibria with Partially Verifiable Types[END_REF]Bull and Watson, 2007) used to get a revelation principle with hard evidence.

17 [START_REF] Mathis | Full Revelation of Information in Sender-Receiver Games of Persuasion[END_REF] made the same observation for a class of sender-receiver games.

3 Characterization of Fully Revealing Equilibria with

Extremal Beliefs

In this section, we provide necessary and sufficient conditions for the existence of a particular kind of fully revealing equilibrium in which every deviation is attributed to a single type of the deviator. The first part of the section defines these extremal beliefs equilibria, and discusses the consequences of the restrictions they place on equilibrium beliefs.

Extremal Beliefs. In order to support a fully revealing equilibrium, players must be able to punish any player i who sends an off the equilibrium path message m i . The other players have two levers to punish a deviator: (i) by forming appropriate beliefs about the type of the deviator subject to the restriction imposed by the hard information contained in m i ; (ii) by coordinating on appropriate sequentially rational actions in the second stage. In order to make things tractable, we make two restrictions off the equilibrium path: one on beliefs and one on actions.

First, we restrict off the equilibrium path beliefs after unilateral deviations to be extremal in the sense that they belong to the extreme points of the simplex ∆(T i ).

Definition 3 (Extremal Beliefs). A fully revealing equilibrium with extremal beliefs is a fully revealing equilibrium such that, after any unilateral deviation, each player's beliefs assign probability 1 to a single type of the deviator.

The second restriction concerns the second stage equilibrium actions that can be played off the equilibrium path. To understand this restriction, suppose that player i unilaterally deviates by sending an off the equilibrium path message m i , while every player j = i sends an equilibrium message that reveals her true type t j . Then, under extremal beliefs, all players must attribute a single type t i ∈ M -1 i (m i ) to player i. The extremal beliefs assumption does not require all players other than i to attribute the same type t i to player i, but we will show in the next paragraph that this is required by strong consistency. Consequently, all non-deviators put probability 1 on the type profile (t i , t -i ). Then, sequential rationality requires that non-deviators play according to some action profile in NE(t i , t -i ) but not necessarily a * (t i , t -i ). We will consider only equilibria in which they do play according to a * (t i , t -i ).

Definition 4. We say that an equilibrium implements a * (•) on and off the equilibrium path if, whenever the second stage beliefs of all non-deviating players put probability 1 on a particular type profile t, all the non-deviating players play according to a * (t).

Clearly, this restriction is without loss of generality when the complete information game Γ(t) has a unique equilibrium for every type profile t. It is also a natural assumption when there is a unique "reasonable" equilibrium of each Γ(t). For example, if we consider a voting game with two alternatives, the unique reasonable equilibrium is one in which all voters vote for their preferred alternative. It is important to keep in mind that this restriction and the restriction to extremal beliefs only make it harder to find existence results in the sense that there may be games for which fully revealing equilibria exist but can only be constructed by violating our restrictions. We use them because, under these restrictions, the existence of fully revealing equilibria can be simply characterized by properties of the masquerade relation.

Strong Consistency and Extremal Beliefs.

Strong consistency has important implications for the beliefs that can be held off the equilibrium path in fully revealing equilibria with extremal beliefs. We show that after any detectable unilateral deviation by player j sending message m j , the belief formed by other players about the type of player j depends only on m j .

In particular, all non-deviators form the same belief, independently of their type and of the messages sent by other non-deviators.

Lemma 1 (Consistent Extremal Beliefs). In a fully revealing equilibrium with extremal beliefs, after any unilateral deviation of some player j in the communication stage, the off-path beliefs of all players i = j assign probability 1 to the same type t j ∈ T j of player j independently of the message vector m -j and their own type t i .

Proof. See Appendix B.

This result is interesting and new (to the best of our knowledge), but quite technical. The intuition is that if the belief µ formed after a unilateral deviation is extremal, it puts probability 1 on a single type t j . For µ to be consistent, there must be a sequence of Bayes-consistent beliefs µ k that converges to µ and is generated by a sequence of completely mixed strategies of player j that put infinitely more weight on m j when she is of type t j than when she is of any other type t j . But if this is the case, the information contained in the strategy of player j crowds out any information about j contained in the prior, and, in particular, any information that the non-deviators could derive from the correlation between t j and their own type, or what they deduce on the types of other non-deviators from their messages.18

The Characterization. The existence of evidence bases for each player is necessary for the existence of a fully revealing equilibrium and it can be interpreted as a richness condition on the language saying that all private information can be credibly conveyed. Worst case types are important because they allow to discourage unilateral deviations to messages off the equilibrium path. In fact, Lemma 1 implies that, with extremal beliefs, the deviating message m j must be attributed to a single type t j ∈ M -1 j (m j ) that depends only on which message was sent. If this type is not a worst case type of M -1 j (m j ), then there must exist another type in M -1 j (m j ) that gets a higher payoff by sending m j than in a fully revealing equilibrium.

These two conditions are also sufficient, as we show in the following theorem. It is not difficult to construct a fully revealing equilibrium when they are satisfied: the messages from the evidence base should be used on the equilibrium path for the players to reveal their type, and detectable deviations should be attributed to worst case types. The difficulty of the proof is to

show that the equilibrium we just constructed satisfies the strong belief consistency requirement.

Theorem 1 (Characterization). There exists a fully revealing equilibrium with extremal beliefs that implements a * (•) on and off the equilibrium path if and only if the following conditions are satisfied for every i:

(i) For every m i ∈ M i , the set M -1 i (m i ) admits a worst case type.

(ii) The correspondence M i (•) admits an evidence base.

Proof. See Appendix B.

To conclude this section, we provide two examples. The first one illustrates Theorem 1 and shows how adding messages can destroy the existence of a fully revealing equilibrium with extremal beliefs.

Example 1. Consider a sender-receiver game in which the sender's type set is given by T = {t 1 , t 2 , t 3 , t 4 }; the masquerade relation and the certifiable subsets are given in Figure 2. By Theorem 1, there exists a fully revealing equilibrium with extremal beliefs. If we add a new message m 5 that certifies {t 2 , t 3 , t 4 }, this is no longer true.

t 1 t 2 t 4 t 3 m 2 m 3 m 4 m 1 Figure 2: An example
Our next example shows that the existence of worst case types is not necessary if interior beliefs are allowed off the equilibrium path.

Example 2 (Hidden Bias). Consider a sender-receiver problem in which the receiver can decide between two policies A and B, or keep the status quo φ. The sender can have information favorable to either of the policies A and B, and also has a bias which is unknown to the receiver. We denote the types of the sender by T = {aA, aB, bA, bB}, where type aB is biased toward A, and has receiver information favorable to B. We assume that all types are equally probable. The payoff matrix is given in the following table where the payoff of the sender appears first and the payoff of the receiver second.

A B φ aA 1, 1 -1, -1 s φ , r φ aB 1, -1 -1, 1 s φ , r φ bA -1, 1 1, -1 s φ , r φ bB -1, -1 1, 1 s φ , r φ
Table 1: Hidden bias -with s φ , r φ < 1.

The corresponding masquerade relation is represented in Figure 3. The sender can disclose her information A or B, or not disclose anything, so the certifiable sets are as represented on the figure. We assume that cheap talk is possible, which means that there are several messages that certify the same subset (at least as many as there are types in the corresponding certifiable subset). We denote a generic message that certifies the complete set as m 0 , and a generic message that certifies information favorable to policy X as m X . There exists an evidence base so full revelation is possible. Indeed, since cheap talk is allowed, there exist two messages m A and m A that certify A, and that can be used respectively by aA and bA since they are both worst case types of the set {aA, bA}, and the same is true for bB and aB with two messages m B and m B that certify B.

However, the type set, which is certifiable by m 0 , admits no worst case type, hence there is no fully revealing equilibrium with extremal beliefs. We will first show that a fully revealing equilibrium may nevertheless exist, depending on the values of s φ and r φ . Next, in case no fully revealing equilibrium exists, we will characterize the receiver's optimal partially revealing equilibrium.

Suppose that there exists a fully revealing equilibrium, and consider a message m 0 that certifies T . This message must be off the equilibrium path since it has no worst case type.

Also, it cannot be the case that the receiver responds to this message by mixing between A and B, for that would give a higher payoff than the full revelation payoff to either bA or aB.

So it must be the case that the receiver chooses the status quo φ to respond to this message.

There exists a belief that justifies the choice of the status quo by the receiver if and only if r φ ≥ 0. It must also be the case that the choice of the status quo induces the sender to choose to reveal the truth rather than sending a message that reveals nothing. This is true if and only if s φ < -1. In summary, a necessary condition for the existence of a fully revealing equilibrium is that the receiver prefers the status quo to choosing randomly between the two policies, and that the sender always prefers her least favored policy to the status quo. It is easy to show that this condition is also sufficient by fixing the belief that follows any message m 0 to the one that puts equal weight on A and B.

Now suppose that r φ < 0 or s φ > -1. Then either the receiver never chooses the status quo regardless of her information, or the status quo is not an effective punishment and does not induce revelation from aB and bA. Then the best achievable situation from the point of view of the receiver is to be able to identify the types aA and bB. This is done by following each message m 0 by a belief that puts the same probability on aB and on bA, and choosing the status quo if r φ ≥ 0 and any mixing between A and B otherwise.

Acyclic Masquerade

In this section, we define a class of games for which a worst case type exists for every subset of types. Therefore, the existence of fully revealing equilibria for this class of game is characterized by the existence of an evidence base for each player.

Definition and Characterization

We say that a game Γ with a selection a * (•) has the acyclic masquerade property if, for every player i, the masquerade relation on T i is acyclic. The following proposition characterizes acyclic masquerade relations. 19 Proposition 1. The following statements are equivalent:

(i) The masquerade relation of player i is acyclic.

(ii) Every finite subset S i ⊆ T i admits a worst case type.

(iii) There exists a lower semi-continuous function w i :

T i → R such that t i M -→ s i ⇒ w i (s i ) > w i (t i ). (

WR)

(iv) There exists a complete, transitive, and lower semi-continuous order on T i , such that

t i M -→ s i ⇒ s i t i . (DM)
Proof. See Appendix B.

In the proposition, (DM) stands for Directional Masquerade. It says that there is an order such that all types only want to masquerade as types that are their successors in this order.

(WR) stands for Weak Representation, a term borrowed from the literature on the representation of binary relations. Condition (ii) means that we can find a worst case type on every subset of T i in the finite case. In the infinite case, we would like to have a similar property.

Since the only subsets on which we need worst case types are the certifiable ones, which we restricted to be compact subsets, it is sufficient to show that we can find worst case types on every compact subset of T i . To see that, we just need to notice that the worst case types of 19 An order on T i is lower semi-continuous if, for every t i , the set

{s i ∈ T i | s i t i } is open. It is complete if, for
every s i and t i in T i , either s i t i or t i s i , and transitive if t i t i and t i t i implies that t i t i . a certifiable subset S i are exactly the minimizers of the weak representation w i (•), which exist since the function is lower semi-continuous.

Lemma 2. The acyclic masquerade property implies that, for every i, every compact subset S i of T i admits a worst case type.

From Lemma 2 and Theorem 1, we can immediately deduce that, in the class of games with the acyclic masquerade property, the existence of an evidence base for each player is a sufficient condition for the existence of a fully revealing equilibrium. From Remark 1, we know that it is also necessary.

Corollary 1. Suppose that the acyclic masquerade property is satisfied. Then there exists a fully revealing equilibrium that implements a * (•) if and only if there exists an evidence base for every player i.

We can directly apply Proposition 1 to the case in which the masquerading payoffs of informed players are independent of their type. For instance, this is true in the seller-buyer example of [START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF] and in the multidimensional cheap talk model of [START_REF] Chakraborty | Persuasion by Cheap Talk[END_REF]. In this case, we can represent the masquerade relation by the function w i (s i ) = v i (s i |t i ), which leads to the following remark.

Remark 2. Suppose that the interim masquerading payoff of each player is independent of her type. Then the acyclic masquerade property is satisfied.

We showed in Example 1 that adding messages could destroy full revelation. This is no longer true for games that satisfy the acyclic masquerade property. This is just because evidence bases are preserved under the addition of new messages, and the new certifiable subsets that are created must admit worst case types by the acyclic masquerade property.

Sufficient Conditions on Masquerading Payoffs

The following theorem provides a list of sufficient conditions for the masquerade relation to be Theorem 2 (Sufficient Conditions). The acyclic masquerade property is satisfied whenever, for every i, there exists a linear order on T i such that any of the following conditions is satisfied:

(MON) v i (s i |t i ) is non-decreasing in s i . (ID) v i (s i |t i ) has increasing differences in (s i , t i ).
(SCD) v i (s i |t i ) has single crossing differences in (s i , t i ).

(SP-NRM) v i (s i |t i ) is single-peaked in s i and satisfies the following no reciprocal masquerade condition:

v i (s i |t i ) > v i (t i |t i ) ⇒ v i (s i |s i ) ≥ v i (t i |s i ). Proof. See Appendix B.
Most of the literature on disclosure of hard information is based on (MON). When it is satisfied, every type would like to masquerade as the highest possible type. This is the case in the seller-buyer models of [START_REF] Grossman | The Informational Role of Warranties and Private Disclosure about Product Quality[END_REF] and [START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF]. The seller's payoff is increasing in the perceived quality of her product. Then the buyer can interpret every announcement of the seller skeptically as coming from the lowest quality seller consistent with the announcement. This skeptical behavior leads to full revelation. Another typical example mentioned in Okuno-Fujiwara et al. ( 1990) is a linear Cournot game with homogeneous goods and privately known marginal costs, in which the equilibrium payoff of a firm decreases when its competitors form higher beliefs about its cost.

The sender-receiver game of [START_REF] Crawford | Strategic Information Transmission[END_REF] does not satisfy the (MON) property, but it satisfies (DM) because the sign of the difference between the ideal actions of the sender and the receiver is independent of the sender's type. If the sender's ideal action is, say, always higher than the receiver's, the sender only wants to masquerade as a higher type. This does not mean, however, that she wants to masquerade as any higher type. In this case, it is easy to see that (DM) is satisfied for the natural order on types. In general, however, it may be difficult to find an order under which (DM) holds. 20 To our knowledge, this paper is the first to show that (SCD) and (ID) are sufficient conditions for the existence of fully revealing equilibria. When (ID) holds, the return of masquerading as a higher type increases with one's true type. When (SCD) holds, if the return of masquerading as a higher type is positive for t i , then it is also positive for t i t i . The condition (SP-NRM) is used in [START_REF] Giovannoni | Secrecy, Two-Sided Bias and the Value of Evidence[END_REF] to show the existence of a fully revealing equilibrium in a sender-receiver model. 21 To prove Theorem 2, we show that each condition implies that the masquerade relation is acyclic. It leaves the question of identifying the worst case types open. It is easy when (MON) or (DM) hold since, in any subset of types S i , the lowest type is a worst case type. In Appendix C, Proposition 6 shows how to find worst case types under (SCD) and (SP-NRM).

Ex Post Masquerade and Aggregation. In applications, it is often easier to work with the ex post masquerading payoffs. Then we can use aggregation results to show that the acyclic masquerade property is satisfied. In the following lemma, we recall some simple aggregation results that are useful for the applications. 22 Lemma 3 (Ex Post Sufficient Conditions). The acyclic masquerade property is satisfied whenever, for every i, there exists a linear order on T i such that any of the following conditions holds:

(i) v i (s i |t i ; t -i ) is non-decreasing in s i . (ii) v i (s i |t i ; t -i ) satisfies ex post directional masquerade: v i (s i |t i ; t -i ) > v i (t i |t i ; t -i ) ⇒ s i t i .
(iii) v i (s i |t i ; t -i ) has increasing differences in (s i , t i ) and types are independent.

20 In particular, the order on types for which (SCD) or (ID) holds may differ from the order induced by (DM).

21 In an earlier paper, [START_REF] Seidmann | Strategic Information Transmission with Verifiable Messages[END_REF] also considered sender-receiver games with a slightly different set of conditions. When the ideal action of the receiver is strictly increasing their existence result is also a direct corollary of Theorem 2 based on the (SP-NRM) condition.

22 For more advanced aggregation results, we refer the reader to [START_REF] Quah | Aggregating the Single Crossing Property[END_REF].

Proof. See Appendix B.

Ex post monotonicity and ex post directional masquerade respectively imply monotonicity and directional masquerade regardless of the information structure. The increasing differences property of the ex post masquerading payoffs can also be aggregated when types are independent. By contrast, the single-peakedness and single crossing properties are often difficult to aggregate. In the online appendix, we show that it is possible to avoid aggregation issues and work directly on the ex post masquerade relation to construct fully revealing weak sequential equilibria. 23 The advantage of weak sequential equilibrium is that it does not require beliefs off the equilibrium path to satisfy the no-conditioning property implied by Lemma 1. That is, for any unilateral and observable deviation of player i from full revelation, other players can attribute an ex post worst case type to the message of the deviator (i.e., a belief that is conditional on t -i ). An ex post worst case type exists whenever any of the sufficient conditions of Theorem 2 holds for the ex post masquerading payoffs instead of the interim masquerading payoffs.

Applications

In this section, we use our general results on the existence of a fully revealing equilibrium in a variety of economic applications. Some of the proofs rely on increasing differences of the ex post masquerading payoffs, so for these results we need to assume that types are independently distributed. As pointed out at the end of the last section, if we weaken the belief consistency requirement, then all our results hold regardless of the information structure (see the online appendix).

Supermodular Games

Suppose that each (T i , ) is a linearly ordered set, and each (A i , ) is a complete lattice. We say that the base Bayesian game is supermodular if each associated complete information game Γ(t) is a supermodular game in the sense of [START_REF] Milgrom | Rationalizability, learning, and equilibrium in games with strategic complementarities[END_REF] and [START_REF] Vives | Nash equilibrium with strategic complementarities[END_REF], and the utilities exhibit complementarities in types and own actions. The following definition recalls these assumptions, which are identical to those of Van Zandt and [START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF] in their study of Bayesian games of strategic complementarities.

Definition 5. We say that the (Bayesian) base game Γ = N, T, A, p, (u i ) i∈N is supermodular if each u i (a, t) is supermodular in a i , has increasing differences in (a i , a -i ) (strategic complementarities), and has increasing differences in (a i , t) (complementarities between own actions and type profiles).

It is well known24 that, in this case, NE(t) is a complete lattice, and that its extremal elements are non-decreasing in t. Let a * (•) be either the highest equilibrium selection or the lowest equilibrium selection. If we assume, as in Van Zandt and [START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF], that u i (a i , a -i , t)

is non-decreasing or non-increasing in a -i (positive or negative externalities), then it is immediate to show that the ex post masquerading payoffs are monotonic, and therefore the acyclic masquerade property is satisfied.

If, instead, we try to use single crossing differences, we can obtain a new result on supermodular games. To do so, we need to make additional regularity assumptions. Thus, in the remainder of this subsection, we assume that each A i is a finite product of closed intervals of the real line with the natural lattice order, and each T i is a subset of a real interval Θ i . We assume that the utility functions u i (•) are defined on A × Θ, where Θ = Θ 1 × • • • × Θ n , and that they are continuously differentiable. Finally, we assume that every equilibrium action a * i (t), and every best-response BR i a * -i (s i , t -i )|t i ; t -i is interior. Altogether, these assumptions ensure that the best-responses BR i a * -i (s i , t -i )|t i ; t -i always satisfy a first order condition, so that the derivatives of the ex post masquerading payoff v i (s i |t i ; t -i ) can be obtained by the envelope theorem.

Then, the only additional assumption needed to ensure that the ex post masquerading payoff has increasing differences is that the utilities of the players have increasing differences in their own type and the actions of the others.

Proposition 2 (Supermodular Games). Assume that the base game Γ is supermodular, that the utility functions are continuously differentiable on A × Θ, and that every best-response BR i a * -i (s i , t -i )|t i ; t -i is interior. Let a * (•) be either the highest equilibrium selection or the lowest equilibrium selection. Then, the acyclic masquerade property is satisfied whenever types are independent and u i (a i , a -i , t) has increasing differences in (a -i , t i ).

Proof. See Appendix B.

An immediate corollary of this result is obtained if we replace the condition in Proposition 2 by a separability condition between own type and others' actions.

Corollary 2. The acyclic masquerade property is satisfied whenever every best-response is interior and the following set of assumptions is satisfied:

(i) Types are independent.

(ii) For every i, there exist functions g ij (•) and h i (•) such that

u i (a i , a -i , t) = j∈N g ij (a j , t) + h i (a i , a -i , t -i ),
where h i (•) has increasing differences in (a i , a -i ), g ii (•) has increasing differences in (a i , t), and g ij (•), i = j, has increasing differences in (a j , t i ).

The two following examples are based on recent papers extending [START_REF] Crawford | Strategic Information Transmission[END_REF] to multi-player cheap-talk [START_REF] Hagenbach | Strategic Communication Networks[END_REF]Koessler, 2010, Galeotti et al., 2013). Using

Corollary 2, we show that these games satisfy the acyclic masquerade property under fairly general conditions.

Example 3 (A Coordination Game). Each player has an ideal action θ i (t) ∈ R, where A i = R, (T i , ) is a linearly ordered set, and θ i (•) is non-decreasing. Players also want to coordinate their own actions with those of other players. Their utilities are given by

u i (a, t) = -α ii a i -θ i (t) 2 - j =i α ij a i -a j 2 ,
where the α ij are nonnegative coefficients, normalized so that j α ij = 1, and such that α ii > 0. 25 It is easy to apply Corollary 2 to deduce that this game has a fully revealing equilibrium as long as types are independent and every player has an evidence base.

Example 4 (An Influence Game). [START_REF] Galeotti | Strategic Information Transmission Networks[END_REF] considered a game in which players try to influence others to play their favorite actions by selectively transmitting information.

We consider a more general payoff and information structure with the restriction that players communicate hard information. Each player i has an ideal action θ i (t) ∈ R. Her final payoff is given by -N j=1 α ij (a j -θ i (t)) 2 , with α ij ≥ 0; hence she would like all players to play as close as possible to her own ideal action. Again, if θ i (•) is non-decreasing, Corollary 2 applies.

In a simple version of the two previous examples where players' biases are constant (θ i (t) = θ(t)+b i ), players can be divided into two groups depending on whether their biases are relatively high or low compared to others' biases. 26 Intuitively, a player with a relatively low (high) bias would like to appear only as a lower (higher) type than she truly is. Therefore, when other players skeptically interpret any vague statement of a player as the highest (lowest) type, she has no interest to deviate from full revelation. In this case, the ex post directional masquerade condition of Lemma 3 is satisfied, so there is a fully revealing equilibrium whatever the prior distribution of types. There is an evidence base whenever each player whose bias is relatively low is able to certify a set of types in which her actual type is maximum, and each player whose bias is relatively high is able to certify a set of types in which her actual type is minimum. This intuitive evidence base is easy to exhibit here because the relative bias of a player is independent of her private information.

25 Particular forms of this class of games have been extensively studied in the economic theory of organizations as, for example, in [START_REF] Alonso | When Does Coordination Require Centralization?[END_REF][START_REF] Rantakari | Governing Adaptation[END_REF]

Deliberation with Hard Information

In this subsection, the base game is a voting game in which a proposal may be adopted to replace the status quo if it is supported by at least q members of the committee. The set of players is partitioned into the committee, C ⊆ N , whose members can cast a vote in the election, and other players who are inactive in the election but may disclose information in the communication phase. Let C be the size of the committee. Without loss of generality, we can normalize the utility each player derives from the status quo to 0, and we denote by u i the uncertain payoff she derives from the proposal. Each player i has a private signal t i about the proposal. We assume that the function U i (t) = E u i |t 1 , . . . , t n is non-decreasing in t. This is the case for example if every player believes the vector (u i , t 1 , . . . , t n ) to be affiliated.

The complete information voting game has multiple equilibria, but only one in weakly undominated strategies: the sincere voting equilibrium. We can use the tools developed in the rest of the paper to provide conditions under which there exists a fully revealing equilibrium that implements the sincere voting equilibrium. We interpret the pre-play communication game as deliberation with hard evidence. In the complete information voting game, the sincere bestresponse of i ∈ C is to vote in favor of the proposal whenever U i (t) > 0. The acceptance set of a player is the set of type profiles such that she favors the proposal,

A i = {t ∈ T | U i (t) > 0}.
Example 5 (The Jury Model). The question of voting with private information and deliberation is often studied within the framework of the jury model. This model is a particular case of our framework in which the status quo is to acquit and the proposal is to convict. There is a state of the world ω ∈ {I, G} (innocent or guilty) and the signals of the players are drawn independently according to a distribution q(t i |ω) that satisfies affiliation. The prior on ω is given by a probability π that the defendant is guilty. Each voter has a cost γ C i > 0 for unjustified conviction and γ A i > 0 for unjustified acquittal. Then, for this model, we have

U i (t) = γ A i π n i=1 q t i | G π n i=1 q t i | G + (1 -π) n i=1 q t i | I Pr(G|t) -γ C i (1 -π) n i=1 q t i | I π n i=1 q t i | G + (1 -π) n i=1 q t i | I Pr(I|t)
, which is indeed increasing by affiliation. Then the region A(i) of the type set T over which voter i favors conviction (the proposal) is characterized by

t ∈ A i ⇔ n i=1 q(t i |G) q(t i |I) ≥ (1 -π)γ C i πγ A i ,
where the expression on the left-hand side is non-decreasing in t by affiliation. Therefore, we can order the players according to

(1-π)γ C i πγ A i
, and the sets A i are non-decreasing in i in the set

containment order A 1 ⊆ A 2 ⊆ • • • ⊆ A n .
Hence the acceptance sets of the players are naturally nested.

Example 6 (Altruistic Voters). Suppose that the individual expected payoff of player i from the alternative is given by a non-decreasing function ψ i (t i ) that only depends on her type, but that she is altruistic either out of generosity, or because she internalizes the danger of a revolution if others are too unhappy. She then evaluates the expected value of the alternative according to the function

U i (t) = (1 -ε i )ψ i (t i ) + ε i E j =i ψ j (t j ) | t i ,
where ε i ∈ [0, 1]. This example also satisfies our assumptions, but in contrast to the jury model, the players' acceptance sets are typically not nested.

Consider now our general model of deliberation before voting, and any rule such that q ≤ C.

For committee members, ex post masquerading payoffs are given by

v i (s i |t i ; t -i ) = U i (t)1 U i (t)>0 1 S i (s i ,t -i )≥q-1 + U i (t)1 U i (t)<0 1 S i (s i ,t -i )≥q , where S i (s i , t -i ) = j∈C {i} 1 U j (s i ,t -i )>0
is the tally of votes in favor of the alternative among all voters except i. Under the unanimous rule such that q = C, these payoffs take the simpler form

of v i (s i |t i ; t -i ) = U i (t)1 U i (t)>0 1 S(s i ,t -i )≥C-1
, which is non-decreasing in s i . The monotonicity property is easy to understand under unanimity, as every voter is in one of two situations ex post. If, on the one hand, she wants to prevent the proposal from being adopted, then she can do so by voting against it, which makes deviation from full revelation pointless. If, on the other hand, she prefers the proposal, then she only wants to masquerade as a higher type so as to increase the number of votes in favor of the proposal. Every vague message coming from a voter can then be skeptically interpreted as coming from the type most favoring the status quo.

For general rules, however, voters' ex post masquerading payoffs are not monotonic. The next lemma shows that these payoffs have increasing differences in (s i , t i ). This is because masquerading as a higher type induces more agents to vote for the alternative which is more rewarding for a high true type than for a low one as U i (t) is non-decreasing in t. The same holds for agents who do not belong to the committee, and whose masquerading payoff are

v i (s i |t i ; t -i ) = U i (t)1 S(s i ,t -i )≥q . Lemma 4. For every i ∈ N , v i (s i |t i ; t -i ) has increasing differences in (s i , t i ). Under unanimity, v i (s i |t i , t -i ) is nondecreasing in s i for every i ∈ C.
Proof. See Appendix B.

Then we immediately have the following result.

Proposition 3. Under any voting rule, if types are independent and a * (•) is the sincere voting equilibrium, then the acyclic masquerade property is satisfied. If C = N and the rule is unanimity, then type independence is not needed.

While other results in the voting literature suggest that unanimity may perform less well than other voting rules in terms of information revelation,27 our results imply that with evidence, any voting rule can lead to full revelation. While we need independence in Proposition 3, this result can be extended to any distribution of types if we consider weak sequential equilibria as in the online appendix. [START_REF] Schulte | Information Aggregation and Preference Heterogeneity in Committees[END_REF] showed a similar result for the specific case of the jury model, and Mathis (2011) extended it to the case in which preferences lead to nested acceptance sets. We extend these results by showing that full revelation holds for all preferences that react to information in the same direction, even when acceptance sets are not nested.

When acceptance sets are nested, the identity of the pivotal voter in the full information voting game is independent of the realization of t: the pivotal voter i * is the one with the qth largest acceptance set among members of the committee. Clearly, i * has no incentive to masquerade as any other type regardless of her true type. Ex post, other players are either more opposed to the proposal or more in favor of the proposal than i * . A voter of the first kind only ever wants to masquerade as a lower type so as to undermine the proposal, whereas a voter of the second type only ever wants to masquerade as a higher type. Hence, skeptical beliefs for any message sent by a player of the first kind consist in interpreting her message as stemming from a type with the most favorable information for the proposal. Conversely, for players of the second kind, skepticism consists in believing the information most favorable to the status quo. So, with nested preferences, the ex post directional masquerade property of Lemma 3 holds. Furthermore, there is an evidence base for each player whenever the players who are more favorable to the proposal than the pivotal voter are able to provide any evidence in favor of it, and the others are able to provide any evidence against it.

Multidimensional Types

Norms, Lobbies, and Rewards for Masquerading. The Weak Representation approach can be fruitfully applied to show that communication games with multidimensional types satisfy the acyclic masquerade property. We start with an example inspired from the theory of conformity of [START_REF] Bernheim | A Theory of Conformity[END_REF]. In [START_REF] Bernheim | A Theory of Conformity[END_REF], an agent has a type in R and must perform an action in R. She wants her action to be as close as possible to her type, but she also wants other agents to believe that her type is close to a norm. In our version, the type is no longer one dimensional, and the agent sends hard information about her type instead of performing an action.

Example 7 (Conformity with Multiple Norms). We consider a sender-receiver model where T is the type set of the single sender. Here T can be any metric space, but for simplicity let

T ⊆ R K .
There is a single receiver who takes action, but potentially many other agents who do not take action but form beliefs about the type of the sender. We assume that the optimal action of the receiver if she knows t is a(t) = t. As in [START_REF] Bernheim | A Theory of Conformity[END_REF], the payoff of the sender has two components. On the one hand, she would like the receiver to implement the optimal action a(t). On the other hand, she would like to conform to one of several prevailing stereotypes in society. To model that second part, suppose that upon convincing other agents that she is of type s, the sender derives a payoff proportional to -d(s, C), where C ⊆ R K is a finite set of social stereotypes, and d(s, C) = min c∈C d(s, c) is the Euclidean distance to that set. Alternatively, the elements of C can be interpreted as the positions of lobbies that reward experts for producing information close to their positions. So the masquerading payoff of the sender can be written as

v(s|t) = -d(s, t) -λ(t)d(s, C),
where λ(t) > 0. The term λ(t) captures the weight that the sender puts on the different components of the masquerading payoff, and it can vary across types. It is easy to show that the masquerade relation generated by these payoffs satisfies (WR). Indeed, we have

v(s|t) > v(t|t) ⇔ λ(t) d(t, C) -d(s, C) > d(s, t) ⇒ -d(s, C) > -d(t, C),
so we can use -d(•, C) as a weak representation of the masquerade relation. Hence, there is an evidence base whenever each type is able to certify that she is at least as close to the set of social stereotypes as she actually is. In that case, there exists a fully revealing equilibrium in which any message is skeptically interpreted as stemming from a sender who is at the maximum distance (consistent with the evidence contained in the message) from the set of social stereotypes.

The interpretation is interesting, as it implies that communication with evidence coupled with skepticism on the side of the receiver mutes the effect of social stereotypes.

In fact, the logic of this example can be generalized to any masquerading payoff that is the sum of three terms, where one term is maximized when the sender masquerades as her true type, the second term is proportional to a function of the type that she masquerades as, and the third term depends on the true type only. 28Proposition 4. Suppose that v(s|t) = f (s, t) + λ(t)g(s) + h(t), where f (•, t) admits a unique maximum f (t, t), and λ(t) > 0. Then the masquerade relation associated to this masquerading payoff is acyclic.

Proof. See Appendix B.

Biases.

A more common approach is to think of experts as being biased. For that part, we assume that T ⊆ R K . We assume that the masquerading payoff function takes the form

v(s|t) = -s -t -b(t) Ω s -t -b(t)
, where b : T → R K is a bias function, and Ω is a symmetric positive semi-definite matrix. For example, if Ω is the identity matrix, then the masquerading payoff is -||s -t -b(t)|| 2 . A nice way to think of the bias function is to visualize it as a vector field on R K such that, at each point t, the vector b(t) points to the direction toward which t would like to masquerade. In fact, if t + b(t) is in T , it is exactly the type that t would prefer to masquerade as. We provide conditions on the bias function b(•) that ensure acyclicity of the masquerade relation. One of the conditions is that the vector field b(t) (or a straightforward transformation of it) can be obtained as the gradient of a potential function φ(t).29 This condition is never sufficient and needs to be completed by an assumption on φ(•), which can be interpreted as φ(•) not being too concave.

The reason why the potential from which b(•) derives should not be too concave can be easily understood in a one dimensional example. For this, consider Figure 4. In Figure 4 (a), b(•) derives from a convex potential, and as a consequence the vector field is centrifugal. Then it is easy to be skeptical about any message: a worst case type for every compact subset S of R is the point of S which is closest to the set of minimizers of φ(•). In Figure 4, (b) and (c), the biases derive from a concave potential, and as a consequence the vector field is centripetal. Let t * be the maximizer of the potential φ(•). Intuitively, centripetal biases may be problematic because the types to the right of t * may want to pretend that they are to the left of t * and vice versa, creating cycles in the masquerade relation, as in Figure 4 (c). If the intensity of biases tends to vanish for types close to t * , however, these cycles will not be created. This is the case when the potential function is not too concave, as in Figure 4 (b). The following proposition shows that the same intuitions hold in the multidimensional case.

Proposition 5. Suppose that b(t) is continuously differentiable and satisfies, for every t, Db(t) + I ≥ 0, where Db(t) is the Jacobian of b(t), and ≥ is in the sense of positive semidefinite matrices. Suppose, in addition, that there exists a function φ : R K → R such that for every t ∈ , Ωb(t) = ∇φ(t). Then the masquerade relation is acyclic.

Proof. See Appendix B.

Remark 3. The sense in which the result requires the potential φ(•) to be not too concave is the following: the Hessian of φ(•) is given by ΩDb(t), and we have Ω(Db(t) + I) ≥ 0 because Ω and Db(t) + I are both positive semi definite. But Ω(Db(t) + I) is the Hessian of the function

ψ(t) = φ(t) + 1 2 t
Ωt, which must therefore be convex. So φ(•) is not too concave in the sense that it must become convex when summed with the convex function 1 2 t Ωt.

To illustrate Proposition 5, consider the easy case in which Ω = I and b(t) is the gradient of the concave function -1 2 ||t|| 2 . Then Db(t) = -I and the conditions of the proposition hold. In this case, the bias vector field b(t) is centripetal, with all the biases directed toward 0.

Another example is if b(t) is the gradient of the function φ(t) = 1 2 (α 1 t 2 1 -α 2 t 2
2 ), where t ∈ R 2 , α 1 , α 2 ∈ R + , and t 1 and t 2 are the two dimensions of the type. Hence b

(t) = α 1 t 1 , -α 2 t 2 .
Then, φ(t) has a saddle-point at 0 and the bias vector field b(t) is centrifugal on the first dimension and centripetal on the second dimension, as illustrated in Figure 5. In this case, we have Db(t) = α 1 0 0 -α 2 , so Db(t) + I = 1+α 1 0 0 1-α 2 , and the conditions of the proposition are satisfied whenever α 2 ≤ 1.

φ(t) b(t) T (a) φ(t) b(t) T (b) φ(t) b(t) T (c) φ(t) b(t) T (d)
(t) = 1 2 (α 1 t 2 1 -α 2 t 2 2 ).

Appendix A Definitions

For clarity, we provide the precise definitions of several known concepts that play a role throughout the paper. To formulate these definitions, consider two partially ordered sets (X, ) and (Y, ). 30

Definition 6 (Single-Peakedness). Suppose that X is linearly ordered. A function f :

X → R is single-peaked if f (x ) > f (x) implies f (x ) > f (x)
for every x strictly between x and x .

For the next three definitions, we adopt the terminology of Milgrom (2004).

Definition 7 (Single Crossing). A function f : X → R is single crossing if for every x x ,

f (x) ≥ (>) 0 ⇒ f (x ) ≥ (>)0
Definition 8 (Increasing Differences). A function g : X × Y → R has increasing differences if, for every x x and y y , we have g(x , y) -g(x, y) ≤ g(x , y ) -g(x, y ), 30 When there is no risk of confusion, we use the same notation for orderings defined on different sets.

that is, if, for every x x , the difference function ∆(y) = g(x , y) -g(x, y) is non-decreasing.

Definition 9 (Single Crossing Differences). A function g : X × Y → R has single crossing differences in (x, y) if, for every x x , the difference function ∆(y) = g(x , y) -g(x, y) is single crossing.

Note that while the definition of increasing differences is symmetric, this is not the case for the definition of single crossing differences.

B Proofs

Proof of Lemma 1 (Consistent Extremal Beliefs). Let σ be a fully revealing communication strategy profile. Then each σ i :

T i → ∆(M i ) is
µ k i (t -i | m, t i ) = σ k -i (m -i |t -i )p(t -i |t i ) s -i∈T -i σ k -i (m -i |s -i )p(s -i |t i ) , (1)
where

σ k -i (m -i |t -i ) = j =i σ k j (m j |t j ).
Consider an off the equilibrium path message profile m that follows a unilateral deviation by player j. Then m j / ∈ ∪ t j ∈T j supp σ j (t j ) , whereas the message of each player i = j is such that m i ∈ supp σ i (t i ) for some t i .

The strong belief consistency requirement implies that, for some sequence σ k as the one defined above, the associated beliefs µ k converge to µ. Suppose that i is not the deviator, so that i = j. The extremal belief assumption implies that µ i (t -i | m, t i ) = 1 for some t -i . But then, because the prior has full support, we deduce from (1) that, for every s

-i = t -i , lim k→∞ σ k -i (m -i |s -i ) σ k -i (m -i |t -i ) = 0. (2)
Now consider the type profile s -i = (s j , t -ij ), where s j = t j . By (2), we must have

lim k→∞ σ k j (m j |s j ) σ k j (m j |t j ) = 0.
Note that the expression in the limit does not depend on i or on the messages of players other than j. But then it implies that all non-deviators attribute the off the equilibrium path message m j to the same type t j , regardless of the messages sent by m -j sent by players other than j and regardless of their own type.

Proof of Theorem 1. First we show necessity. By Remark 1, the existence of a fully revealing equilibrium implies (ii). To show that it implies (i), suppose that (i) does not hold. Then there exists a message m i ∈ M i such that wct M -1 i (m i ) = ∅. When receiving message m i from i, the other players with extremal beliefs must assign it to some type in M -1 i (m i ), say s i . But since wct M -1 i (m i ) = ∅, there exists a type t i ∈ M -1 i (m i ) such that t i M -→ s i . Then player i would deviate from the equilibrium path by sending m i when she is of type t i , since that allows her to masquerade as s i .

Next, we show that (i) and (ii) together imply existence of a fully revealing equilibrium with extremal beliefs. By (ii), there exists an evidence base E i for M i (•). Let e i : T i → E i be the associated one-to-one mapping such that t i ∈ wct M -1 i (e i (t i )) . Then we contend that, if (i) holds, there exists a fully revealing equilibrium with extremal beliefs in which the communication strategy of player i is a pure strategy given by the mapping e i (•). To show that, we now construct extremal beliefs that support this equilibrium. Consider a unilateral deviation of player i of type t i who plays a message m i instead of e i (t i ). If m i / ∈ E i , then the deviation is detected, and can be prevented by the belief that the type of player i is some

s i ∈ wct M -1 i (m i ) . Now suppose that m i ∈ E i .
Then the deviation cannot be detected by the other players. But then it must be the case that m i = e i (s i ) for some s i = t i . And the belief associated to m i is therefore the "on the equilibrium path" belief that i is of type s i . Then, by construction of e i (•), we have s i ∈ wct M -1 i (m i ) , which means that such a deviation cannot be beneficial for i.

To finish the proof, we show that the equilibrium we have constructed satisfies strong consistency of beliefs. The equilibrium strategy is given by the profile e = e 1 , . . . , e n . Let

t * i (m i ) ∈ M -1
i (m i ) be the equilibrium belief associated to any message m i / ∈ E i . Then

t * i (m i ) ∈ wct M -1 i (m i ) . Let N (t i ) be the number of messages m i ∈ M i (t i ) \ E i such that t i = t * i (m i ).
Let σ k be a sequence of completely mixed communication strategy profiles such that

σ k (•|t i ) puts probability 1-N (t i ) k -|M i (t i )|-N (t i )-1 k 2
on the message e i (t i ), probability 1/k on every message

m i ∈ M i (t i )\E i , such that t * i (m i ) = t i ,
and probability 1/k 2 on every remaining message. Hence type t i puts more weight on messages for which she is a worst case type (1/k) than on other messages she could send (1/k 2 ). It is then easy to see that σ k converges to e as k → ∞.

Now consider the belief µ k i associated to the completely mixed strategy profile σ k for each player i. To check consistency, we need to check that the beliefs µ k i converge to the equilibrium beliefs at two kinds of information set.

First consider an information set on the equilibrium path. That is, all the players have observed a message profile m such that m i ∈ E i for every i. Then

µ k i (t -i |m, t i ) = σ k -i (m -i |t -i )p(t -i |t i ) s -i∈T -i σ k -i (m -i |s -i )p(s -i |t i ) , (3)
where

σ k -i (m -i |t -i ) = j =i σ k j (m j |t j ),
converges to 1 if m j = e j (t j ) for every j = i and to 0 otherwise. Hence, in the limit, µ k i (t -i |m, t i ) puts probability 1 on the vector e -1 (m -i ), which is indeed the belief that i forms about the other players on the equilibrium path.

Next consider an information set that follows a detectable unilateral deviation. That is, all the players but j have sent a message profile m -j ∈ E -j , whereas j has sent a message m j / ∈ E j .

Then the belief formed by j about other players can be analyzed as we just did and satisfies strong consistency. We need to show that this is true for other players as well, so consider a player i = j. Her belief about other players is still given by (3). But now we have the following:

σ k -i (m -i |t -i ) =            O(1/k), if m = e(t ) for every / ∈ {i, j} and t * j (m j ) = t j O(1/k 2 ), if m = e(t ) for every / ∈ {i, j} and t * j (m j ) = t j O(1/k 2 ), otherwise.
In the last case, the k 2 comes from the fact that at least one player other than i and j has used a non-detectable deviation (probability 1/k), and j has used a message which she sends with probability lower than 1/k. Therefore, µ k i (t -i |m, t i ) must converge to a belief that puts probability 1 on the unique profile t -i that satisfies t = e -1 (m ) for / ∈ {i, j}, and t j = t * j (m j ).

This is exactly the belief we used to construct our equilibrium, and this concludes the proof.

Proof of Proposition 1. Suppose that

M -→ has a cycle t 1 i M -→ • • • M -→ t k i M -→ t 1 i on T i . Then S i = t 1 i , . . . t k i
does not have a worst case type. Now suppose that there exists S i ⊆ T i such that wct(S i ) = ∅. Let s 1 i ∈ S i . Because wct(S i ) = ∅ there exists s 2 i ∈ S i such that s 2 i M -→ s 1 i , but there also exists

s 3 i ∈ S i such that s 3 i M -→ s 2 i . If s 3 i = s 1 i ,
we have a cycle and we can conclude.

Otherwise, we can keep doing this until we obtain a cycle. This must happen eventually since S i is finite. This shows the equivalence of (i) and (ii).

The equivalence between (i) and (iii) derives from [START_REF] Alcantud | Characterization of the Existence of Semicontinuous Weak Utilities[END_REF], and the lower semi-continuity assumption on v i (s i |t i ). The function w i induces a complete, transitive, and lower semi-continuous order on T i defined by

s i t i ⇔ w i (s i ) ≥ w i (t i ),
-→ t 2 i M -→ t 1 i .
To fix ideas, suppose that t 1 i t 2 i (we can do this because T i is linearly ordered). Then we have a contradiction with (SCD):

v t 2 i |t 1 i -v t 1 i |t 1 i > 0 > v t 2 i |t 2 i -v t 1 i |t 2 i ,
where the two inequalities come from the masquerade relation. Now suppose that there exists

a longer cycle t 1 i M -→ • • • M -→ t k i M -→ t 1 i .
Because T i is linearly ordered, the set {t 1 i , . . . , t k i } admits a minimal element with respect to . To fix ideas, let t 1 i be that minimal element. Then we

have v t 2 i |t 1 i -v t 1 i |t 1 i > 0 and v t 1 i |t k i -v t k i |t k i > 0 from the fact that t 1 i M -→ t 2 i and t k i M -→ t 1 i .
Since t 1 i is a minimal element in {t 1 i , . . . , t k i }, we have t 1 i ≺ t k i , and applying (SCD) to the first of these two inequalities yields v t

2 i |t k i -v t 1 i |t k i > 0. Hence, we have v t 2 i |t k i -v t k i |t k i = v t 2 i |t k i -v t 1 i |t k i + v t 1 i |t k i -v t k i |t k i > 0.
This inequality implies that t

2 i M -→ • • • M -→ t k i M -→ t 2
i forms a cycle of length k -1. By doing this over and over, we end up with a 2-cycle, which we already ruled out. To conclude, we have shown that M -→ is acyclic.

For (SP-NRM), note that the no reciprocal masquerade condition means that

M -→ has no 2-cycle. Let t 1 i M -→ • • • M -→ t k i M -→ t 1
i denote a longer cycle, k ≥ 3. We adopt the notation that

t k+1 i = t 1 i .
It must be the case that there exists / ∈ {j, j + 1} such that t

j i ≺ t i ≺ t j+1 i or t j+1 i ≺ t i ≺ t j i . Indeed, otherwise we would have t 1 i ≺ t 2 i ≺ • • • ≺ t k i ≺ t 1 i , a contradiction since is a linear order on T i . Therefore, by single-peakedness, v i (t j+1 i |t j i ) > v i (t j i |t j i ) implies that v i (t i |t j i ) > v i (t j i |t j i ), that is, t j i M -→ t i .
Hence there exists a cycle without t j+1 i ,

t j i M -→ t i M -→ t +1 i M -→ • • • M -→ t j-1 i M -→ t j i , of length k < k.
|t i ) ≤ v i (t i |t i ). Therefore, if v i (s i |t i ) > v i (t i |t i
), it must be the case that s i t i , which means that (DM) is satisfied.

(iii) Let ∆(t i ; t -i ) = v i (s i |t i ; t -i ) -v i (s i |t i ; t -i ), for s i s i . Then ∆(•) is non-decreasing in t i . But then ∆(t i ) = E ∆(t i ; t -i )|t i = E ∆(t i ; t -i )
by independence, and it is a non-decreasing function of t i . Therefore, v i (s i |t i ) satisfies (ID).

Proof of Proposition 2. To avoid cumbersome notations, we write the proof in the case where each action set A i is one dimensional. The generalization to higher dimensions is straightforward but heavy. With our assumptions, we can define the function v

i (s i |t i ; t -i ) on Θ i × Θ i × Θ -i ,
and it is continuously differentiable. We show that this function has increasing differences in

(s i , t i ). It is well known that this is the case if ∂ 2 v i (s i |t i , t -i )/∂s i ∂t i ≥ 0.
The assumptions we made ensure that every best-response satisfies the following first order condition

∂ ∂a i u i BR i (a * -i (s i , t -i ), t), a * -i (s i , t -i ), t = 0. (FOC)
Using the chain rule and (FOC) a first time, we have

∂ ∂s i v i (s i |t i ; t -i ) = j =i ∂ ∂a j u i BR i (a * -i (s i , t -i ), t), a * -i (s i , t -i ), t ∂ ∂s i a * j (s i , t -i ),
and a second time,

∂ 2 ∂s i ∂t i v i (s i |t i ; t -i ) = j =i
∂ 2 ∂a j ∂t i u i BR i (a * -i (s i , t -i ), t), a * -i (s i , t -i ), t ∂ ∂s i a * j (s i , t -i ).

The first term under the summation is nonnegative because u i (a i , a -i , t) has increasing differences in (a -i , t i ); the second term is also nonnegative since the supermodularity of the base game implies that a * (•) is non-decreasing.

Proof of Lemma 4. For any i ∈ C and t i t i , the difference

v i (s i |t i ; t -i ) -v i (s i |t i ; t -i ) = U i (t i , t -i )1 U i (t i ,t -i )>0 -U i (t i , t -i )1 U i (t i ,t -i )>0
≥0 1 S i (s i ,t -i )≥q-1

+ U i (t i , t -i )1 U i (t i ,t -i )<0 -U i (t i , t -i )1 U i (t i ,t -i )<0 ≥0 1 S i (s i ,t -i )≥q
is non-decreasing in s i since S i (s i , t -i ) is non-decreasing in s i . For every i ∈ N \C and every

t i t i , the difference v i (s i |t i ; t -i ) -v i (s i |t i ; t -i ) = U i (t i , t -i ) -U i (t i , t -i ) ≥0
1 S i (s i ,t -i )≥q is nondecreasing in s i . Finally, under unanimity, the ex post masquerading payoff of a player i ∈ C is v i (s i |t i ; t -i ) = U i (t)1 U i (t)>0 1 S(s i ,t -i )≥C-1 , which is nondecreasing in s i .

Proof of Proposition 4. We have, for any s = t, v(s|t) > v(t|t) ⇔ g(s) -g(t) > 1 λ(t) f (t, t)f (s, t) ⇒ g(s) > g(t), where the last implication follows from the fact that λ(t) > 0 and f (t, t) > f (s, t). Therefore, the function g(•) is a weak representation for the masquerade relation.

Proof of Proposition 5. We define the function ψ(t) = φ(t) + 1 2 t Ωt. The function ψ(•) must be convex, since Db(t) + I ≥ 0 implies that the Hessian of ψ(•) satisfies D 2 ψ = Ω (Db(t) + I) ≥ 0. ψ(•) also inherits the continuous differentiability of φ(•). Then ∇ψ(t) satisfies the cyclical monotonicity condition of Rockafellar (1972, p. 238). That is, for every finite sequence of distinct types t(1), . . . , t(k), we have t( + 1) Ω t( + 1) -t( ) .

Then, combining the initial expression of T and the one we just derived, we can write that

T = 1 2 k =1 t( ) Ω t( + 1) -t( ) - 1 2 k =1 t( + 1) Ω t( + 1) -t( ) = - 1 2 k =1
t( + 1) -t( ) Ω t( + 1) -t( ) Going back to (4), we now have:

k =1 b t( ) Ω t( + 1) -t( ) - 1 2 k =1 t( + 1) -t( ) Ω t( + 1) -t( ) ≤ 0.
But that is exactly

k =1 v t( + 1)|t( ) -v t( )|t( ) ≤ 0.
And this rules out the possibility that t(1), . . . , t(k) forms a cycle of the masquerade relation, as we would then have, for every = 1, . . . , k, v t( +1)|t( ) -v t( )|t( ) > 0. Since the cyclical monotonicity condition must hold for every finite sequence t(1), . . . , t(k), we have proved that the masquerade relation must be acyclic.

C Identifying a Worst-Case Type

The following result identifies a worst case type under any condition of Theorem 2 and under (DM).

Proposition 6. Suppose that v i (s i |t i ) satisfies (MON), (DM), (SP-NRM), or (SCD). Let S i be a compact subset of T i and s 0 i = min S i . Then the sequence

s k+1 i =        inf t i ∈ S i | v i (s k i |t i ) > v i (t i |t i ) if t i ∈ S i | v i (s k i |t i ) > v i (t i |t i ) = ∅, s k i otherwise,
is non-decreasing and converges to some limit s ∞ i ∈ S i such that s ∞ i ∈ wct(S i ).31

Proof. The result is obvious under (DM) and (MON) because in that case s ∞ i = s 0 i . Assume (SCD). First notice that if

s k+1 i = s k i , then t i ∈ S i | t i M -→ s k i
= ∅, and hence s k i ∈ wct(S i ).

To show that the sequence is non-decreasing, we show that, if

t i ∈ S i | t i M -→ s k i = ∅, then s k+1 i = inf t i ∈ S i | t i M -→ s k i > s k i .
By way of contradiction, consider the smallest k such that

s k+1 i < s k i (k ≥ 1 because s 1 i ≥ s 0 i ).
Then, notice that s k+1

D The Coordination and Influence Games with Constant Biases

The Coordination Game. In the coordination game of Example 3 with constant biases, it is easy to show that every player i's best-response takes the form BR i (a -i ; t) = α ii θ(t) + b i + j =i α ij a j , and that equilibrium actions under complete information are given by a * i (t) = θ(t) + B i for every i, with B i ≡ j∈N γ ij b j , γ ij ≡ β ij α jj ∈ (0, 1) and the β ij are the coefficients of the matrix

β ≡          1 -α 12
-α n1 • • • • • • 1          -1
.

Next, we show that, for every player i such that j =i α ij (B i -B j ) ≥ 0, v i (s i | t i ; t -i ) satisfies ex post directional masquerade for the initial order on

T i v i (s i | t i ; t -i ) > v i (t i | t i ; t -i ) ⇒ s i t i . If
this is true, the interim masquerading payoff satisfies (DM) by Lemma 3, and for every message m i , s i = min M -1 i (m i ) is a worst case type of M -1 i (m i ). To see that it holds, observe that

v i (s i | t i ; t -i ) > v i (t i | t i ; t -i )
⇔ u i (BR i (a * -i (s i , t -i ); t i , t -i ), a * -i (s i , t -i ); t i , t -i ) > u i (a * i (t i , t -i ), a * -i (t i , t -i ), t i , t -i ).

To simplify the notations, let s = (s i , t -i ) and t = (t i , t -i ). Noting that player i's utility when she plays a best-response is given by a 2 ij =i α ij a 2 j , the previous inequality becomes

[BR i (a * -i (s); t)] 2j =i α ij [a * j (s)] 2 > [a * i (t)] 2j =i α ij [a * j (t)] 2 .

(5)

We use the form of player i's best-response and of equilibrium actions to get BR i (a * -i (s); t) = α ii θ(t) + b i + j =i α ij θ(s) + B j . From the fact that B i = α ii b i + j =i α ij B j , 32 we get BR i (a * -i (s); t) = α ii θ(t) + (1 -α ii )θ(s) + B i . We insert this expression into Inequality (5) so that:

v i (s i | t i ; t -i ) > v i (t i | t i ; t -i )
⇔ θ(t i , t -i ) -θ(s i , t -i ) α ii (1 -α ii ) θ(t i , t -i ) -θ(s i , t -i ) + 2 j =i α ij (B i -B j ) < 0.

If j =i α ij (B i -B j ) ≥ 0, then this inequality implies s i t i as θ(•) is non-decreasing.

32 We know that a * i (t) = θ(t) + B i . From the expression of BR i (a * -i (s); t) that we just calculated, we deduce that B i = α ii b i + j =i α ij B j since a * i (t) = BR i (a * -i (t); t).

Figure 1 :

 1 Figure 1: Masquerade relation and worst case types.

Figure 3 :

 3 Figure 3: Hidden bias.

  acyclic. (MON) stands for Monotonicity, (ID) and (SCD) stand for Increasing Differences and Single Crossing Differences. (SP-NRM) is a set of two conditions, Single Peakedness and No Reciprocal Masquerade. For a reminder of standard definitions used in the statement of this theorem, see Appendix A.

Figure 4 :

 4 Figure 4: Illustration of Proposition 5 (biases) in the unidimensional case. The acyclic masquerade property is satisfied in parts (a), (b) and (d) because φ(t) + 1 2 t 2 is convex, which is not satisfied in part (c).

Figure 5 :

 5 Figure 5: The bias vector field with φ(t) = 1 2 (α 1 t 2 1 -α 2 t 2 2 ).

  with s k i = inf t i ∈ S i | t i proof applies for (SP-NRM).

  , then there is an evidence base if and only if each type can certify that it belongs to a subset for which her true type is minimal: for all t i ∈ T i , there exists m i ∈ M i (t i ) such that t i = min M -1 i (m i ). In common interest games, that is, games in which no type would like to masquerade as any other type, there is an evidence base if and only if each type can simply send a different message. 13 , m 12 }, M i (t 2 ) = {m, m 23 , m 12 }, and M i (t 3 ) = {m, m 23 , m 13 } admits two evidence bases: {m, m 23 , m 13 } and {m 12 , m 23 , m 13 }. In contrast, the message correspondenceM i (t 1 ) = {m, m 12 }, M i (t 2 ) = {m, m 2 , m 23 , m12}, and M i (t 3 ) = {m, m 23 } does not admit any evidence base because type t 3 has no message certifying an event for which it is a worst case type.16 In Section 5, we provide more intuitive examples of evidence bases related to our applications.

	As another illustration, consider a player i with three possible types, T i = {t 1 , t 2 , t 3 }, whose
	masquerade relation is given by t 1 M -→ t 2 M -→ t 3 . The message correspondence M i (t 1 ) =
	{m, m

  separating in the sense that, for every t i = t i , the supports of σ i (t i ) and σ i (t i ) are disjoint. Let µ i (t -i | m, t i ) be the probability that player i puts on t -i when she is of type t i and the message profile is m. Suppose that (σ, µ) forms a fully revealing equilibrium with extremal beliefs.

	Consider a sequence of mixed communication strategy profiles {σ k } ∞ k=1 , where σ k i (t i ) ∈
	∆(M i (t i )) is completely mixed over M i (t i ), and such that each sequence σ k i (t i ) converges to
	σ i (t i ). Let µ k i (t -i | m, t i ) be the beliefs computed from σ k i by Bayes rule:

  For every s i s i , v i (s i |t i ; t -i ) ≥ v i (s i |t i ; t -i ) and the inequality is preserved by taking expectations; hence v i (s i |t i ) satisfies (MON). Suppose s i ≺ t i . Then by ex post directional masquerade, v i (s i |t i ; t -i ) ≤ v i (t i |t i ; t -i ), and taking expectations, v i (s i

	Proof of Lemma 3 (Ex Post Sufficient Conditions).
	(i) (ii)

But then, by repeating this operation, we eventually obtain a 2-cycle, thus contradicting the no reciprocal masquerade condition.

  • • • -α 1n

	-α 21	. . .	. . .	. . .
	. . .	-α ij	. . .	. . .

The assumption of certifiable information has been introduced in sender-receiver games by[START_REF] Grossman | The Informational Role of Warranties and Private Disclosure about Product Quality[END_REF] and[START_REF] Milgrom | Good News and Bad News: Representation Theorems and Applications[END_REF]. It is also used in a branch of the mechanism design and implementation literature (see, e.g.,Green and Laffont, 1986, Bull and Watson,

2004, 2007[START_REF] Deneckere | Mechanism design with partial state verifiability[END_REF][START_REF] Sher | Price Discrimination Through Communication[END_REF][START_REF] Ben-Porath | Implementation with Partial Provability[END_REF][START_REF] Kartik | Implementation with Evidence[END_REF]).2 Uniqueness is assumed only in the introduction in order to simplify the exposition.

More precisely, when a player unilaterally deviates from full disclosure during the communication phase, we restrict our attention to beliefs such that every non-deviating player attributes the deviant message to a single type among its possible senders. We show that this restriction, combined with full support and strong belief consistency[START_REF] Kreps | Sequential Equilibria[END_REF], imposes that the beliefs about the deviator are common to all non-deviators and do not depend on their types.

This includes any situation in which players can certify their true type.

The function w i weakly represents the masquerade relation of player i iff, whenever type t i of player i wants to masquerade as type s i , we have w i (s i ) > w i (t i ).

The conditions in[START_REF] Seidmann | Strategic Information Transmission with Verifiable Messages[END_REF] also imply these two conditions.

Or, therefore, increasing differences. The terminology adopted is that ofMilgrom (2004).

This result is different from the result of[START_REF] Van Zandt | Monotone Equilibria in Bayesian Games of Strategic Complementarities[END_REF], which says that if the actions of others have positive or negative externalities, then there exists a fully revealing equilibrium.

See, for example, Austen-Smith and Feddersen (2006),[START_REF] Gerardi | Deliberative Voting[END_REF],[START_REF] Jackson | Deliberation, Disclosure of Information, and Voting[END_REF],[START_REF] Lizzeri | Sequential Deliberation[END_REF] Yariv (2011), Mathis (2011).

In the main body of the paper, we prove this result under type independence. In the online appendix, we show that it holds regardless of the type distribution provided that we consider weak sequential equilibria instead of strong sequential equilibria.

This formulation does not exclude mixed strategy equilibria since each A i can be replaced by the set of mixed actions ∆(A i ) and the utility functions could be extended to mixed actions in the usual way.

We assume a common prior, but the solution concept and our results can be readily extended to games with heterogeneous prior beliefs p i (•) ∈ ∆(T ) as long as p i (•|t i ) ∈ ∆(T -i ) has full support for every i ∈ N and t i ∈ T i .

We recall that v i (s i |t i ) is lower semi-continuous in s i if, for every α ∈ R, the set {s i ∈ T i | v i (s i |t i ) > α} is open.

Note that the full support assumption is fundamental for this property to hold. The restriction imposed by the sequential equilibrium in the lemma also follows from the "strategic independence principle"(Battigalli,

1996), and it is explicitly required under the "no-signaling-what-you-don't-know" condition in[START_REF] Fudenberg | Perfect Bayesian Equilibrium and Sequential Equilibrium[END_REF] definition of perfect Bayesian equilibrium when types are independently distributed.

In the sense of, for example,[START_REF] Myerson | Game Theory, Analysis of Conflict[END_REF]; it corresponds to what is usually called a perfect Bayesian equilibrium in the literature.

See Milgrom and Roberts (1990) and[START_REF] Vives | Nash equilibrium with strategic complementarities[END_REF].

For example, in the coordination game, when players' coordination motives are symmetric (α ij = α, i = j), a player with a relatively low (high, respectively) bias is simply a player whose bias is smaller (higher, respectively) than the average bias in the population. Otherwise, see Appendix D for the precise meaning of a "relatively high/low" bias in the two previous examples.

See, for example, Austen-Smith and Feddersen (2006).[START_REF] Gerardi | Deliberative Voting[END_REF] showed that when voting is augmented with a cheap-talk communication stage, all voting rules that differ from unanimous adoption or unanimous rejection have the same set of equilibria, while the sets obtained under any of the unanimous rules are subsets of the latter.

Note that the result of Proposition 4 also extends the observation made in Remark 2.

A vector field that satisfies this property is called a conservative vector field, and when K = 3, this is equivalent to having curl 0, that is, ∇ × b(t) = 0.

The same proposition is true by replacing s 0 i = min S i by s 0 i = max S i and inf by sup.

Frédéric Koessler thanks the French National Research Agency (ANR, project NET and project RPIS) for financial support.

The same calculation shows that, for every player i such that

is a worst case type of M -1 i (m i ). Players for which j =i α ij (B i -B j ) is negative (positive, respectively) are said to have a a relatively low (high, respectively) bias.

The Influence Game. In the influence game (Example 4) with constant biases, equilibrium actions under complete information are given by a * i (t) = θ(t) + b i for every i. We have:

, and when

. Therefore, in this example, player i is said to have a relatively high (low, respectively) bias when b i -j =i α ij b j j =i α ij is positive (negative, respectively).