HTML from LaTeXML, with custom CSS/JS. The PDF is more accurate.

Strategic Communication with Lying Costs

Navin Kartik Columbia University and University of California, San Diego nkartik@gmail.com
Date: December 2008
Abstract.

I study a model of strategic communication between an informed Sender and an uninformed Receiver.  The Sender bears a cost of lying, or more broadly, of misrepresenting his private information.  The main results show that inflated language naturally arises in this environment, where the Sender (almost) always claims to be a higher type than he would under complete information.  Regardless of the intensity of lying cost, there is incomplete separation, with some pooling on the highest messages.  The degree of language inflation and how much information is revealed depends upon the intensity of lying cost.  The analysis delivers a framework to span a class of cheap talk and verifiable disclosure games, unifying the polar predictions they make under large conflicts of interest.  I apply the model to highlight how the degree of manipulability of information can affect the tradeoff between delegation and communication.

Key words and phrases:
Cheap Talk, Signaling, Misreporting, Exaggeration, Disclosure, Persuasion, Delegation.
This paper subsumes portions of an earlier manuscript circulated as “Information Transmission with Almost-Cheap Talk.”  The other parts of that manuscript are now superseded by “Selecting Cheap-Talk Equilibria,” with Ying Chen and Joel Sobel.
This research grew out of my Ph.D. dissertation, and I am indebted to my advisors, Doug Bernheim and Steve Tadelis, for their generous support and advice.  I am also grateful to Vince Crawford and, especially, Joel Sobel for encouragement and numerous conversations.  I thank David Ahn, Nageeb Ali, Yeon-Koo Che, Wouter Dessein, Peter Hammond, Cristóbal Huneeus, Maxim Ivanov, Jon Levin, Mikko Packalen, Ilya Segal, Jeroen Swinkels, Bob Wilson, a number of seminar and conference audiences, the Editor (Andrea Prat) and two anonymous referees for helpful comments.  Chulyoung Kim provided able research assistance.  I gratefully acknowledge financial support from a John M. Olin Summer Research Fellowship, a Humane Studies Fellowship, the National Science Foundation, and the Institute for Advanced Study at Princeton.  I also thank the Institute for its hospitality.

1. Introduction

The strategic transmission of private information plays an important role in many areas of economics and political science.  Most theoretical studies of direct communication can be classified into the following two categories.  One approach, initiated by Grossman (1981) and Milgrom (1981), assumes that information is verifiable and agents can withhold information but not lie.  These are referred to as games of “persuasion” or “verifiable disclosure.”  The second approach, pioneered by Crawford and Sobel (1982) and Green and Stokey (2007, circulated in 1981), assumes that information is unverifiable and an agent can lie arbitrarily without direct costs, typically referred to as games of “cheap talk.”

These are two extremes in a continuum of possibilities.  Rather than lying — synonymous in this paper with misrepresentation or misreporting — being completely costless or prohibitively costly, reality usually lies in between: individuals can and do misrepresent private information, but bear some cost in doing so.  These costs arise for various reasons.  First, there may be probabilistic ex-post state verification that results in penalties if misreporting is detected, such as random audits on taxpayers (e.g. Allingham and Sandmo, 1972).  Second, there may be costs of manipulating information or falsifying a message, such as when a manager has to spend time “cooking the numbers” or otherwise expend costly resources in order to report higher profits (e.g. Lacker and Weinberg, 1989; Maggi and Rodriguez-Clare, 1995).  Third, recent experimental work suggests that people have an intrinsic aversion to lying, even though messages are prima facie cheap talk (Gneezy, 2005; Hurkens and Kartik, 2008; Sánchez-Pagés and Vorsatz, 2006).

This paper studies the classic strategic communication setting of Crawford and Sobel (1982) (hereafter CS), with the innovation that some messages entail exogenous or direct lying costs for the Sender.  I use the term “lying costs” to broadly capture a class of misrepresentation costs, such as those discussed above.  To fix ideas, here is a simplified version of the model presented in Section 2: a Sender is privately informed about his type, t∈[0,1], and must send a message to the Receiver, who then takes a decision which affects both players’ payoffs.  There is a conflict of interest because the Sender wants the Receiver to believe that his type is higher than it actually is.  I suppose that for each Sender type, t, there is a set of messages, Mt, with the interpretation that any message m∈Mt has the literal or exogenous meaning “my type is t.”  In this framework, the Sender is said to be lying when he sends a message m∈Mt′ for some t′≠t, and the magnitude of a lie can be measured by the distance between his true type and the type he claims to be.  When type t sends a message m∈Mt′, he bears a cost k⁢C⁢(t′,t), where k is a scalar that parameterizes the intensity of lying cost.  If k=0, messages are cheap talk, and the setting reduces to that of CS.  This paper is concerned with k>0.  Assume that for any t, it is cheapest to tell the truth, and moreover, the marginal cost of a bigger lie is increasing in the magnitude of the lie.

Lying costs transform the CS cheap-talk model into one of costly signaling, although the induced structure is different from traditional “monotonic” signaling games (Cho and Sobel, 1990).  The main results I provide concern the amount of information revealed by the Sender in equilibrium, and the language — the equilibrium mapping from types to messages — through which information is transmitted.  For most of the paper, I focus on a tractable and appealing class of Perfect Bayesian equilibria, described in Section 3.111Although the possibility of other equilibria is not ruled out, these are the only ones that satisfy a refinement criterion proposed by Bernheim and Severinov (2003).  The structure of these equilibria is simple: low Sender types separate, revealing themselves through their equilibrium message, whereas high types segment into one or more connected pools.  The equilibria feature language inflation in the sense that (almost) every type t sends a message m∈Mt′ for some t′>t.  That is, the Sender (almost) always claims to be a higher type than he truly is, even though he suffers a cost of lying.  Of course, the Receiver is not systematically deceived, because she recognizes that the Sender is inflating his messages and adjusts her decision accordingly.  While this state of affairs may appear paradoxical at first glance, the key point is that if the Sender were to tell the truth (i.e. send a message m∈Mt when his type is t), the Receiver would infer that his type is in fact lower than it actually is, since she expects messages to be inflated.  There is thus an inescapable inefficiency for the Sender in equilibrium, reminiscent of unproductive education signaling in Spence (1973) or dissipative advertising in Milgrom and Roberts (1986a).

Language inflation is difficult to explain in a framework of pure cheap talk, due to the indeterminacy of language in any cheap-talk game.  Yet, the phenomenon occurs in numerous settings of communication with conflicts of interest.  For example, analysts at brokerage firms that have an underwriting relationship with a stock tend to provide inflated recommendations on that recommendation (e.g. Lin and McNichols, 1998; Michaely and Womack, 1999).  The literature discusses two basic forces that determine an affiliated analyst’s incentives: first, the existence of an underwriting relationship creates a pressure to induce clients to buy the stock; second, there are present compensation and future reputation rewards for more accurate recommendations.  In terms of my model, the more an analyst’s compensation is determined by accurate assessments, the higher is the intensity of lying costs, k.222Of course, there may be an additional component to lying costs stemming from regulatory concerns.  I establish some intuitive and testable comparative statics with respect to this intensity.  At the extreme case, as k→∞, equilibria converge to full separation with almost no language inflation, i.e. there is close to truth-telling.  On the other hand, as k→0, there is a lot of pooling with extremely inflated language.

In Section 4, I analyze in detail a canonical parametrization of the model, based on CS’s influential “uniform-quadratic” example.  This permits closed form solutions for equilibria in a wide range of lying costs, and delivers additional comparative statics to those mentioned above.  I then briefly apply these results to revisit the question of optimal allocation of authority in organizations between an informed agent and uninformed decision-maker.  Dessein (2002) showed that a decision-maker prefers cheap-talk communication to unconstrained delegation if and only if the conflict of interest is sufficiently large.  In contrast, I find that whenever the lying cost intensity is not too small in the leading example, communication can dominate delegation regardless of the conflict of interest.  More generally, my results indicate that the tradeoff between communication and delegation will depend upon how costly it is for the agent to manipulate information.

Section 5 proposes an extension to span the cheap talk and verifiable disclosure approaches to strategic communication.  As previously noted, the verifiable disclosure literature assumes that the Sender cannot lie about his type, but can withhold information.  Not being able to lie may be viewed as the limit of my model as k→∞.  To capture the ability to withhold information, I augment the model so that the Sender can make vague statements about his type, including being silent altogether at no cost.  The main results are extended to this setting.  One consequence is that when the conflict of interest between Sender and Receiver is large, the current framework unifies the dichotomous results of unraveling (full information revelation) in verifiable disclosure games and babbling (no information revelation) in cheap-talk games.

To summarize: the analysis here shows how lying costs can significantly affect the outcome of strategic information transmission.  Consequently, direct communication may have a greater scope to reduce the costs of asymmetric-information-based incentive problems than otherwise suggested.  This theoretical finding is consistent with experimental evidence, where “overcommunication” is often documented (e.g. Cai and Wang, 2006).  Section 6 concludes with some comments on economic implications and potential applications of the current framework.

1.1. Related Literature

This paper contributes to the literatures on cheap talk, costly signaling, and verifiable disclosure.  Most closely related to my work are the following contemporaneous papers: Chen (2007), Chen et al. (2008), Kartik et al. (2007), and Ottaviani and Squintani (2006).  I now discuss the connections in some detail, followed by a briefer mention of other related work.

Kartik et al. (2007) also study the notion of costly lying and language inflation.  However, the focus and analysis is quite different, because they study an unbounded type space setting.  They prove the existence of separating or fully-revealing equilibria for arbitrarily small intensity of lying cost (and other costly signaling structures).333Austen-Smith and Banks (2000) analyze a model of cheap talk and costly signaling, where the costly signal takes the form of “burned money.”  That is, the cost of the signaling instrument does not vary with the Sender’s type.  Their focus is on how the presence of this additional instrument can enlarge the set of CS equilibria, with a key result that so long as the Sender’s ability to impose costs on himself is sufficiently large, separating equilibria exist.  Kartik (2007) shows that as the ability to burn money shrinks to 0, the set of equilibria in Austen-Smith and Banks (2000) converges to the entire set of CS equilibria. Kartik (2005) discusses the differences between burned money and costly lying.  This result relies essentially on the unboundedness of the type space, because the Sender is then able to inflate his message without restraint.  In contrast, in this paper I study the canonical bounded type space model of CS, and show that separating equilibria do not exist regardless of the lying cost intensity.444This statement requires some caveats when the setting is more general than that described in this introduction; see Theorem 1 and fn. 10.  Intuitively, given that messages must be inflated, the upper bound on the type space acts as a barrier to full separation.  Consequently, the attention here is necessarily on partially-pooling equilibria.  Aside from requiring a more complex analysis, this also permits me to address issues that cannot be meaningfully answered in an unbounded type space model, such as large conflicts of interest and comparative statics of partial-separation.

In a bounded type space, Ottaviani and Squintani (2006) study the “uniform-quadratic” specification of CS.  They introduce the possibility that the Receiver may be naive or non-strategic.  This transforms the game from one of cheap talk into a costly signaling structure that can be subsumed by the current framework (see Section 2.1).  For some parameterizations, they construct an equilibrium that has similar features to the equilibria studied here.  Their parametric restrictions require the conflict of interest between Sender and Receiver to be sufficiently large relative to other parameters, which is not required here.  Ottaviani and Squintani (2006) provide some comparative statics that are complementary to those in this paper.  There is no analog in their work to the analysis I undertake in Section 5 about withholding information.

Chen (2007) furthers the non-strategic approach by modeling not only Receiver naivety, but also Sender naivety or mechanical honesty.  Specifically, she posits that with some probability the Sender just reports his type truthfully, and with some independent probability the Receiver takes the message to be truthful.  Using the uniform-quadratic specification of CS, she shows that there is a unique equilibrium in the cheap-talk extension (Manelli, 1996) of her model that satisfies a monotonicity requirement.  Language is inflated in her equilibrium, for reasons similar to this paper, since Receiver naivety induces a particular form of lying costs.  A benefit of assuming Sender naivety is that it ensures that all messages are used in equilibrium, obviating the need to consider off-the-equilibrium-path beliefs.555The specification of Sender naivety imposes particular restrictions on beliefs when a message is observed that is not sent by a strategic Sender.  In effect, it substitutes for restrictions on off-the-equilibrium-path beliefs in a fully rational model.  A strength of the approach here is that both the underlying cheap-talk model and the costly signaling structure are more general.

Chen et al. (2008) propose a refinement called No Incentive to Separate (NITS) for cheap-talk games like CS.  Among other justifications for the criterion, they show that only CS equilibria satisfying NITS can be the limit of certain equilibria in a class of games with lying costs, as the intensity of lying costs shrink to 0.  Although their model does not strictly subsume the current setting, their arguments can be adapted.  The analysis here is entirely complementary, because I study arbitrary intensities of lying cost, rather than just the cheap-talk limit as the costs vanish.  Inter alia, this paper provides an explicit characterization of a set of equilibria for any cost intensity.

With regards to the broader signaling literature, I build upon techniques developed by Mailath (1987) to study costly signaling with a continuum of types.  Whereas his analysis concerns separating equilibria, the main results in this paper concern partially-pooling equilibria, as already noted.  Cho and Sobel (1990) were the first to derive incomplete separation in the manner obtained here: pooling at the top of the type space using the highest messages and separation at the bottom.  Their analysis is for a class of signaling games that have a finite type space and satisfy a single-crossing property that does not apply to the current setting.  A more closely related model is that of Bernheim and Severinov (2003).  Although they study a topic in public finance and the issues we each focus on are rather different, the formal structures have similarities.  My equilibrium characterization builds upon their work.

Lastly, I should also briefly mention two other literatures that touch upon related issues.  First, there is a small literature on contracting and mechanism design with misrepresentation costs, initiated by Green and Laffont (1986).  Generally, the costs are taken to be either zero or infinite, but see Deneckere and Severinov (2007) for an exception.  Second, there are some papers in accounting that propose signaling theories of earnings management, e.g. Stein (1989).  They also motivate costly misreporting for technological or legal reasons, but to my knowledge only consider unbounded type spaces and special functional forms.

2. The Model

There are two players, a Sender (S) and a Receiver (R).  The Sender has private information summarized by his type t∈T=[0,1], which is drawn from a differentiable probability distribution F⁢(t), with strictly positive density for all t∈T.  After privately observing his type t, the Sender sends the Receiver a message, m∈M, where M is a Borel space of available messages.  After observing the message, R takes an action, a∈ℝ.

I assume that M=⋃tMt, with |Mt|=∞ for all t and Mt∩Mt′=∅ if t≠t′.  The interpretation is that any m∈Mt carries the literal or exogenous meaning “my type is t.”  Since {Mt}t∈T is a partition of M, any m can be associated with a unique t such that m∈Mt; denote this mapping by Ψ⁢(m).  Thus, if Ψ⁢(m)>Ψ⁢(m′), the Sender is claiming in literal terms to be a higher type when he sends m rather than m′, and I will say that m is higher or larger than m′ (only weakly, if Ψ⁢(m)≥Ψ⁢(m′)).

The payoff for R is given by UR⁢(a,t), and the payoff for S is given by US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t).  Here, UR:ℝ×T→ℝ and US:ℝ×T→ℝ represent the two players’ preferences over type-action pairs, whereas C:ℝ×T→ℝ is a lying cost function, k>0 is a scalar that parameterizes its intensity, and ν:T→ℝ is a function that will be further discussed below.  Note that m is payoff-relevant only for S.  All aspects of the game except the value of t are common knowledge.

I now introduce two sets of assumptions on players’ preferences.  The first set is identical to Crawford and Sobel (1982), while the latter defines the costs of lying.

Preferences over actions: For i∈{R,S}, the function Ui⁢(⋅,⋅) is twice continuously differentiable on ℝ×T.666More precisely, there exists an open set T′ containing T and two twice continuously differentiable functions on ℝ×T′ which are respectively identical to US and UR on ℝ×T.  Analogous statements apply to subsequent assumptions about differentiability of ν and C.  Using subscripts to denote derivatives as usual, U11i<0<U12i for i∈{R,S}, so that both players’ payoffs are concave in R’s action and supermodular in (a,t).  For any t, there exists aR⁢(t) and aS⁢(t) respectively such that U1R⁢(aR⁢(t),t)=U1S⁢(aS⁢(t),t)=0, with aS⁢(t)>aR⁢(t).  That is, the most-preferred actions are well-defined for both players, and the Sender prefers higher actions than the Receiver.  These assumptions imply that for i∈{R,S}, d⁢ai⁢(⋅)d⁢t>0, i.e. both players prefer higher actions when the Sender’s type is higher.

Preferences over messages: The function ν⁢(⋅) is continuously differentiable on T and strictly increasing.  The function C⁢(⋅,⋅) is twice continuously differentiable on ℝ×T, with C11>0>C12.  These assumptions imply that there is a continuous and weakly increasing function, rS:T→T, such that for any t, rS⁢(t)=arg⁢mint′∈T⁡C⁢(ν⁢(t′),t).  In words, rS⁢(t) is the type that t would claim to be in order to minimize message costs.  Equivalently, any m∈MrS⁢(t) is a cost-minimizing message for t.  I assume that rS⁢(1)=1, but nothing else about the function rS.  The assumptions on C and ν imply that when Ψ⁢(m) is farther from rS⁢(t), m is more costly for t, and moreover, the marginal change in cost from claiming to be a slightly higher type than Ψ⁢(m) is larger in absolute value.

2.1. Discussion.

Here are some comments on the model’s assumptions and interpretations.

Message space.

As mentioned, each message is associated with some type, with the interpretation that every statement the Sender can make has a literal meaning about the exact value of his type.777Section 5 shows how the model can be extended to cases where the Sender is permitted to make “vague” statements about his type (e.g., “my type lies in [0.1,0.3]”).  An alternative interpretation is that the Sender must submit some evidence or data to the Receiver, and his type represents the true realization of this evidence, which is costly to falsify.  The assumption that each Mt contains an infinite number of messages may be viewed as assuming a rich language: there are a large number of ways in which the Sender can make a statement with the literal content that his type is t, for example, “my type is t,” or “you should believe that my type is t,” and so forth.888An infinite number of messages in each Mt is a stronger assumption than necessary; a large enough finite number would always do.  Some of the results only require |Mt|≥1.  It is worth noting that a special case of the model is when the Sender can make a two-dimensional statement about his type: on one dimension he reports an exact value about his type and suffers a cost of misreporting the truth, while on the other, he just makes a cheap-talk statement from some arbitrary (infinite) set.  For example, firms can take costly actions to manipulate earnings reports that must be submitted, but they can also simultaneously provide costless explanations or justifications.

Lying costs.

If k=0, the model reduces to the cheap-talk model of CS.  Since k>0, messages are discriminatory signals in the sense that the cost of a message varies with the Sender’s type.  An important example to keep in mind throughout the analysis is as follows: ν⁢(t)=t, and C1⁢(t,t)=0 for all t (e.g., C⁢(x,t)=(x−t)2).  In this case, rS⁢(t)=t, i.e. it is cheapest to tell the literal truth.

The assumption rS⁢(1)=1 means that the highest type minimizes cost by claiming to be itself.  Obviously, this assumption is satisfied when it is cheapest for each type to tell the truth.  It also holds in an application discussed below, even though truth-telling is not cost-minimizing for all types there.  In any case, the assumption is made primarily for expositional convenience; all the analysis can be generalized to settings where rS⁢(1)<1, as pointed out in fn. 10.

Let me emphasize that the Sender’s costs of lying in this model depend only upon his type and the message he uses.  Plainly, this is appropriate when the costs stem from potential auditing penalties or technological/opportunity costs of falsifying information.  In terms of capturing psychological aversion to lying, the interpretation is that the Sender is averse to making statements that would be considered untruthful under a literal or otherwise exogenous interpretation of statements.999One might suggest that psychological costs of lying should take into account the Receiver’s endogenous interpretation of a message.  While this is interesting, I leave it for future research.  The assumption that costs are convex in the type that the Sender claims to be (holding fixed his true type) is a substantive but natural one.  For example, it would arise if there is a fixed probability of misreporting being detected and penalties are convex in the magnitude of misreporting.

Naive Receivers.

Admitting the possibility that the Receiver may be naive or credulous can induce costs on the Sender that are similar to exogenous lying costs.  To illustrate, suppose as in Chen (2007) or Ottaviani and Squintani (2006) that messages are cheap talk, but with probability q∈(0,1), the Receiver is (perceived to be) credulous, in which case she takes message m at face value, responding with action aR⁢(Ψ⁢(m)).  Now, when the Sender is of type t, the expected utility from sending message m and receiving action a from a strategic Receiver is given by

(1−q)⁢US⁢(a,t)+q⁢US⁢(aR⁢(Ψ⁢(m)),t).

Setting k=q1−q, ν⁢(t)=aR⁢(t), and C⁢(x,t)=−US⁢(x,t), the above payoff expression can be normalized and rewritten as US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t). The properties of US and UR imply that C and ν thus defined satisfy my assumptions.  Note that in this case,

rS⁢(t)={(aR)−1⁢(aS⁢(t))if aS⁢(t)<aR⁢(1)1if aS⁢(t)≥aR⁢(1),

and is therefore not strictly increasing.  Indeed, if the conflict of interest between Sender and Receiver is sufficiently large (aS⁢(0)≥aR⁢(1)), rS is a constant function.  Nevertheless, rS is weakly increasing and satisfies rS⁢(1)=1.

2.2. Strategies and Equilibrium.

A pure strategy for the Sender strategy is a (measurable) function μ:T→M, so that μ⁢(t) is the message sent by type t.  Denote the posterior beliefs of the Receiver given a message m by the cumulative distribution G⁢(t∣m).  A pure strategy for the Receiver is a function α:M→ℝ, so that α⁢(m) is the action taken when message m is observed.  The solution concept is Perfect Bayesian Equilibrium (PBE), which requires the Sender to maximize utility for each type given the Receiver’s strategy, the Receiver to maximize utility given his beliefs after every message, and beliefs to satisfy Bayes’ rule wherever it is well-defined.

For most of the analysis, I only consider pure strategy PBE, which are referred to as just “equilibria” hereafter.  Moreover, I typically restrict attention to equilibria where the Sender’s strategy is weakly increasing, in the sense that if t>t′, then Ψ⁢(μ⁢(t))≥Ψ⁢(μ⁢(t′)).  This property is called message monotonicity, and an equilibrium which satisfies the property is a monotone equilibrium.  In a monotone equilibrium, the Sender makes a weakly higher claim about his type when his type is truly higher.  Attention to such equilibria seems reasonable because higher types intrinsically prefer higher messages due to the cost of lying structure (formally, rS⁢(t) is weakly increasing).

3. Signaling and Inflated Language

3.1. Impossibility of Full Separation.

The basic signaling problem is that the Sender wants the Receiver to infer that he is a higher type than he actually is.  Say that a type t is separating if {t′:μ⁢(t′)=μ⁢(t)}={t}, i.e. the message sent by t reveals that the Sender’s type is t.  A separating equilibrium is one where all types are separating.  Naturally, the first question is whether such equilibria exist.

It is generally more convenient to work with the mapping ρ:=Ψ∘μ directly, rather than just μ.  Note that ρ:T→T, and ρ⁢(t) is interpreted as the type that t claims to be.

Definition 1.

A type t is said to be using inflated language if ρ⁢(t)>rS⁢(t).  A type t is telling the truth if ρ⁢(t)=rS⁢(t).

The above definition is appropriate because it compares what a type claims to be in equilibrium relative to what it would claim under complete information, i.e. if the Receiver knew the Sender’s type, which is rS⁢(⋅) by definition.  Thus, truth-telling refers to what a type would say under complete information; whether it satisfies ρ⁢(t)=t depends on the properties of C and ν.  Since under complete information the Sender would play a strategy such that ρ⁢(⋅)=rS⁢(⋅), any deviation in the equilibrium ρ⁢(⋅) from rS⁢(⋅) stems from the signaling problem.  The following result identifies a key property of ρ in any separating region of types.

Lemma 1.

If types (tl,th) are separating in a monotone equilibrium, then for each t∈(tl,th), ρ⁢(t)>rS⁢(t) and

ρ′⁢(t)=U1S⁢(aR⁢(t),t)⁢d⁢aRd⁢t⁢(t)k⁢C1⁢(ν⁢(ρ⁢(t)),t)⁢ν′⁢(ρ⁢(t)). (DE)

(Note: all proofs are in Appendix A.)  The Lemma says that in a monotone equilibrium, ρ must solve (DE) on any open interval of types that are separating.  This is straightforward given differentiability of ρ, since in that case, (DE) is the first order condition of the following maximization problem for each t∈(tl,th):

arg⁢maxt~∈(tl,th)⁡US⁢(aR⁢(t~),t)−k⁢C⁢(ν⁢(ρ⁢(t~)),t). (1)

The proof that ρ must be differentiable is based on Mailath (1987).  Observe that the sign of ρ′ in (DE) is determined by the sign of C1⁢(⋅,⋅), since all the other terms on the right hand side are positive.  In turn, the sign of C1⁢(ν⁢(ρ⁢(t),t)) depends on whether ρ⁢(t) is greater or less than rS⁢(t).  Since a monotone equilibrium requires ρ to be weakly increasing, (DE) implies that all types in the interior of a separating interval must be using inflated language, i.e. ρ⁢(t)>rS⁢(t).

Consider now whether there can be complete separation in a monotone equilibrium.  If so, Lemma 1 implies that all types in (0,1) must be using inflated langauge.  However, since rS⁢(1)=1, the highest type cannot be using inflated language.  This intuition underlies the next result.

Theorem 1.

There is no separating monotone equilibrium.

The formal logic is as follows: a separating monotone equilibrium requires a continuous function to solve an initial value problem defined by the differential equation (DE) together with some boundary condition ρ⁢(0)≥rS⁢(0).  The proof of Theorem 1 shows that there is no solution on the domain t∈[0,1], regardless of the choice of boundary condition.  Intuitively, each type must inflate its claim in order to separate itself from lower types, but one eventually “runs out” of claims that can be made.  More precisely, the solution to the initial value problem hits the upper bound of 1 at some t<1.101010Here is where the assumption that rS⁢(1)=1 simplifies matters.  If rS⁢(1)<1, then it may be possible to have a separating monotone equilibrium, depending on other parameters; in particular, for any rS⁢(1)<1, then will be a separating monotone equilibrium if k is large enough.  However, the Theorem can be generalized to show that even in these cases, a separating monotone equilibrium will not exist if k is not too large.  Intuitively, as k decreases, the slope of the solution to the relevant initial value problem increases, such that one eventually runs out of messages again.  It can also be shown that there is no separating equilibrium in the class of all PBE, including non-monotone equilibria in pure or mixed strategies, if either of two conditions hold: rS⁢(0)=0 (which is satisfied when truth-telling is cost-minimizing for all types) or k is sufficiently small.

Theorem 1 contrasts with the main result of Kartik et al. (2007), who show that when the type space is not bounded above, a separating monotone equilibrium exists for any k>0.  The reason is that when there is no upper bound on the type space, the solution to the differential equation (DE) can be extended over the whole domain.111111It is also appropriate here to compare with Bernheim and Severinov (2003).  Translating their model — specifically, their main case of “imitation towards the center” — to the current notation, separating equilibria exist in their setting whenever k is large enough.  The reason is that they have different assumptions on US and UR.  In particular, they assume that aS⁢(t)=aR⁢(t) for t∈{0,12,1}.  This contrasts with the current setting, where aS⁢(t)>aR⁢(t) for all t.  Moreover, in their model, the signal space is constrained, so that sufficiently low (resp. high) types necessarily inflate (resp. deflate) language.  These differences have subtle but significant consequences on the analysis.

3.2. Pooling Equilibria.

Theorem 1 implies that any monotone equilibrium involves some pooling.  The logic that the Sender eventually runs out of types to mimic for separation suggests a class of pooling equilibria to study, where low types separate and high types pool on the highest messages.  In what follows, I first define this class precisely, then discuss the structure and existence of such equilibria, followed by a justification for focusing on this class.

Let a separating function be a continuous and increasing function that solves (DE) with the initial condition ρ⁢(0)=rS⁢(0).  This choice of initial condition is motivated by the usual “Riley condition” of least costly separation in signaling games.  The Appendix (Lemma A.1) establishes that there is a unique separating function, denoted ρ∗ hereafter, which is well-defined on some interval [0,t¯], where t¯<1 is such that ρ∗⁢(t¯)=1.

Definition 2.

A Sender’s strategy μ is a LSHP (Low types Separate and High types Pool) strategy if there exists t¯∈[0,t¯] such that:

  1. (1)

    for all t<t¯, μ⁢(t)∈Mρ∗⁢(t) (i.e., ρ⁢(t)=ρ∗⁢(t)),

  2. (2)

    for all t≥t¯, μ⁢(t)∈M1 (i.e., ρ⁢(t)=1).

An equilibrium (μ,α) is a LSHP equilibrium if μ is an LSHP strategy.

A LSHP equilibrium features a cutoff type, t¯, such that any type t<t¯ separates by playing ρ∗⁢(t), whereas all types above t¯ send messages in M1.  The structure of such equilibria is elucidated by several observations.  A key point is that the following indifference condition must hold if t¯>0:

US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯)=US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯). (2)

That is, type t¯>0 must be indifferent between sending μ⁢(t¯)∈M1 and inducing α⁢(μ⁢(t¯)) versus sending any m∈Mρ∗⁢(t¯) and inducing aR⁢(t¯).  This follows from the fact that any t<t¯ plays ρ∗⁢(t) and induces action aR⁢(t), combined with the equilibrium requirement that type t¯ should not prefer to mimic some t<t¯, and conversely, no t<t¯ should prefer to mimic t¯.  Equation (2) implies that for any t¯>0, there is a unique α⁢(μ⁢(t¯)).  This imposes a restriction on which types can be sending μ⁢(t¯), because α⁢(μ⁢(t¯)) must be optimal for the Receiver against μ⁢(t¯).

Since μ⁢(t)∈M1 for all t≥t¯, it is equally expensive in terms of direct message costs for a given type to mimic any t≥t¯.  Consequently, the cheap-talk constraints of CS apply within [t¯,1].  To state this precisely, define (with an abuse of notation), for any t′′<t′,

aR⁢(t′′,t′)=arg⁢maxa⁢∫t′′t′UR⁢(a,t)⁢𝑑F⁢(t)

as the optimal action for the Receiver if the only information she has is that the Sender’s type lies in [t′′,t′].  Given a cutoff type t¯≥0, let a partial-partition refer to partition of [t¯,1] into intervals, denoted by a strictly increasing sequence, ⟨t0=t¯,t1,…,tJ=1⟩.  CS’s logic dictates that there must be a partial-partition such that for all j∈{1,…,J−1},

US⁢(aR⁢(tj−1,tj),tj)−US⁢(aR⁢(tj,tj+1),tj)=0. (3)

For j=1,…,J, every type t∈(tj−1,tj) sends the same message, call it mj∈M1, and induces the same action, aR⁢(tj−1,tj).  Of course, mj≠mk for k≠j, and a boundary type tj for j=1,…,J−1 can send either mj or mj+1, while type 1 must send mJ.

The above discussion pins down the Sender’s strategy in any LSHP equilibrium with cutoff type t¯>0, modulo payoff-irrelevant permutations of messages that carry the same literal meaning.  It is important to underscore that although all types above t¯ are incurring the same direct message cost (ρ⁢(t)=1 for all t≥t¯), they need not be sending the same message.  Thus, there can be multiple pools in an LSHP equilibrium, but all pools use messages in M1.121212Throughout, a pool refers to a maximal set of types that use the same message, and thus induce the same action from the Receiver.  The possibility of sustaining multiple pools with messages of the same literal meaning is ensured by the rich language assumption (|Mt| is large for each t), and plays a key role in assuring existence of LSHP equilibrium when costs of lying are small relative to the conflict of interest.

On the Receiver’s side, it is clear what she must play on the equilibrium path: α⁢(μ⁢(t))=aR⁢(t) for all t<t¯, and α⁢(mj)=aR⁢(tj−1,tj) for any mj such that μ⁢(t)=mj for all t∈(tj−1,tj).  As usual, optimality of the Sender’s strategy places some constraints on what responses the Receiver can take off the equilibrium path.

The preceding remarks have identified a set of necessary conditions for a LSHP equilibrium with t¯>0.  The following result establishes that they are also sufficient, and provides an existence result taking into account the possibility that there may be LSHP equilibria where no types separate (t¯=0).

Theorem 2.

In any LSHP equilibrium, there is a cutoff type, t¯∈[0,t¯], and a partial-partition, ⟨t0=t¯,t1,…,tJ=1⟩, such that

US⁢(aR⁢(tj−1,tj),tj)−US⁢(aR⁢(tj,tj+1),tj)=0⁢ ∀j∈{1,…,J−1}, (4)
US⁢(aR⁢(t¯,t1),t¯)−k⁢C⁢(ν⁢(1),t¯)=US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯)⁢ if t¯>0. (5)

Conversely, given any cutoff type and partial-partition that satisfy (4), (5), and

US⁢(aR⁢(t¯,t1),0)−k⁢C⁢(ν⁢(1),0)≥US⁢(aR⁢(0),0)−k⁢C⁢(ν⁢(rS⁢(0)),0)⁢ if t¯=0, (6)

there is a corresponding LSHP equilibrium.

For any k>0, there is an LSHP equilibrium that satisfies (4)–(6).  If rS⁢(0)<rS⁢(1) and k is sufficiently large, there is an LSHP equilibrium with t¯>0.

Inequality (6) says that if the cutoff type is 0, then type 0 weakly prefers pooling with [0,t1] by claiming to be type 1 to revealing itself with a least-costly message.  Existence is established by constructively showing that (4), (5), and (6) can jointly be satisfied.131313Although (6) is not guaranteed to hold in an arbitrary LSHP equilibrium, one can show that it is necessary if the Receiver’s strategy is to be weakly increasing in the sense that α⁢(m)≥α⁢(m′) if Ψ⁢(m)≥Ψ⁢(m′), a property that is appealing given the monotonicity of the Sender’s strategy.  The last part of the Theorem is intuitive: it says that so long as not all types have the same cost-minimizing messages, if the intensity of lying cost is sufficiently large, then at least some types can be separating in equilibrium.

Figure 1 illustrates a LSHP equilibrium.  It is drawn for a case where aR⁢(t)=rS⁢(t)=t, so that sequential rationality requires the Receiver to only take actions in [0,1].  The Sender’s strategy is represented by the solid curve, which is ρ⁢(t).  The separating function, ρ∗, coincides with ρ on [0,t¯), and then extends as the dotted curve up to t¯.  There are two pools in this equilibrium: every t∈[t¯,t1] plays μ⁢(t)=m1∈M1, whereas every t∈(t1,1] plays μ⁢(t)=m2∈M1∖{m1}.  The Receiver’s strategy is depicted in the dashed blue line, which shows the correspondence β:T⇉ℝ defined by β⁢(t)=∪m∈Mtα⁢(m).  That is, β⁢(t) is the set of all actions taken by the Receiver in response to messages where the Sender claims to be type t.  Note that up until ρ⁢(t¯), β is is the mirror image of ρ around the 45∘ line, which verifies that for the region of separating types, the Receiver inverts the Sender’s message.  Since there are two pools, |β⁢(1)|=2.

Refer to caption
Figure 1. A LSHP equilibrium: solid curve represents Sender’s strategy via ρ⁢(t)=Ψ⁢(μ⁢(t)); dotted curve is the separating function, ρ∗; dashed curve represents Receiver’s strategy via β⁢(t)=∪m∈Mtα⁢(m).

Since the separating function ρ∗ has ρ∗⁢(t)>rS⁢(t) for all t∈(0,t¯], every LSHP equilibrium displays inflated language, so long as rS⁢(0)<1.  The inflation of language is inefficient and costly for every type t<t¯, since such types are revealing themselves in equilibrium, yet not minimizing their message costs.  Telling the truth — or more generally, reducing the magnitude of inflation — is not profitable, however, because it would lead to adverse inferences from the Receiver, who expects the equilibrium degree of language inflation and thus rationally deflates (seen in Figure 1 by β⁢(⋅) being strictly below the 45∘ line).

As mentioned, LSHP equilibria are an intuitively natural class of pooling equilibria to focus on: they feature message monotonicity, which is appealing given the preference of higher types for higher messages; low types separate in the cheapest way possible consistent with message monotonicity; and all pooling occurs on messages in the set M1, which is effectively the barrier to complete separation.  For these reasons, the structure of LSHP equilibria is reminiscent of the “D1” equilibria of Cho and Sobel (1990), the “central pooling” equilibria of Bernheim and Severinov (2003), and, in a more distant setting, the “variable bribes equilibria” of Esö and Schummer (2004).141414A difference with Cho and Sobel (1990) is that there cannot be multiple pools in their D1 equilibria, unlike here where this plays an important role.  The difference arises because in the current model, not all types generally wish to be perceived as the highest type, an assumption made by Cho and Sobel (cf. Proposition 1).  This is also the case in Esö and Schummer (2004).  Multiple pools do arise in Bernheim and Severinov’s (2003) central pooling equilibria; a distinction with their analysis is that it is important here to allow for the possibility that t¯ may equal 0, because there generally will not exist LSHP equilibria with positive t¯ when k is small.  Bernheim and Severinov’s equilibria always have t¯>0; the difference stems from the preference distinctions noted in fn. 11.  Indeed, Cho and Sobel (1990) established that in standard signaling games where complete separation is not possible due to a bound on the signal space, refinements based on Kohlberg and Mertens’s (1986) notion of strategic stability (Cho and Kreps, 1987; Banks and Sobel, 1987) select equilibria where low types separate in a least costly manner and high types pool on the maximal costly signal.  Because the current model has some differences with standard signaling games, these refinements have limited power per se.  Nevertheless, Bernheim and Severinov (2003) proposed a modification of the D1 refinement, called monotonic D1 equilibrium, which can be shown to rule out any non-LSHP equilibrium.151515i.e., any equilibrium where the Sender’s strategy is not an LSHP strategy for a positive measure of types.  Moreover, there is always an LSHP equilibrium which satisfies the refinement criterion.  Therefore, focussing on this class of equilibria can be formally justified.  Appendix B provides complete details.

The remainder of this section looks at various special cases of the model which provide additional insights into the structure of communication.

3.3. Large Conflicts of Interest.

LSHP equilibria are particularly simple if the conflict of interest between Sender and Receiver is large in the following precise sense.

Definition 3.

The Sender has (or there is) a large bias if aS⁢(0)≥aR⁢(1).

When there is a large bias, the Sender would always like to be perceived as high a type as possible, which is the usual assumption in costly signaling games.  This implies that there cannot be multiple pools in an LSHP equilibrium, since no type would be willing to send a message m∈M1 if there exists some m′∈M1 such that α⁢(m′)>α⁢(m).  Consequently, all types above t¯ must induce action aR⁢(t¯,1) in equilibrium, and condition (3) becomes vacuous.  This yields a simplification of condition (2) and the following result.

Proposition 1.

Assume the Sender has a large bias.  There is a single pool in any LSHP equilibrium.  It is necessary and sufficient for an LSHP equilibrium with t¯>0 that

US⁢(aR⁢(t¯,1),t¯)−US⁢(aR⁢(t¯),t¯)=k⁢(C⁢(ν⁢(1),t¯)−C⁢(ν⁢(ρ∗⁢(t¯)),t¯)) (7)

have a solution in the domain (0,t¯).  It is necessary and sufficient for an LSHP equilibrium with t¯=0 (where all types pool) that

US⁢(aR⁢(0,1),0)−US⁢(aR⁢(0),0)≥k⁢(C⁢(ν⁢(1),0)−C⁢(ν⁢(rS⁢(0)),0)). (8)

The Proposition implies that if there is large bias, then for any t, there is at most one message in Mt that is used in an LSHP equilibrium.  Therefore, the rich language assumption that |Mt| be large for each t is unnecessary; the analysis would apply just as well if instead |Mt|=1 for all t.  Note also that it is simple to directly establish existence of an LSHP equilibrium under large bias.161616The argument is as follows: if (8) does not hold, then there must be at least one solution to (⁢7⁢), since each side of (⁢7⁢) is continuous, and at t¯=t¯ the right-hand side is 0 whereas the left-hand side is strictly positive (by t¯<1 and large bias).  This is because the only binding incentive constraint is for type t¯, unlike in the general bias case where incentive constraints can also bind for boundary types between pools.

3.4. No Conflict of Interest.

I have assumed that aS⁢(t)>aR⁢(t) for all t, which was crucial for Theorem 1.  At the other extreme, consider aS⁢(t)=aR⁢(t) for all t, so that there is no conflict of interest.  Intuitively, one would expect complete separation with truth-telling in this case.  Formally, although (DE) does not apply, it is clear that the appropriate separating function becomes ρ∗⁢(t)=rS⁢(t) for all t.  There is a separating equilibrium where each t sends any m∈MrS⁢(t), with the caveat that any t and t′≠t use distinct messages if rS⁢(t)=rS⁢(t′).  Since ρ⁢(t)=ρ∗⁢(t) in such equilibria, these are indeed LSHP equilibria.

3.5. Almost-Cheap Talk.

Return now to the general case of conflict of interest.  Recall that when k=0, the setting reduces to the CS model of cheap talk.  An interesting question then is what happens when the intensity of lying cost is small, k≈0.  It must be that t¯≈0 in any LSHP equilibrium, because by (DE), the separating function ρ∗ cannot be extended very far, i.e. t¯≈0.  Hence, as the cost of lying vanish, the type space is almost entirely partitioned into pools, with extremely inflated language.171717 Since (3) must hold for every boundary type in the partition of [t¯,1], and t¯≈0, the partition of [t¯,1] must be close to some CS partition in any sensible metric.  Chen et al. (2008) discuss which cheap-talk equilibria can be limits of a class of equilibria in a model of costly lying as the lying costs vanish.  Although their model does not nest the current setting, and the class of equilibria they consider does not include all LSHP equilibria (they require monotonicity of the Receiver’s strategy, which need not hold in an LSHP equilibrium), one can nevertheless show that if rS⁢(t) is strictly increasing, any cheap-talk equilibrium which is the limit of a sequence of LSHP equilibria as k→0 must satisfy Chen et al.’s (2008) No Incentive to Separate property.  The following result says that in fact, there generally is an LSHP equilibrium where no type separates.

Proposition 2.

Assume that there is no CS cheap-talk equilibrium, (α,μ), with US⁢(α⁢(μ⁢(0)),0)=US⁢(aR⁢(0),0).  Then, for all k sufficiently small, there is a LSHP equilibrium with t¯=0, where types partition as in a CS cheap-talk equilibrium.

The assumption made in the proposition is mild: intuitively, it holds “generally” in the sense that if a given constellation of US, UR, and F (the prior on types) has a cheap-talk equilibrium with US⁢(α⁢(μ⁢(0)),0)=US⁢(aR⁢(0),0), then small perturbations to any of the three functions would lead to the assumption being satisfied.181818For example, in the uniform-quadratic case of CS, which is parameterized by a single number b>0 that measures the magnitude of conflict of interest, the assumption only excludes {b:b=12⁢K⁢(K+1)⁢ for some ⁢K∈ℕ∗}, which is a nowhere-dense set of zero Lebesgue measure.  The proof uses a result from Chen et al. (2008) that there is always a cheap-talk equilibrium where US⁢(α⁢(μ⁢(0)),0)>US⁢(aR⁢(0),0), under the assumption.  Pick any one of these; if k is sufficiently small, then it is an LSHP equilibrium for all types to pool just as in the cheap-talk equilibrium, using messages only in M1, with the Receiver responding to any m∉M1 with α⁢(m)=aR⁢(0).

3.6. Very Costly Talk.

Consider what happens as the intensity of lying cost, k, gets large.  A simple observation is that the possible gains from lying for any type are bounded in a PBE, since the range of the Receiver’s strategy in a PBE is contained in [aR⁢(0),aR⁢(1)].  Hence, for any t and any ε>0, any PBE satisfies ρ⁢(t)∈(rS⁢(t)−ε,rS⁢(t)+ε) if k is sufficiently large.  Since the type space is compact, it follows that when k is sufficiently large, any PBE is close to truth-telling.  Consequently, in a LSHP equilibrium, t¯ becomes arbitrarily close to inf{t:rS⁢(t)=1} as k→∞.  This implies that when all types have distinct cost-minimizing messages (so that rS is strictly increasing), there is just a single pool in an LSHP equilibrium when k is sufficiently large, since all types sufficiently close to 1 wish to be perceived as high a type as possible.

4. An Example and Application

To complement the somewhat abstract analysis thus far, this section works out a canonical example, providing some further analysis that may be useful for applications.  I then apply the results to the question of communication versus delegation (Dessein, 2002).

4.1. Example.

The example is based on the uniform-quadratic setting of CS that has been the workhorse for applied work: F⁢(t)=t, UR⁢(a,t)=−(a−t)2, and US⁢(a,t)=−(a−t−b)2 for some bias parameter b>0.  For the lying cost structure, assume that ν⁢(t)=t and C⁢(x,t)=−(x−t)2.191919It is not important what the message space is, so long as it satisfies the maintained assumptions.  For concreteness, one can suppose that for each t, Mt={t}×ℕ, so that M=[0,1]×ℕ.  As discussed in Section 2.1, this has the interpretation that the Sender’s message has two components: he reports an exact value about his type (which bears a lying cost) and a cheap-talk message.  In other words, the Sender’s lying cost is quadratic in the distance between his true type and the type he claims to be.  This specification satisfies all the maintained assumptions and, as will be seen, is tractable.  It implies that aS⁢(t)=t+b, aR⁢(t)=t, aR⁢(t,t′)=t+t′2, and rS⁢(t)=t.

The quadratic lying cost permits a closed-form solution for the separating function, ρ∗.  To derive it, first observe that the differential equation (DE) can be simplified to

ρ′⁢(t)=bk⁢(ρ⁢(t)−t). (9)

The reader may verify that the family of solutions to (9) is given by

−ρ⁢(t)−bk⁢ln⁡(bk+t−ρ⁢(t))=c, (10)

where c is a constant to be determined.  Since the separating function has the initial condition ρ∗⁢(0)=rS⁢(0)=0, it follows from (10) that c=−bk⁢ln⁡(bk).  Substituting this value of c into (10) and manipulating terms yields the following solution for the separating function:

e−kb⁢ρ∗⁢(t)=1−kb⁢(ρ∗⁢(t)−t). (11)

The upper bound on types that can separate using ρ∗, t¯ defined by ρ∗⁢(t¯)=1, can be solved for explicitly from (11) as

t¯=1−bk⁢(1−e−kb). (12)

It is straightforward to check that because k>0 and b>0, t¯∈(0,1), as predicted by Theorem 1.  Moreover, t¯ is increasing in kb and converges to 0 (resp. 1) as kb→0 (resp. ∞).  This confirms the intuition that the maximal feasible set of separation, [0,t¯], is larger when the cost of lying is larger relative to the conflict of interest.

The necessary conditions for LSHP equilibrium, (2) for the boundary types between pools and (3) for t¯>0, can be simplified for the current setting as follows:

tj+1−tj=t1−t0+4⁢j⁢b⁢ ⁢∀j∈{1,…,J−1}, (13)
−(t1−t¯2−b)2+b2=k⁢((1−t¯)2−(ρ∗⁢(t¯)−t¯)2)⁢ if ⁢t¯>0. (14)

Note that condition (13) is the well-known form that CS’s arbitrage condition takes under uniform prior and quadratic preferences.  Theorem 2 also implies that there is an LSHP equilibrium that satisfies

−(t12−b)2+b2≥k⁢ if ⁢t¯=0. (15)

This condition says when there are no separating types, type 0 weakly prefers pooling with [0,t1] and incurring message cost k (the cost of sending any message in M1 for type 0) to revealing itself at no cost.  Conversely, given any solution to (13)–(15), there is a corresponding LSHP equilibrium.

The next result focuses on LSHP equilibria with a single pool, for these are particularly tractable and permit clear comparative statics.  Condition (13) is vacuous in this case, and conditions (14) and (15) are simplified by setting t1=1.

Proposition 3.

In the leading example:

  1. (a)

    A single-pool LSHP equilibrium exists if and only if t¯≥1−4⁢b, or equivalently,

    ekb⁢(4⁢k−1)≥−1. (16)

    In particular, a single-pool LSHP equilibrium exists if either k≥14 or b≥14.

  2. (b)

    A single-pool LSHP equilibrium with t¯=0 (i.e., an uninformative LSHP equilibrium) exists if and only if b≥k+14.

  3. (c)

    All single-pool LSHP equilibria are essentially equivalent, i.e. they have the same cutoff type t¯.

  4. (d)

    If b≥14, all LSHP equilibria have a single pool and are essentially equivalent.

  5. (e)

    Fix any b>0 and let t¯⁢(k) denote the cutoff in single-pool LSHP equilibria as a function of k, defined on some interval K⊆ℝ++ given by (16).  Then t¯⁢(⋅) is continuous and increasing, strictly increasing at any k with t¯⁢(k)>0, and differentiable at all k∈I⁢n⁢t⁢e⁢r⁢i⁢o⁢r⁢(K)∖{b−14}.

The Proposition has a number of interesting implications.  Key is part (c), which assures that all single-pool LSHP equilibria have the same cutoff, and hence are essentially or outcome equivalent.  CS showed that under cheap talk, an informative equilibrium — one where no Receiver action has ex-ante probability one — exists if and only if b<14.  Part (d) of the Proposition implies that when cheap talk cannot be informative, all LSHP equilibria are essentially equivalent and have a single pool, although they are not necessarily uninformative.  Indeed, combining parts (a), (b), and (d), we see that for any positive lying cost intensity, there is a set of biases b∈[14,k+14) for which there would be no informative cheap-talk equilibrium but there is an informative and essentially unique LSHP equilibrium.  Part (b) of the Proposition also implies that if there is an informative cheap-talk equilibrium (b<14), all LSHP equilibria are informative.  Furthermore, part (a) of the Proposition implies that when cheap talk can be informative, there is a threshold k∗⁢(b)<14 such that for all k≥k∗⁢(b), there is a single-pool LSHP equilibrium, whereas for all k<k∗⁢(b), every LSHP equilibrium has multiple pools.202020It can also be shown that for any b>0, if k is small enough, every LSHP equilibrium has exactly N⁢(b) pools, where N⁢(b) is the maximal number of actions that can be induced in a cheap-talk equilibrium with bias b.  CS showed that N⁢(b) is the smallest integer greater than or equal to −12+12⁢(1+2b)12.  The last part of the Proposition provides a comparative static on single-pool LSHP equilibria: in particular, for any b>0, the unique cutoff is strictly increasing in k when the cutoff is strictly positive.  Hence, when the lying cost intensity increases, single-pool LSHP equilibria become more informative (when they exist) in the strong sense of refining the Receiver’s information partition.

4.2. Application: Communication versus Delegation.

Dessein (2002) raised the question of whether the Receiver can do better by delegating decision-making to the Sender, without any constraints, rather than communicating via cheap talk with him.  The tradeoff is one of “loss of information” under communication versus “loss of control” under delegation.  Dessein proved that which arrangement is better for the Receiver depends upon the magnitude of conflict: delegation is superior to cheap-talk communication if and only if the agent’s bias is sufficiently small.  In particular, in the uniform-quadratic setting of CS that is the focus of this section, delegation is preferred whenever cheap talk can be informative, i.e. whenever the bias is b<14.

The results derived in this paper so far suggest that when manipulating information may have some costs, whether delegation dominates communication or not will depend upon the cost intensity.  The discussion in Section 3.6 implies that for any given conflict of interest, communication strictly dominates delegation when k is large enough, even though there is always some loss of information under communication.  The more subtle and interesting question, though, is whether for every finite intensity of lying cost, delegation will dominate communication for all small enough conflicts of interest.  The issue is important for understanding whether the central organizational tradeoff identified by Dessein — loss of information versus control — remains relevant so long as information is at all manipulable.212121If information is not manipulable at all, or equivalently there are infinite lying costs, then as Dessein (2002, p. 831) noted, communication will be fully revealing and hence dominate delegation for all levels of bias.

For the parametric setting of this section, I am able to provide a sharp negative answer.  Following Dessein (2002), say that communication is superior to or dominates delegation if there is an equilibrium under communication in which the ex-ante welfare of the Receiver is strictly higher than under delegation.

Proposition 4.

In the leading example, there is a finite k^ such that for any k≥k^, communication is superior to delegation for all b>0.  In particular, if k≥14 and b∈(0,316), communication is superior to delegation.

To gain some intuition for the result, note that by the earlier discussion, the key issue is whether there exists some cost intensity for which communication dominates delegation for all small enough biases.  The answer is a priori unclear because, for any fixed level of lying cost (including cheap talk), both communication and delegation approach the first best as conflicts vanish.  Dessein (2002) showed that delegation is an order of magnitude superior to cheap-talk communication when conflicts are small.  This implies that since LSHP equilibria for any k>0 have one or more interval pools on the highest messages, delegation will be superior to communication if the set of pooling types is too large relative to the bias.  Therefore, for communication to dominate delegation requires that the region of separating types be large enough relative to the bias.  The proof of Proposition 4 shows that this is the case in single-pool LSHP equilibria for the relevant parameters.

Refer to caption
Figure 2. Receiver’s ex-ante welfare gain from communication over delegation as a function of the bias, b.  Highest curve is b2, corresponding to full-revelation under k=∞ (verifiable disclosure); next three are for single-pool LSHP equilibrium with k=1, k=0.5, and k=0.25 respectively; lowest curve is for most-informative equilibrium of cheap talk.

How large exactly must lying costs be in order for communication to dominate delegation for all biases?  Numerical analysis reveals that k≥14 is sufficient; recall from Proposition 3 that this is precisely the threshold cost intensity that guarantees existence of single-pool LSHP for all b.  Figure 2 graphs the difference in the Receiver’s ex-ante utility from communication over delegation as a function of b for different values of k.  The figure shows that for any k≥14, communication is superior to delegation for any b>0.  As k→∞, communication becomes close to fully revealing (which yields ex-ante utility 0 to the Receiver), hence the Receiver’s welfare difference between communication and delegation converges to −b2 (which is the Receiver’s utility under delegation).

5. Withholding Information and Verifiable Disclosure

The cheap-talk approach to strategic communication assumes that it is costless for the Sender to lie arbitrarily.  An alternative approach, initiated by Grossman (1981) and Milgrom (1981), is to assume that that the Sender can tell the truth or withhold information at no cost, but cannot lie.  A justification is that “there are penalties for perjury, false advertising or warranty violation that are sufficiently sure and heavy that false reporting never pays” (Milgrom and Roberts, 1986b, p. 19).  In the literature, this is often referred to as verifiable disclosure, or persuasion or partial-provability.  The classic result is that there is complete separation in every PBE (Seidmann and Winter, 1997), due to a well-known “unraveling argument.”222222In general, unraveling requires enough structure on preferences — satisfied by the CS assumptions on US and UR — and that each type be able to verifiably disclose itself if it wishes to.  This is in striking contrast with the cheap-talk prediction of no information revelation when there is a large enough conflict of interest between Sender and Receiver (Crawford and Sobel, 1982, Corollary 1).

Costly lying provides a framework to unify these divergent results.  However, the basic model I have studied has a limitation in this respect: it does not permit the Sender to withhold information freely, and to this extent, the model does not perfectly correspond to verifiable disclosure when k→∞.  Accordingly, this section develops an extension to accommodate the costless withholding of information.232323I am grateful to Yeon-Koo Che for prompting this extension.

5.1. A Simple Form of Withholding Information.

For this section, assume that ν⁢(t)=t and that rS⁢(t)=t, to provide a clear comparison with the standard verifiable disclosure setting.  Moreover, to avoid some tedious complications that do not add much insight, assume that the Sender always wishes to be thought of as the highest type, i.e. there is large bias.  This is the standard assumption in verifiable disclosure models, and as noted above, implies that cheap talk and verifiable disclosure generate polar predictions.

Augment the message space to now be M∗=M∪Mϕ, where M is as before, and Mϕ is a new set of one or more messages (i.e., |Mϕ|≥1 and Mϕ∩M=∅).  Assume that for any t and m∈Mϕ, C⁢(m,t)=C⁢(t,t),242424Writing C⁢(m,t) involves an abuse of notation, but is a convenient shorthand that should not cause any confusion. so that all messages in Mϕ∪Mt are equally costly for the Sender.  The rest of the model remains as before.  The set Mϕ can be viewed as a set of pure cheap-talk messages (it is without loss of generality to normalize C⁢(m,t)=0 for all m∈Mϕ and t), or as the Sender being silent, or otherwise freely withholding information.252525If one instead assumes that C⁢(t,t)>C⁢(m,t) for any t and m∈Mϕ, then the Sender’s cost of sending any m∉Mϕ has fixed and marginal components.  Although this formulation is not analyzed here, I note that when combined with “k=∞,” it yields a model akin to costly disclosure (e.g., Verrecchia, 1983), which has also been studied recently by Esö and Galambos (2008).  In this formulation, withholding information takes a particularly stark and simple form: at the limit as k→∞, the Sender is effectively choosing between either credibly revealing his true type, or sending a message that is costless to all types.  While this structure will be generalized shortly, it is convenient to start with this simple formulation, which I call the withholding model.

Consider first whether there can be full separation for any k.  Suppose there is such an equilibrium.  Any message in Mϕ can not be used by any t>0, for all lower types would mimic it.  This implies that separation of all types greater than zero must be achieved with non-withholding messages.  However, the argument of Theorem 1 can be extended to show that this is impossible.  Consequently, there must be pooling in equilibrium.  As it is not my goal to characterize every pooling equilibrium, some of which can be implausible,262626For example, there is always an uninformative equilibrium where all types send the same m∈Mϕ, and the Receiver responds to every message with aR⁢(0,1).  This can be ruled out by standard refinements such as Cho and Kreps’s (1987) D1 criterion, for any k>0 (and even weaker criteria for large k). I only show that LSHP equilibria can be extended in an obvious way to the current environment.

To state this precisely, start with any LSHP equilibrium strategy profile when withholding is not allowed.  Now consider a strategy profile in the withholding model where the Receiver responds to any withholding message, m∈Mϕ, with a maximally skeptical inference and plays α⁢(m)=aR⁢(0); in other respects, strategies are identical to the LSHP profile.  Call such a strategy profile an augmented LSHP profile.

Proposition 5.

An augmented LSHP profile is an equilibrium of the withholding model.

The reason is simple: given the Receiver’s play, telling the truth is always at least as good (strictly better if t>0) as withholding, since it costs the same and leads to a weakly preferred (strictly, if t>0) action.  Hence, for any lying cost intensity, arbitrarily large or small, there are equilibria with the following properties: there is lying on the equilibrium path (since a positive measure of types play m∈M1 in any LSHP equilibrium); there exists some t¯≥0 such that types in [t¯,1] form a single pool, claiming to be the highest type; all types below t¯ separate, but claim to be higher types than they truly are; withholding does not occur on the equilibrium path; and the Receiver responds to withholding with a maximally skeptical inference.  These last two properties are standard in the equilibria of verifiable disclosure games (e.g., Milgrom and Roberts, 1986b, Proposition 2), with the caveat that of course the lowest type could just as well fully disclose or withhold.

Proposition 5 implies that the insights of the original non-withholding model can be applied to the current environment.  Of particular interest are the limits as k→0 or k→∞.

Corollary 1.

When k≈0, any equilibrium in an augmented LSHP profile is uninformative, with all types pooling on some m∈M1.  As k→∞, any sequence of equilibria in augmented LSHP profiles has t¯→1 and, for all t, ρ⁢(t)→t.

Thus, at the cheap-talk limit of augmented LSHP equilibria, not only is there no information revealed,272727Note that since bias is assumed to be large, all cheap-talk equilibria are uninformative. but language is entirely inflated (all types claim to be the highest), whereas at the verifiable disclosure limit, there is full separation through truth-telling.  In this sense, the augmented LSHP equilibria provide a sensible spanning of the extreme cases both in terms of how much information is conveyed and the messages that are used.

5.2. Richer Forms of Withholding.

As previously noted, the withholding model discussed above is special because, at the limit of k→∞, the Sender has only two undominated choices: either completely withhold information about his type or completely reveal it.  Verifiable disclosure models often endow the Sender with a much richer set of choices, such as reporting that his type lies in any closed subset of the type space that contains his true type.  This is meant to capture the idea that the Sender can credibly reveal some information without revealing it all.  To consider such possibilities when lying costs are not infinite requires a specification of the cost of each such message for each type.  I will discuss a simple formulation which allows the previous analysis to extend.

Let 𝒯 be any set of closed subsets of T=[0,1], such that as for each t∈T, {t}∈𝒯.  The Sender is permitted to claim that his type lies in any element of 𝒯, i.e. for any X∈𝒯, there is a (non-empty) set of messages MX with the literal meaning “my type is in X.”  Let θ:𝒯×T→T be any function satisfying θ⁢(X,t)∈X and θ⁢(X,t)=t if t∈X.  Starting with the usual cost function that is defined for all precise statements (i.e., any singleton X∈𝒯), I extend it to each vague statement (i.e., any non-singleton X∈𝒯) by assuming that for any m∈MX, C⁢(m,t)=C⁢(θ⁢(X,t),t).  That is, the cost for the Sender of claiming that his type is in a set X is the same as the cost of claiming that his type is exactly θ⁢(X,t).  Note that by the assumed properties of θ, the cost for any type t of claiming to be in any set X∈𝒯 is the same as the cost of claiming to be t if and only if t∈X.282828The assumptions on θ⁢(⋅,⋅) can be weakened to relax this implication, but it would unnecessarily complicate the subsequent analysis.

The model without any withholding is the special case where 𝒯 consists only of singleton sets.  The withholding model discussed earlier is the case where 𝒯 consists of just the singletons and the set T, with θ⁢(T,t)=t for all t.  In general, one natural possibility for θ is that θ⁢(X,t)=arg⁢mint~∈X⁡|t~−t|.  This captures the idea that a vague statement is a lie to the extent it is a lie when given its most favorable interpretation, i.e. the distance of the true type to the closest point in X.  For any θ⁢(⋅,⋅), the Sender’s undominated choices at the limit of k→∞ are to claim that his type is in any X∈𝒯 such that θ⁢(X,t)=t, which is precisely any X∈𝒯 such that t∈X, just as in standard disclosure models.

The key to extending LSHP equilibria to this setting, for any lying cost intensity, is to have the Receiver respond to any message with the most skeptical inference among the set of types for whom that message is least costly.  Formally, pick any LSHP equilibrium profile when withholding is not available that satisfies α⁢(m)≥α⁢(m~) if m∈Mt and m~∈Mt~ for two types t≥t~.  (Such an LSHP equilibrium profile exists by the proof of Theorem 2.)  The profile specifies the Receiver’s response, α⁢(m), for any m∈MX with |X|=1.  Extend α to vague messages as follows: for any m∈MX with |X|>1, α⁢(m)=α⁢(m~) for some m~∈Mmin⁡X.  In other words, if the Sender claims to be in a non-singleton set X, the Receiver responds by taking some action that she would in response to a claim that the Sender is the lowest type in X.292929The reader may wonder why not use a simpler construction where the Receiver plays α⁢(m)=aR⁢(0) if m∈MX with |X|>1.  The reason is that even though this simpler construction will also be an equilibrium, it will not satisfy standard refinements (such as the D1 criterion) for all k.  In particular, as k→∞, it requires the Receiver to form the implausible belief that the Sender is type 0 upon observing any vague message, even if it is prohibitively costly for type 0 to send that message.  The construction in the text is not vulnerable to this objection; rather, beliefs as k→∞ converge to equilibrium beliefs of the verifiable disclosure game. To see that this extended LSHP profile is an equilibrium for any k, suppose to contradiction that m∈MX is a profitable deviation for a type t.  By construction, there exists m~∈Mmin⁡X such that α⁢(m)=α⁢(m~).  If t≤min⁡X, C⁢(m,t)=C⁢(θ⁢(X,t),t)≥C⁢(m~,t), hence m~ is a profitable deviation, a contradiction since we started with an LSHP equilibrium profile.  If t>min⁡X, then any m′∈Mt is a profitable deviation, because C⁢(m′,t)≤C⁢(m,t) and α⁢(m′)≥α⁢(m)=α⁢(m~), also a contradiction since we started with an LSHP equilibrium profile.

6. Conclusion

This paper has studied a model of communication between an informed Sender and an uninformed Receiver, where the Sender has a cost of lying or misrepresenting his private information in certain ways.  These costs on the Sender may stem from various sources, such as technological, legal, or psychological constraints.  The main results show that inflated language naturally arises in this environment, where the Sender (almost) always claims to be a higher type than he would under complete information.  Regardless of the intensity of lying cost, there is incomplete separation, with some pooling on the highest messages.  How much information is revealed is a function of the intensity of lying cost.  An extension of the basic model to allow costless withholding of information provides a unified framework to embed both cheap talk and verifiable disclosure as limiting cases.

The basic finding that lying costs enlarge the scope for direct communication to reduce the costs of asymmetric-information-based incentive problems is, on one hand, not surprising, but on the other hand, likely important in a wide variety of economic problems.  A formal framework and analysis such as that developed may be useful in applications where it is important to understand exactly how incentive constraints are relaxed.

Section 4 provided one such example, focussing on the interaction between preference conflicts and lying costs.  In an influential paper, Dessein (2002) argued that when a decision-maker or principal is faced with a biased but better-informed agent, unconstrained delegation of decision-making is better than cheap-talk communication whenever the conflict of interests are not too large.  I have shown that in the simple but canonical setting of Section 4, if misrepresentation costs are even moderately large, this conclusion is reversed: the principal prefers to communicate than delegate regardless of how small the conflict of interest is, even though communication necessarily entails some loss of information.  Besides matters of generalization, this raises a number of substantive questions.  For example, Ivanov (2007) has shown that the principal is better off restricting the precision of the agent’s information compared to either delegation or cheap-talk communication.  Plainly, the magnitude of misrepresentation costs will have a significant effect on how beneficial such “information control” is.  In the limiting case of verifiable information or infinite lying costs, the principal would strictly prefer to not restrict information at all.  Whether information control is valuable whenever lying costs have finite intensity, and if so, how this control should be structured are open questions.

The fact that lying costs can mitigate inefficiencies resulting from asymmetric information suggests that applications to negotiation and bargaining will also be fruitful.  For example, Valley et al. (2002) document striking experimental evidence that subjects in double auctions achieve greater efficiency given pre-play communication than the theoretical limits derived by Myerson and Satterthwaite (1983).303030I thank Vince Crawford for this reference.  Importantly, the subjects do significantly better when communication is face-to-face than through written messages, which Valley et al. (2002) largely attribute to their evidence that subjects misrepresent valuations substantially less in face-to-face communication than in written messages.  It seems plausible that the more direct the interface of communication, the more costly (difficult, uncomfortable, etc.) it is to lie.  Accordingly, these empirical findings may be organized by a framework such as that developed here, although a model adapted to the bargaining environment would yield more finely-tuned insights.

Appendix A: Proofs

Proof of Lemma 1. By hypothesis, types (tl,th) are separating in a monotone PBE with mapping ρ.  If ρ is constant on some interval X⊆(tl,th), then some t∈X can profitably deviate and mimic a slightly higher type t+ε∈X, contradicting equilibrium separation; hence ρ must be strictly increasing on (tl,th).  This implies that for any t∈(tl,th), ρ⁢(t)∈(0,1).  Separation requires that for each t∈(tl,th), t must be a solution to (1).  If ρ is differentiable on (tl,th), then the first order condition obtained by differentiating (1) is (DE), as required.  So it suffices to prove that ρ is differentiable on (tl,th).  This is done in series of steps.

Claim: ρ⁢(t)≠rS⁢(t) for all t∈(tl,th).

Proof: Suppose there exists a t^∈(tl,th) such that ρ⁢(t^)=rS⁢(t^).  Without loss, we can assume that rS⁢(t^)∈(0,1), because otherwise ρ cannot be strictly increasing on (tl,th).  This implies that

C1⁢(ν⁢(rS⁢(t^)),t^)=0. (A-1)

Define g⁢(ε) as the expected utility gain for a type t^−ε by deviating from ρ⁢(t^−ε) to ρ⁢(t^).  Since we are on a separating portion of the type space when |ε| is small,

g⁢(ε)=[US⁢(aR⁢(t^),t^−ε)−k⁢C⁢(ν⁢(rS⁢(t^)),t^−ε)]−[US⁢(aR⁢(t^−ε),t^−ε)−k⁢C⁢(ν⁢(ρ⁢(t^−ε)),t^−ε)].

Since C⁢(ν⁢(ρ⁢(t^−ε)),t^−ε)≥C⁢(ν⁢(rS⁢(t^−ε)),t^−ε),

g⁢(ε)≥ϕ⁢(ε) := [US⁢(aR⁢(t^),t^−ε)−k⁢C⁢(ν⁢(rS⁢(t^),t^−ε))]−
[US⁢(aR⁢(t^−ε),t^−ε)−k⁢C⁢(ν⁢(rS⁢(t^−ε)),t^−ε)].

ϕ is differentiable in a neighborhood of 0, and has derivative

ϕ′⁢(ε) = −U2S⁢(aR⁢(t^),t^−ε)+k⁢C2⁢(ν⁢(rS⁢(t^)),t^−ε)−k⁢C1⁢(ν⁢(rS⁢(t^−ε)),t^−ε)⁢ν′⁢(rS⁢(t^)−ε)⁢r1S⁢(t^−ε)
−k⁢C2⁢(ν⁢(rS⁢(t^−ε)),t^−ε)+U1S⁢(aR⁢(t^−ε),t^−ε)⁢a1R⁢(t^−ε)+U2S⁢(aR⁢(t^−ε),t^−ε).

Observe that ϕ⁢(0)=0 and ϕ′⁢(0)=U1S⁢(aR⁢(t^),t^)⁢a1R⁢(t^)>0 (using (A-1)).  Hence, for small ε>0, g⁢(ε)≥ϕ⁢(ε)>0, implying that a type t^−ε strictly prefers to imitate t^, contradicting equilibrium separation of t^. ⋄

Claim: ρ⁢(t)>rS⁢(t) for all t∈(tl,th).

Proof: Suppose not.  By the previous Claim, there exists a t′∈(tl,th) such that ρ⁢(t′)<rS⁢(t′).  By monotonicity of ρ, ρ⁢(t′−ε)<ρ⁢(t′) for all ε>0.  It follows that for small enough ε>0, C⁢(ν⁢(ρ⁢(t′−ε)),t′−ε)>C⁢(ν⁢(ρ⁢(t′)),t′−ε).  On the other hand, for small enough ε>0, US⁢(aR⁢(t′),t′−ε)>US⁢(aR⁢(t′−ε),t′−ε).  Therefore, for small enough ε>0, a type t′−ε strictly prefers to imitate t′, contradicting equilibrium separation of t′. ⋄

Claim: ρ is continuous on (tl,th).

Proof: Suppose there is a discontinuity at some t^∈(tl,th).  First assume ρ(t^)<limt↓t^ρ(t)=:ρ¯.  By the continuity of C and ν, and the monotonicity of ρ, as ε↓0,

C⁢(ν⁢(ρ⁢(t^+ε)),t^+ε)−C⁢(ν⁢(ρ⁢(t^)),t^+ε) → C⁢(ν⁢(ρ¯),t^)−C⁢(ν⁢(ρ⁢(t^)),t^)>0,

where the inequality above follows from ρ¯>ρ⁢(t^)≥rS⁢(t^).  On the other hand, US⁢(aR⁢(t^+ε),t^+ε)−US⁢(aR⁢(t^),t^+ε)→0 as ε↓0; hence, for small enough ε>0, t^+ε prefers to imitate t^, contradicting equilibrium separation.

The argument for the other case where ρ⁢(t^)>limt↑t^ρ⁢(t) is similar, establishing that t^ prefers to imitate t^−ε for small enough ε>0. ⋄

Claim: ρ is differentiable on (tl,th).

Proof: Given the previous claims that ρ is continuous and does not intersect rS on (tl,th), one can replicate the argument of Mailath (1987, Proposition 2 in Appendix). ⋄  ∎

The following Lemma is used in the proof of Theorem 1 and proves uniqueness of the separating function.

Lemma A.1.

Fix any t0∈[rS⁢(0),1].  There is a unique solution to the problem of finding a t¯∈[0,1] and ρ:[0,t¯]→[0,1] such that (i) ρ is strictly increasing and continuous on [0,t¯], (ii) ρ⁢(0)=t0, (iii) ρ solves (DE) on (0,t¯), and (iv) ρ⁢(t¯)=1 if t¯<1.  Moreover, t¯=0 if rS⁢(0)=1, otherwise t¯∈(0,min⁡{t:rS⁢(t)=1}).

Proof.

If rS⁢(0)=1, the Lemma is trivial, so assume rS⁢(0)<1.  Since C1⁢(ν⁢(rS⁢(t)),t)=0 for all t such that rS⁢(t)∈(0,1), there is no Lipschitz condition on (DE) on the relevant domain, in particular even locally if t0=rS⁢(0).  Thus, standard results on differential equations do not apply.  Instead, I proceed as follows, building on Mailath (1987).

Step 1: (Local existence and uniqueness.) Consider the inverse initial value problem to find τ⁢(t^) such that:

τ′=g⁢(t^,τ):=k⁢C1⁢(ν⁢(t^),τ)⁢ν′⁢(t^)U1S⁢(aR⁢(τ),τ)⁢a1R⁢(τ)⁢, ⁢τ⁢(t^0)=0. (A-2)

By the assumptions on C, ν, and US, g is continuous and Lipschitz on [0,1]×[0,1].  Hence, standard theorems (e.g. Coddington and Levinson, 1955, Theorem 2.3, p. 10) imply that there is a unique location solution, τ~, to (A-2) on [t^0,t^0+δ), for some δ>0; moreover, τ~∈𝒞1⁢([t^0,t^0+δ)).313131𝒞1⁢([a,b)) is the set of all Real-valued functions on [a,b) that have a continuous derivative at all t^∈(a,b) and in addition have a right-hand derivative at a that is continuous from the right at a.  Inverting τ~ gives a strictly increasing ρ~ on [0,t~) such that ρ~⁢(0)=t0, ρ~ solves (DE) on (0,t~), and ρ~∈𝒞1⁢([0,t~)).  Note that ρ~⁢(t)>rS⁢(t) for all t∈(0,t~).  Since the inverse of any increasing local solution to (DE) is a local solution to (A-2) on [rS⁢(0),rS⁢(0)+η) for some η>0, local uniqueness of an increasing solution to (DE) follows from the fact that τ~ is the unique local solution to (A-2) above rS⁢(0).

Step 2: (ρ~ is bounded away from rS above 0.) Suppose ρ~ is a solution to (DE) on [0,δ), with ρ~∈𝒞1⁢([0,δ)) and ρ~′>0.  Let tδ:=limt↑δρ~⁢(t).  I claim that tδ>rS⁢(δ).  This is obviously true if rS⁢(δ)=0, so assume rS⁢(δ)>0, and tδ≤rS⁢(δ), towards contradiction.  We must have tδ=rS⁢(δ) (because ρ~⁢(t)>rS⁢(t) for all t∈(0,δ)) and limt↑δρ~′⁢(t)=∞.  Let z:=max⁡r1S⁢(t).  By the assumptions on C⁢(⋅,⋅), z<∞.  Since ρ~∈𝒞1⁢([0,δ)), there exists t1⁢(0,δ) such that ρ~′⁢(t)>z for all t∈[t1,δ).  Pick ε>0 such that ρ~⁢(t1)>rS⁢(t1)+ε.  We have

tδ = ρ~⁢(t1)+limt↑δ∫t1tρ~′⁢(y)⁢𝑑y
> rS⁢(t1)+ε+∫t1δρ~′⁢(y)⁢𝑑y
> rS⁢(t1)+ε+∫t1δr1S⁢(y)⁢𝑑y
= rS⁢(δ)+ε,

which contradicts tδ=rS⁢(δ).

Step 3: The proof is completed as follows.  If ρ~ is defined on [0,δ) with limt↑δρ~⁢(t)<1, then by the previous step, U1S⁢(aR⁢(t),t)⁢a1R⁢(t)k⁢C1⁢(r,t) is continuous, Lipschitz, and bounded in a neighborhood of (δ,limt↑δρ~⁢(t)), hence standard theorems (e.g. Coddington and Levinson, 1955, Theorem 4.1 and preceeding dicussion, p. 15) imply that there is a unique extension of ρ~ to [0,δ+η) for some η>0; this extension is strictly increasing, in 𝒞1⁢([0,δ+η)), and by the previous step, limt↑δ+ηρ~⁢(t)>rS⁢(δ+η).  Now let t¯:=sup{x:ρ~ can be extended to [0,x)}).  Clearly, t¯∈(0,min⁡{t:rS⁢(t)=1}).  Moreover, we must have limt↑t¯ρ~⁢(t)=1, for otherwise ρ~ can be extended beyond t¯.  We are done by setting ρ~⁢(t¯)=1. ∎

Proof of Theorem 1. Suppose there is a separating monotone equilibrium, (α,μ).  By Lemma 1, the induced map ρ=Ψ∘α solves (DE) on (0,1).  Let t0:=limt↓0ρ⁢(t).  Since ρ⁢(t)>rS⁢(t) for all t∈(0,1), t0≥rS⁢(0).  However, by Lemma A.1, there is no solution on [0,1) to the initial value problem given by ρ⁢(0)=t0 and (DE) on (0,1), a contradiction.  ∎

The following Lemma is used in the proof of Theorem 2.

Lemma A.2.

There exists t¯∈[0,t¯] and a strictly increasing sequence, ⟨t0=t¯,t1,…,tJ=1⟩, that solve (4), (5), and (6).  Moreover, if rS⁢(0)<rS⁢(1) and k is large enough, this is true with some t¯>0.

Proof.

The proof is constructive.

Step 0: Preliminaries.

Start by defining the function

ϕ⁢(t):=US⁢(aS⁢(t),t)−k⁢C⁢(ν⁢(1),t)−[US⁢(aR⁢(t),t)−k⁢C⁢(ν⁢(ρ∗⁢(t)),t)].

ϕ⁢(t) is the utility gain for type t from sending a message in M1 and receiving its ideal action over separating itself (thus inducing aR⁢(t)) with a message in Mρ∗⁢(t).  Note that in an LSHP equilibrium, the gain from pooling over separating can be no more than ϕ⁢(t), and will generally be strictly less.  There are two conceptually distinct cases: one where ϕ⁢(t)=0 for some t≤t¯, and the other where ϕ⁢(t)>0 for all t≤t¯.  Define

t^:={0if ⁢ϕ⁢(t)>0⁢ for all ⁢t≤t¯,supt∈[0,t¯]{t:ϕ⁢(t)=0}⁢ otherwise.

ϕ is continuous and ϕ⁢(t¯)>0; hence t^<t¯ and for all t∈(t^,t¯], ϕ⁢(t)>0.  In everything that follows, we are only concerned with t∈[t^,t¯].  So statements such as “for all t” are to be read as “for all t∈[t^,t¯]” and so forth unless explicitly specified otherwise.

Step 1: Constructing the necessary sequences.

Initialize p0l⁢(t)=p0r⁢(t)=t, and a0l⁢(t)=a0r⁢(t)=aR⁢(t).  Define

Δ⁢(a,t):=US⁢(a,t)−k⁢C⁢(ν⁢(1),t)−[US⁢(aR⁢(t),t)−k⁢C⁢(ν⁢(ρ∗⁢(t)),t)].

Clearly, Δ is continuous in both arguments, and strictly concave in a with a maximum at aS⁢(t).  Since Δ⁢(aR⁢(t),t)≤0 ≤Δ⁢(aS⁢(t),t) for all t∈[t^,t¯], it follows that for any such t, in the domain a∈[aR⁢(t),aS⁢(t)] there exists a unique solution to Δ⁢(a,t)=0.  Call this a1l⁢(t).  Similarly, on the domain a∈[aS⁢(t),∞), there exists a unique solution to Δ⁢(a,t)=0.  Call this a1r⁢(t).  By continuity of Δ, a1l and a1r are continuous, a1l⁢(t¯)=a0r⁢(t¯), and a1r⁢(t^)=a1l⁢(t^)=aS⁢(t^) if t^>0.  By the monotonocity of aR⁢(⋅,⋅), for q∈{l,r} and t, there is either no solution or a unique t′ that solves aR⁢(t,t′)=a1q⁢(t).  If there is a solution, call it p1q⁢(t), otherwise set p1q⁢(t)=1.  It is straightforward that p1l and p1r are continuous functions, p1l⁢(t)≥p0l⁢(t) with equality if and only if t=t¯, and p1r⁢(t)>p0r⁢(t).  Note that p1r⁢(t)≥p1l⁢(t), and p1l⁢(t^)=p1r⁢(t^) if t^>0.

For j≥2 and q∈{l,r}, recursively define pjq⁢(t) as the solution to

US⁢(aR⁢(pj−1q⁢(t),pjq⁢(t)),pj−1q⁢(t))−US⁢(aR⁢(pj−2q⁢(t),pj−1q⁢(t)),pj−1q⁢(t))=0

if a solution exists that is strictly greater than pj−1q⁢(t), and otherwise set pjq⁢(t)=1.  By the monotonicity of aR and U11S<0, pjq⁢(t) is well-defined and unique.  Define ajq⁢(t):=aR⁢(pj−1q⁢(t),pjq⁢(t)).   Note that for all j≥2, pjq⁢(t)>pj−1q⁢(t) and ajq⁢(t)>aj−1q⁢(t) if and only if pj−1q⁢(t)<1.  For all j and q∈{l,r}, pjq⁢(t) is continuous, pjr⁢(t)≥pjl⁢(t) for all t, pjl⁢(t^)=pjr⁢(t^) if t^>0, and pj+1l⁢(t¯)=pjr⁢(t¯) (these follow easily by induction, given that we noted all these properties for j=1).

Step 2: The critical segment B.

I claim there exists B≥1 such that pB−1r⁢(t¯)<1=pBr⁢(t¯). (Obviously, if it exists, it is unique.)  To see this, first note that by definition, p0r⁢(t¯)=t¯<1.  Let K¯=inf{K:pKr⁢(t¯)=1}.323232Recall that the infimum of an empty set is +∞.  It is sufficient to show that ∃ε>0 such that for any j<K¯, |aj+1r⁢(t¯)−ajr⁢(t¯)|≥ε.  By construction, ajr⁢(t¯)<aS⁢(pjr⁢(t¯))<aj+1r⁢(t¯) and ajr⁢(t¯)≤aR⁢(pjr⁢(t¯))≤aj+1r⁢(t¯).  Since mint∈[0,1]⁡|aS⁢(t)−aR⁢(t)|>0, we are done.

Step 3: Existence when t^>0.

Consider the functions pBl and pBr.  These are continuous, and pBl⁢(t¯)=pB−1r⁢(t¯)<1=pBr⁢(t¯).  Moreover, pBl⁢(t^)=pBr⁢(t^); hence either pBl⁢(t^)=1 or pBr⁢(t^)<1 .  It follows that there is some type t~∈[t^,t¯] such that either (i) pBl⁢(t~)=1 and pBl⁢(t)<1 for all t>t~; or (ii) pBr⁢(t~)=1 and pBr⁢(t)<1 for all t<t~.  Let q=l if (i) is the case; q=r if (ii) is the case.  By construction, setting t¯=t~ and tj=pBq⁢(t~) for j=1,…,B satisfies the needed properties.

Step 4: Existence when t^=0.

By the continuity of pBl and pBr, the logic in Step 3 can fail when t^=0 only if pBl⁢(0)<1=pBr⁢(0).  So suppose this is the case.  Note that this requires p1l⁢(0)<p1r⁢(0).  For any t∈[p1l⁢(0),p1r⁢(0)], US⁢(aR⁢(0,t),0)−k⁢C⁢(1,0)−[US⁢(ar⁢(0),0)−k⁢C⁢(0,0)]≥0, with strict inequality for interior t.  In words, when t∈[p1l⁢(0),p1r⁢(0)], type 0 weakly prefers (indifference at the endpoints and strict preference for interior t) inducing aR⁢(0,t) with a message in M1 over inducing aR⁢(0) with message in MrS⁢(0).  This follows from the construction of p1l and p1r, and U11S<0.  Given any t∈[0,1], define τ0⁢(t)=0, τ1⁢(t)=t, and recursively, for j≥2, τj⁢(t) as the solution to

US⁢(aR⁢(τj−1⁢(t),τj⁢(t)),τj−1⁢(t))−US⁢(aR⁢(τj−2⁢(t),τj−1⁢(t)),τj−1⁢(t))=0

if a solution exists that is strictly greater than τj−1⁢(t), and otherwise set τj⁢(t)=1.  It is straightforward that for all j≥0, τj⁢(t) is continuous in t.  Since τB⁢(p1l⁢(0))=pBl⁢(0)<1=pBr⁢(0)=τB⁢(p1r⁢(0)), it follows that t~=mint∈[p1l⁢(0),p1r⁢(0)]⁡{t:τB⁢(t)=1} is well-defined and lies in (p1l⁢(0),p1r⁢(0)].  By construction, setting t¯=0 and tj=τj⁢(t~) for j=1,…,B satisfies the needed properties.

Finally, the proof of the Lemma is completed by noting that t^>0 for all k large enough if rS⁢(0)<rS⁢(1), because t¯>0 if rS⁢(0)<rS⁢(1) and ϕ⁢(0)<0 for all k large enough in this case. ∎

Proof of Theorem 2.

The necessity of (4) and (5) follows from the discussion in the text preceding the Theorem.  Fix any t¯≥0 and a strictly increasing sequence ⟨t0=t¯,t1,…,tJ=1⟩ that satisfy conditions (4), (5), and (6).  I will show that there is a corresponding LSHP equilibrium.  This suffices to prove the Theorem because of Lemma A.2.

I first define the strategy profile.  Based on the discussion in the main text preceding the Theorem, the Sender’s strategy, μ, is clear, with the only possible ambiguity being for types t0,…,tJ−1: assume for concreteness that they “pool up” rather than “down” (so type t¯ does not separate).  Let Mμ:=⋃tμ⁢(t) be the set of messages used in this strategy.  It is clear what the Receiver’s response, α⁢(m), must be for any m∈Mμ.  For any m∉Mμ, the Receiver plays as follows:

  1. (1)

    For any m∈Mt∖Mμ with t<rS⁢(0), α⁢(m)=aR⁢(0).

  2. (2)

    For any m∈Mt∖Mμ with t∈[ρ∗⁢(0),ρ∗⁢(t¯)), α⁢(m)=aR⁢((ρ∗)−1⁢(t)).

  3. (3)

    For any m∈Mt∖Mμ with t∈[ρ∗⁢(t¯),1), α⁢(m)=aR⁢(t¯).

  4. (4)

    For any m∈M1∖Mμ, α⁢(m)=aR⁢(t¯,t1).

I now argue that (μ,α) as constructed above is an LSHP equilibrium.  Obviously, μ is an LSHP strategy and α is optimal given beliefs that are derived by Bayes rule on the equilibrium path.  So it only needs to be shown that μ is optimal for the Sender.

No type t≥t¯ has a profitable deviation to some m∈M1, because α⁢(m)=aR⁢(t0,t1) for any m∈M1∖Mμ and US⁢(α⁢(μ⁢(t)),t)≥US⁢(aR⁢(tj−1,tj),t) for all j=1,…,J since (3) holds for each tj (j=1,…,J) and U12S>0.  This logic also implies that if any t<t¯ has a profitable deviation to some m∈M1, it has a profitable deviation to some m∈M1∩Mμ.  Note also that if any type has a profitable deviation to some m∈Mt where t<rS⁢(0), then it has a profitable deviation to some m~∈MrS⁢(0), because m~ is cheaper than m for all types, and they both lead to the same action, α⁢(m)=α⁢(m~)=aR⁢(0).

Claim: Assume t¯=0.  Then no type has a profitable deviation to any m∈⋃t∈[rS⁢(0),1)Mt.

Proof: By Lemma A.2, type 0 does not have a profitable deviation to any m∈M∖M1.  So I prove the result by showing that if some type has a profitable deviation to some m∈⋃t∈[rS⁢(0),1)Mt, then type 0 has a profitable deviation to m.  For this, it suffices to show that if t>0 and t^∈[rS⁢(0),1), then

US⁢(aR⁢(0),t)−k⁢C⁢(ν⁢(t^),t) > US⁢(α⁢(μ⁢(t)),t)−k⁢C⁢(ν⁢(1)⁢(t),t)
⇓
US⁢(aR⁢(0),0)−k⁢C⁢(ν⁢(t^),0) > US⁢(α⁢(μ⁢(0)),0)−k⁢C⁢(ν⁢(1),0).

Fix a t>0 and t^∈[rS⁢(0),1).  Since t¯=0, we have

US(α(μ(t)),t)−kC(ν(1),t)≥US(α(μ(0),t)−kC(ν(1),t),

and hence it suffices to show that

US⁢(aR⁢(0),0)−k⁢C⁢(ν⁢(t^),0)−[US⁢(α⁢(μ⁢(0)),0)−k⁢C⁢(ν⁢(1),0)]
>US⁢(aR⁢(0),t)−k⁢C⁢(ν⁢(t^),t)−[US⁢(α⁢(μ⁢(0)),t)−k⁢C⁢(ν⁢(1),t)].

This inequality can be rewritten as

∫aR⁢(0)α⁢(μ⁢(0))∫0tU12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(t^)ν⁢(1)∫0tC12⁢(y,z)⁢𝑑z⁢𝑑y,

which holds because C12<0<U12S. ⋄

Claim: Assume t¯>0.  Type t¯ is indifferent between playing μ⁢(t) and playing any m∈Mρ∗⁢(t)∖Mμ, but strictly prefers μ⁢(t) to any m∈Mμ∖{Mρ∗⁢(t)∪M1}. Any t≠t¯ strictly prefers μ⁢(t) to any m∈Mμ∖Mρ⁢(t).

Proof: The indifference property for type t¯ is proved by two observations: if ρ∗⁢(t¯)<1, then it is immediate from Lemma A.2 and that α⁢(m)=aR⁢(t¯) for all m∈Mρ∗⁢(t); on the other hand, if ρ∗⁢(t¯)=1, then for any m∈Mρ∗⁢(t)∖Mμ, α⁢(μ⁢(t))=α⁢(m)=aR⁢(t¯,1) and μ⁢(t) and m have the same cost.  Note that if ρ∗⁢(t¯)=1, Lemma A.2 implies that US⁢(aR⁢(t¯,t1),t¯)=US⁢(aR⁢(t¯),t¯).

Equation (⁢DE⁢) implies that for all t∈(0,t¯),

U1S⁢(aR⁢(t),t)⁢d⁢aRd⁢t⁢(t)−k⁢C1⁢(ν⁢(ρ∗⁢(t)),t)⁢ν′⁢(ρ∗⁢(t))⁢d⁢ρ∗d⁢t⁢(t)=0.

Since U12S>0>C12, this implies that for any t~<t∈(0,t¯),

U1S⁢(aR⁢(t),t~)⁢d⁢aRd⁢t⁢(t)−k⁢C1⁢(ν⁢(ρ∗⁢(t)),t~)⁢ν′⁢(ρ∗⁢(t))⁢d⁢ρ∗d⁢t⁢(t)<0.

Therefore, by continuity, any t≤t¯ strictly prefers μ⁢(t) to any m∈⋃t^≤t¯Mρ∗⁢(t^)∖M1.

To show that any t<t¯ strictly prefers μ⁢(t) to any m∈M1, pick any such t.  The highest utility for t when constrained to sending m∈M1 is attained by sending μ⁢(t¯). From the previous arguments,

US⁢(α⁢(μ⁢(t)),t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)>US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(ρ⁢(t¯)),t),

and hence it suffices to show that

US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(ρ⁢(t¯)),t)≥US⁢(α⁢(μ⁢(t¯)),t)−k⁢C⁢(ν⁢(1),t). (A-3)

Since US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯)=US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯), (A-3) is true if

US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯)−[US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯)]
>US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(ρ⁢(t¯)),t)−[US⁢(α⁢(μ⁢(t¯)),t)−k⁢C⁢(ν⁢(1),t)],

which can be rewritten as

∫aR⁢(t¯)aR⁢(t¯,t1)∫tt¯U12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(ρ∗⁢(t¯))ν⁢(1)∫tt¯C12⁢(y,z)⁢𝑑z⁢𝑑y,

which holds since U12S>0>C12.

The argument for types t>t¯ strictly preferring μ⁢(t) to any m∈Mμ∖M1 is analogous to above. ⋄

Claim: Assume t¯>0.  No type has a profitable deviation to any m∈⋃t∈[ρ∗⁢(t¯),1)Mt.

Proof: The result is vacuously true if ρ∗⁢(t¯)=1, so assume that ρ∗⁢(t¯)<1.  Any m∈⋃t∈[ρ∗⁢(t¯),1)Mt is responded to with α⁢(m)=aR⁢(t¯), hence when constrained to such messages, any type t≤t¯ maximizes utility by sending an m∈Mρ∗⁢(t), because ρ∗⁢(t¯)>rS⁢(t).  However, by the previous Claim, all t≤t¯ weakly prefer playing μ⁢(t) to any m∈Mρ∗⁢(t).  This proves the claim for any t≤t¯.

To prove the claim for all t>t¯, it suffices to show that if t>t¯ has a profitable deviation to an m∈⋃t∈[ρ∗⁢(t¯),1)Mt, then type t¯ has a profitable deviation to m, since the latter is not possible.  To prove this, it suffices to show that for any t>t¯ and t^∈[ρ∗⁢(t¯),1),

US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(t^),t) > US⁢(α⁢(μ⁢(t)),t)−k⁢C⁢(ν⁢(1),t)
⇓
US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(t^),t¯) > US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯).

Fix a t>t¯ and t^∈[ρ∗⁢(t¯),1).  Since US⁢(α⁢(μ⁢(t)),t)≥US⁢(α⁢(μ⁢(t¯)),t), it suffices to show that

US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(t^),t) > US⁢(α⁢(μ⁢(t¯)),t)−k⁢C⁢(ν⁢(1),t)
⇓
US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(t^),t¯) > US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯).

This is true if

US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(t^),t¯)−[US⁢(α⁢(μ⁢(t¯)),t¯)−k⁢C⁢(ν⁢(1),t¯)]
> US⁢(aR⁢(t¯),t)−k⁢C⁢(ν⁢(t^),t)−[US⁢(α⁢(μ⁢(t¯)),t)−k⁢C⁢(ν⁢(1),t)],

which can be be rewritten as

∫aR⁢(t¯)α⁢(μ⁢(t¯))∫t¯tU12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(t^)ν⁢(1)∫t¯tC12⁢(y,z)⁢𝑑z⁢𝑑y,

which is true because U12S>0>C12. ⋄

The above claims establish that μ is optimal for the Sender, completing the proof.  ∎

Proof of Proposition 1. Large bias implies that for any t, US⁢(⋅,t) is strictly increasing on [aR⁢(0),aR⁢(1)].  Hence there cannot be multiple pools in an LSHP equilibrium because all pools use messages in M1, imposing the same direct message cost on any type, whereas higher actions are strictly preferred by all types.

Necessity of (7) for t¯>0 is straightforward, since if it does not hold, continuity implies that for small enough ε>0, either some type t¯−ε will deviate from μ⁢(t¯−ε) to μ⁢(t¯), or t¯ will deviate from μ⁢(t¯) to μ⁢(t¯−ε).  Sufficiency of (7) with t¯∈(0,t¯) for an LSHP equilibrium follows from the observation that such a t¯ and (trivial) sequence ⟨t0=t¯,t1=1⟩ satisfies and (4) and (5), and therefore the equilibrium construction of Theorem 2 applies.

Similarly, (8) must hold for an LSHP equilibrium with t¯=0, since otherwise type 0 will deviate to some m∈rS⁢(0).  It is sufficient because then t¯=0 and the (trivial) sequence ⟨t0=t¯=0,t1=1⟩ satisfies (4) and (6).  ∎

Proof of Proposition 2. Chen et al. (2008, Proposition 1) show that there is always a strictly increasing sequence ⟨t0=0,t1,…,tJ=1⟩ (J≥1) such that for j=1,…,J, tj satisfies (3), and moreover, US⁢(aR⁢(t0,t1),0)≥US⁢(aR⁢(0),0).  Under the Proposition’s assumption, we cannot have US⁢(aR⁢(t0,t1),0)=US⁢(aR⁢(0),0).  This implies that for all k sufficiently small enough, the sequence ⟨t0=0,t1,…,tJ=1⟩ (J≥1) combined with t¯=0 satisfies (4) and (6), and therefore the equilibrium construction of Theorem 2 applies.  ∎

The following Lemma is used in the proof of Proposition 3; it shows that when k increases, the separating function decreases pointwise.

Lemma A.3.

Assume rS⁢(0)<rS⁢(1).  Fix k1<k2, and let ρ1 and ρ2 denote the separating function when k=k1 and k=k2 respectively, with respective domains [0,t1] and [0,t2].  Then t2>t1 and for all t∈(0,t1], ρ2⁢(t)<ρ1⁢(t).

Proof.

Since rS⁢(0)<rS⁢(1), Lemma A.1 implies that t1>0 and t2>0.  It suffices to show that ρ2⁢(t)<ρ1⁢(t) for all t∈(0,t1], because then ρ2⁢(t1)<1 and Lemma A.1 implies that t2>t1.  Suppose, to contradiction, that ρ2⁢(t^)≥ρ1⁢(t^) for some t^∈(0,t1].  For any t>0, (DE) implies that if ρ1⁢(t)≤ρ2⁢(t), then d⁢ρ1d⁢t⁢(t)>d⁢ρ2d⁢t⁢(t)>0.  Consequently, we must have ρ2⁢(t)>ρ1⁢(t) for all t∈(0,t^).  This implies that for all t∈(0,t^), d⁢ρ1d⁢t⁢(t)>d⁢ρ2d⁢t⁢(t).  Reformulating in terms of inverse functions, we have that for all y∈(rS⁢(0),ρ⁢(t^)), d⁢[(ρ1)−1]d⁢y<d⁢[(ρ2)−1]d⁢y⁢(y), yet (ρ1)−1⁢(rS⁢(0))=(ρ2)−1⁢(rS⁢(0))=0 and (ρ1)−1⁢(y^)>(ρ2)−1⁢(y^) for y^=ρ1⁢(t^).  This contradicts the Fundamental Theorem of Calculus applied to (ρ1)−1 and (ρ2)−1. ∎

Proof of Proposition 3. (a) Equation (12) and simple algebra shows that t¯≥1−4⁢b is equivalent to (16).  It is obvious that (16) is satisfied if k≥14; to see that it is also satisfied if b≥14, let s⁢(k,b):=ekb⁢(4⁢k−1) and compute that when k<14, ∂s∂b=ekb⁢(1−4⁢k)⁢kb2>0, ∂s∂k=ekbb⁢(4⁢k+4⁢b−1)>0, while s⁢(0,14)=−1.

Now suppose t¯≥1−4⁢b.  If −(12−b)2+b2≥k, then t¯=0 and t1=1 satisfy (6), and we are done.  So assume −(12−b)2+b2<k.  A little algebra shows that −(1−t¯2−b)2+b2≥0.  By continuity, there exists t¯∈(0,t¯] that satisfies (14).  This t¯ and t1=1 satisfy (5), and we are done.

Now suppose t¯<1−4⁢b.  Simple algebra shows that for any t∈[0,t¯], −(1−t2−b)2+b2<0, hence (14) cannot be satisfied with any t¯∈(0,t¯] and t1=1.  So all single-pool LSHP equilibria must have t¯=0, inducing the Receiver to play 12 in equilibrium.  Since t¯<1−4⁢b requires b<14, type 0 strictly prefers any action in [0,12) to 12.  Consider any m∈M1−ε for ε<12.  If α⁢(m)≤12, type 0 has a profitable deviation to m since it weakly prefers α⁢(m) to action 12 and strictly saves on lying cost.  So, α⁢(m)>12.  But then, type 1−ε>12 has a profitable deviation to m because it strictly prefers α⁢(m) to 12 and saves on lying cost.  Consequently, there are no LSHP equilibria.

(b) A single-pool LSHP equilibrium with t¯=0 exists if b≥k+14 because in this case, −(12−b)2+b2≥k, hence t¯=0 and t1 satisfy (6).  If b<14, then the argument used in part (a) to show that there is no uninformative LSHP equilibrium applies.

So it remains to show that there is no uninformative LSHP equilibrium when b∈[14,k+14).  Suppose, to contradiction, that there is.  Consider any m∈M0.  Let a:=α⁢(m) be the Receiver’s response to m.  Type 0 not deviating to m requires −(12−b)2−k≥−(a−b)2.  Since a∈[0,1], we must have

1≥a≥b+k+(12−b)2, (A-4)

which implies that k≤12, since b≥14.  On the other hand, type 1 not deviating to m requires −(12−1−b)2≥−(a−1−b)2−k, which implies that

a≤1+b−(b+12)2−k. (A-5)

We have a contradiction between (A-4) and (A-5) if

b+(k+(12−b)2>1+b−(b+12)2−k,

which simplifies after some algebra to k<2⁢b, which holds since k≤12 and b≥14.

(c) If t¯<1−4⁢b, the statement is vacuously true because there are no single-pool LSHP equilibria by part (a).  If t¯=1−4⁢b, simple algebra shows that −(1−t2−b)2+b2<0 for all t∈[0,t¯).  By part (b), there is no single-pool LSHP equilibrium with t¯=0, and by the necessity of (14) for any LSHP equilibrium, there is no single-pool LSHP equilibrium with t¯∈(0,t¯) either.  Therefore, by part (a), all LSHP equilibria have cutoff t¯=t¯.

It remains to consider t¯>1−4⁢b.  Define

v⁢(t) := −(1−t2−b)2+b2, (A-6)
w⁢(t) := k⁢((1−t)2−(ρ∗⁢(t)−t)2). (A-7)

By (14), there is a single-pool LSHP equilibrium with strictly positive cutoff if and only if v⁢(t¯)=w⁢(t¯) for some t¯>0; by part (b), there is one with cutoff t¯=0 if and only if v⁢(0)≥w⁢(0).  Taking derivatives yields v′⁢(t)=−(1−t2−b), v′′⁢(t)=−1, w′⁢(t)=−2⁢k⁢(1−ρ∗⁢(t)+bk)<0, and w′′⁢(t)=2⁢bρ⁢(t)−t>0, where the derivatives of w⁢(⋅) have been simplified using the fact that ρ∗ solves (9).  Thus, v′′⁢(t)−w′′⁢(t)<0.  Since t¯>1−4⁢b implies v⁢(t¯)−w⁢(t¯)>0, we conclude that there is at most one solution to v⁢(t)−w⁢(t)=0 on the domain t∈[0,t¯].  Moreover, v⁢(0)−w⁢(0)≥0 if and only if there is no solution to v⁢(t)−w⁢(t)=0 with t∈(0,t¯], yielding the the desired conclusion.

(d) When b≥14, there cannot be multiple pools in an LSHP equilibrium because (13) will be violated.  Furthermore, all single-pool LSHP equilibria are essentially equivalent because b≥14 implies t¯>1−4⁢b, and the rest of the argument of part (c) applies.

(e) Fix any b>0 any k^ such that (16) is satisfied.  In what follows, I add k as an argument to various objects to emphasize the dependence on the cost intensity.  First consider b>k^+14.  By part (b), t¯⁢(k)=0 for all k in a neighborhood of k^, hence t¯′⁢(k^)=0.

Now consider b<k^+14.  Then v⁢(t¯⁢(k))−w⁢(t¯⁢(k);k)=0 for all k in a neighborhood of k^, where v and w are defined in equations (A-6) and (A-7) (note that v⁢(⋅) does not depend on k).  It is routine to verify that for any t, ρ∗⁢(t;⋅) is continuous on the domain of k for which ρ∗⁢(t;k) is well-defined.  This implies that for any t, w⁢(t;⋅) is continuous on the domain of k for which it is defined.  Hence t¯⁢(⋅) is continuous at k^.  Next I argue that it is strictly increasing and differentiable at k^.  By the Implicit Function Theorem,

t¯′⁢(k^) = ∂w⁢(t¯⁢(k^);k^)∂k∂[v⁢(t¯⁢(k^))−w⁢(t¯⁢(k^);k^)]∂t, (A-8)

so long as the denominator is non-zero, which will be shown below.  The numerator of the right hand side of (A-8) computes as

−2⁢k⁢(ρ∗⁢(t¯⁢(k^);k^)−t¯⁢(k^))⁢∂ρ∗⁢(t¯⁢(k^);k^)∂k+((1−t¯⁢(k^))2−(ρ∗⁢(t¯⁢(k^);k)−t¯⁢(k^))2),

which is strictly positive because 1≥ρ∗⁢(t)>t and ∂ρ∗⁢(t¯⁢(k^);k^)∂k<0 by Lemma A.3 (that the derivative exists is routinely verified).  To sign the denominator, note that ∂2[v⁢(t)−w⁢(t;k^)]∂t2<0 for all t by the calculation performed in part (c).  Hence, if ∂[v⁢(t¯⁢(k^))−w⁢(t¯⁢(k^);k^)]∂t≤0, we would have v⁢(t¯⁢(k^))−w⁢(t¯⁢(k^);k^)<0 because t¯⁢(k^)>t¯⁢(k^)=0, which implies that v⁢(t¯⁢(k^))<0 since w⁢(t¯⁢(k^))=0.  But this is impossible because by (A-6), v⁢(t)≥0 for all t∈[1−4⁢b,1), and t¯⁢(k^)≥1−4⁢b by part (a).  Consequently, the denominator of the right hand side of (A-8) is strictly positive.  Therefore, t¯′⁢(k^)>0.

Finally, consider b=k^+14.  Then by part (b), t¯⁢(k^)=0, hence t¯⁢(⋅) is left-continuous at k^.  Since v⁢(t¯⁢(k))−w⁢(t¯⁢(k);k)=0 holds for all k≥k^, the continuity argument used above implies that t¯⁢(⋅) is also right-continuous at k^.  ∎

Proof of Proposition 5. Since on-path behavior in an augmented LSHP profile is identical to an LSHP equilibrium, I only need to verify that deviating to some m∈Mϕ is not profitable for any type.  Fix any type t and some m∈Mϕ.  Since the (non-augmented) LSHP profile is an equilibrium, it is not profitable for type t to deviate some unused m~∈rS⁢(t), which induces an action α⁢(rS⁢(t))≥aR⁢(0).  But then, since all m~∈rS⁢(t) cost the same as m∈Mϕ, and by large bias, US⁢(α⁢(rS⁢(t)),t)≥US⁢(aR⁢(0),t), deviating to m is not profitable for type t.  ∎

Proof of Corollary 1. Since bias is large, Proposition 1 implies that if t¯>0, (7) must hold.  But the left-hand side of (7) is bounded above zero on the domain t¯∈[0,t¯] for any set of k that is bounded away from ∞; whereas the right-hand side is converging to 0 as k→0.  Hence, for small enough k, there is no solution to (7) in the domain t¯∈[0,t¯], which proves the first part of the Proposition.

The second part follows from the discussion in Section 3.6, noting that inf{t:rS⁢(1)=1}=1 since rS⁢(t)=t in the withholding model.  ∎

Proof of Proposition 4. I will show that for k≥14 and b∈(0,316), there is an equilibrium under communication in which the Receiver’s ex-ante utility is strictly higher than −b2, which is her utility from delegation.  This proves the Proposition because by the discussion in Section 3.6, for all b∈[316,112], communication is arbitrarily close to fully-revealing and hence dominates delegation for all large enough k.  For all b>112, communication dominates delegation for any k, because even an uninformative equilibrium under communication yields ex-ante utility to the Receiver strictly greater than −b2.

Accordingly, assume k≥14 and b∈(0,316).  By Proposition 3, there are single-pool LSHP equilibria for these parameters.  R’s utility in a single-pool LSHP equilibrium with cutoff t¯ is −∫t¯1(1+t¯2−t)2⁢𝑑t, since all types below t¯ separate and all types above t¯ form a single pool.  Hence this equilibrium yields higher utility than delegation if

14⁢t¯−14⁢t¯2+112⁢t¯3−112>−b2,

or equivalently,

t¯>1−(123)⁢b23. (A-9)

Proposition 3 implies that t¯≥1−4⁢b (because −(1−t2−b)2+b2<0 for all t<1−4⁢b), hence (A-9) holds if

1−4⁢b>1−(123)⁢b23,

which is true because b∈(0,316).  ∎

Appendix B: Equilibrium Refinement

This appendix develops a rigorous justification for focussing on LSHP equilibria, by applying an equilibrium refinement proposed by Bernheim and Severinov (2003) called the monotonic D1 (mD1) criterion.  The first part below explains and formalizes the criterion; the second part applies it to the current model, deriving the sense in which it justifies LSHP equilibria.

The Monotonic D1 Criterion

The underlying idea of the mD1 criterion is the same as Cho and Kreps’s (1987) D1 criterion, which requires that the Receiver not attribute a deviation to a particular type if there is some other type that is willing to make the deviation for a strictly larger set of possible Receiver responses.  The mD1 criterion strengthens this by applying the test to only those responses from the Receiver which satisfy an action monotonicity restriction.  Analogous to message monotonicity for the Sender, action monotonicity requires the Receiver’s strategy to satisfy α⁢(m)≥α⁢(m′) if Ψ⁢(m)>Ψ⁢(m′).  In words, if the Sender claims to be a strictly higher type, the Receiver should respond with a weakly higher action.  Intuitively, given message monotonicity, action monotonicity is natural (and indeed, is an implication of message monotonicity on the equilibrium path).

Some notation is needed for the formal statement.  With respect to a given profile (μ,α), which induces some ρ=Ψ∘α, define

ξl⁢(t~) := max⁡{aR⁢(0),supt:ρ⁢(t)≤t~α⁢(μ⁢(t))},
ξh⁢(t~) := min⁡{aR⁢(1),inft:ρ⁢(t)≥t~α⁢(μ⁢(t))},

where I follow the convention that sup(∅)=+∞ and inf(∅)=−∞.  To understand these functions, suppose (μ,α) is an equilibrium with message and action monotonicity.  If some type claims to be t~ on the equilibrium path, then ξl⁢(t~) (resp. ξh⁢(t~)) is just the “lowest” (resp. “highest”) equilibrium action taken in response to a claim of t~.  If no type claims to be t~, yet some type does claim to be a t<t~ (resp. t>t~), then ξl⁢(t~) (resp. ξh⁢(t~)) is the “highest” (resp. “lowest”) action taken by the Receiver in equilibrium to a claim of being lower (resp. higher) than t~.  If no type claims to be any t≤t~ (resp. t≥t~), then ξl⁢(t~) (resp. ξh⁢(t~)) just specifies the lowest (resp. highest) rationalizable action for the Receiver.

With respect to some profile (μ,α), let

A⁢(m,t):=[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))]∩{a:US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t)≥US⁢(α⁢(μ⁢(t)),t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)},
A¯⁢(m,t):=[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))]∩{a:US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t)>US⁢(α⁢(μ⁢(t)),t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)}.

To interpret, consider an unused message m in some equilibrium.  A⁢(m,t) (resp. A¯⁢(m,t)) is the set of responses within the set [ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))] that give type t a weak (resp. strict) incentive to deviate to m.

The following is Bernheim and Severinov’s (2003) refinement criterion adapted to the current model.

Definition B.1.

An equilibrium, (μ,α), satisfies the mD1 criterion if it satisfies (i) message monotonicity, (ii) action monotonicity, and (iii) α⁢(m)=aR⁢(t′) for any t′ and any out-of-equilibrium message m such that A⁢(m,t)⊆A¯⁢(m,t′) for all t≠t′ and A⁢(m,t′)≠∅.

The first two parts of the definition are clear.  In the third part, the requirement that α⁢(m)=aR⁢(t′) could alternatively be posed as support[G(⋅|m)]={t′}.  If we replace [ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))] in the definitions of A and A¯ with [aR⁢(0),aR⁢(1)], then the above test is basically the D1 criterion (cf. Cho and Kreps, 1987, p. 205).  However, given action monotonicity, any out-of-equilibrium message m satisfies α⁢(m)∈[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))].  Accordingly, the definition above applies the idea behind the D1 criterion on the restricted action space [ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))].  That is, it requires that for some out-of-equilibrium message m, if there is some type t′ that would strictly prefer to deviate to m for any response a∈[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))] that a type t≠t′ would weakly prefer to deviate for, then upon observing the deviation m, the Receiver should believe it is type t′, so long as there is some response in a∈[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))] such that t′ would at least weakly prefer sending m to its equilibrium payoff.333333The caveat that A⁢(m,t′)≠∅ prevents internal inconsistencies in the criterion when there exists m, t, and t′ such that A⁢(m,t)=A⁢(m,t′)=∅.

The Connection to LSHP Equilibria

The mD1 criterion provides a justification for focussing on LSHP equilibria in the following sense: any mD1 equilibrium is an LSHP equilibrium, modulo the behavior of the cutoff type; conversely, there is always an LSHP equilibrium that is identical to some mD1 equilibrium.  Formally,

Theorem B.1.

(1) If (μ,α) is an mD1 equilibrium, then there is an LSHP equilibrium, (μ~,α~) such that for all but at most a single t, μ~⁢(t)=μ⁢(t) and α~⁢(μ~⁢(t))=α⁢(μ⁢(t)).

(2) There is an LSHP equilibrium that is also an mD1 equilibrium.

Remark B.1.

It is possible to further show that for any LSHP equilibrium, (μ,α), that satisfies action monotonicity, there is some mD1 equilibrium, (μ,α′), such that α′∘μ=α∘μ, i.e. there are only off-the-equilibrium-path differences if any.  A proof is available on request.  Note that the existence proof for LSHP equilibria (Theorem 2) constructs an LSHP equilibrium that satisfies action monotonicity.

The proof of Theorem B.1 requires a series of lemmata that derive necessary conditions for an mD1 equilibrium.  Some notation is helpful, where all of the following are defined with implicit respect to some strategy, μ.  Let μ−1⁢(m):={t:μ⁢(t)=m} and Γ⁢(t):=⋃m∈Mtμ−1⁢(m).  Hence, Γ⁢(t) is the set of types who claim to be type t, i.e. who use messages in Mt.  To say that there is a pool on message m is to say that |μ−1⁢(m)|>1, type t is separating if |μ⁢(t)|=1, and a message m is used if |μ−1⁢(m)|>0.  Next, define tl⁢(m):=inf{t:ρ⁢(t)=Ψ⁢(m)} and th⁢(m):=sup{t:ρ⁢(t)=Ψ⁢(m)}.  In words, tl⁢(m) identifies the “lowest” type who claims to be type Ψ⁢(m), and similarly for th⁢(m).  Note that under message monotonicity, tl⁢(m)<th⁢(m) implies that any type t∈(tl⁢(m),th⁢(m)) satisfies μ⁢(t)∈MΨ⁢(m), although not necessarily μ⁢(t)=m.

Lemma B.1.

In any monotone equilibrium, for any message m,

  1. (1)

    μ−1⁢(m) and Γ⁢(Ψ⁢(m)) are convex sets, and |Γ(Ψ(m)|∈{0,1,∞}.

  2. (2)

    If |Γ⁢(Ψ⁢(m))|>0, there is a strictly increasing sequence, ⟨tl⁢(m)=t0,t1,…,tJ=th⁢(m)⟩ and a set of distinct messages {mj}j=1J⊆MΨ⁢(m) such that (i) for all j=1,…,J−1, tj solves (3), (ii) for any j=1,…,J and t∈(tj−1,tj), μ⁢(t)=mj, and α⁢(μ⁢(t))=aR⁢(tj−1,tj).

Proof.

Just apply the logic of CS. ∎

Lemma B.2.

In any monotone equilibrium, if there is pooling on some message mp∉M1, then there exists η>0 such that every m∈⋃t∈(Ψ⁢(mp),Ψ⁢(mp)+η)Mt is unused.

Hence, if there is pooling on some message, then there are some unused messages “just above.”

Proof.

Suppose there is pooling on mp∉M1.  To minimize notation in this proof, write th instead of th⁢(mp).  If ρ⁢(th)>Ψ⁢(mp), then by message monotonicity, we are done, since all messages in ⋃(Ψ⁢(mp),Ψ⁢(α⁢(th)))Mt are unused.  So assume that ρ⁢(th)=Ψ⁢(mp).  If th=1, we are done since all messages in ⋃(Ψ⁢(mp),1)Mt are unused, by message monotonicity.  So assume th<1.  Let mh:=μ⁢(th).  We must have |μ−1⁢(mh)|>1, for if not, th is separating, and a slightly lower type would strictly prefer to mimic type th, contradicting equilibrium.  It follows that α⁢(mh)<aR⁢(th).  Let t~:=limt↓thρ⁢(t).  (ρ′ is well-defined by message monotonicity, though it may not be used.)

Claim: t~>Ψ⁢(mp).

Proof: Suppose not.  By message monotonicity, t~=Ψ⁢(mp)=ρ⁢(th).  Note that ρ⁢(⋅) is then continuous at th.  Since ρ⁢(t)>Ψ⁢(mp) for all t>th, it follows that ρ is strictly increasing on (th,th+δ) for some δ>0, i.e. all types in this interval are separating.  Hence, aε:=α⁢(μ⁢(th+ε))=aR⁢(th+ε) for small enough ε>0.  By picking ε>0 small enough, we can make C⁢(ν⁢(ρ⁢(th+ε)),th)−C⁢(ν⁢(ρ⁢(th)),th) arbitrarily close to 0, whereas US⁢(aε,th)−US⁢(α⁢(mh),th) is positive and bounded away from 0, because α⁢(mh)<aR⁢(th)<aε<aS⁢(th).  Therefore, for small enough ε>0, th prefers to imitate th+ε, contradicting equilibrium. ⋄

This completes the argument because messages in ⋃t∈(Ψ⁢(mp),t~)Mt are unused. ∎

Lemma B.3.

In any mD1 equilibrium, if |Γ⁢(t~)|=0 for some t~>ρ⁢(0), then for all m∈Mt~, α⁢(m)=aR⁢(sup{t:ρ⁢(t)<t~}).

Hence, if no type claims to be t~>ρ⁢(0), then the Receiver must respond to any claim of being t~ by inferring that the Sender is the “highest type who claims to be below t.”  The proof shows that it is this type who has the biggest incentive to claim to be t~ (given action monotonicity for the Receiver).

Proof.

Fix a t~>ρ⁢(0) such that |Γ⁢(t~)|=0.  Let t^:=sup{t:ρ⁢(t)<t~} and, for any t, at:=α⁢(μ⁢(t)).  There are two distinct cases: either t^<1, or t^=1.

Case 1: t^<1

Let t+:=inft>t^ρ⁢(t), t−:=supt<t^ρ⁢(t), a+:=ξh⁢(t~), and a−:=ξl⁢(t~).  Message monotonicity implies that ρ⁢(t^),t~∈[t−,t+].

Claim: The inequalities below, (B-1) and (B-2), hold for all t, with equality for t=t^:

US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)≥US⁢(a−,t)−k⁢C⁢(ν⁢(t−),t), (B-1)
US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)≥US⁢(a+,t)−k⁢C⁢(ν⁢(t+),t). (B-2)

Proof: I prove it for (B-1); it is analogous for (B-2).  Suppose first that ρ⁢(t^)>t~.  Then, by message and action monotonicity, a−=limt↑t^at and (at,ρ⁢(t))↑(a−,t−) as t↑t^.  Continuity of US, C, and ν imply that any t for which (B-1) does not hold has a profitable deviation to μ⁢(t^−ε) for small enough ε>0.  For type t^, suppose towards contradiction that (B-1) holds strictly.  Continuity of US, C, and ν then imply that for all sufficiently small ε>0, US⁢(at^,t^−ε)−k⁢C⁢(ν⁢(ρ⁢(t^)),t^−ε)>US⁢(at^−ε,t^−ε)−k⁢C⁢(ν⁢(ρ⁢(t^−ε)),t^−ε), which contradicts optimality of μ⁢(t^−ε).

Now suppose that ρ⁢(t^)<t~.  Then a−=at^ and t−=ρ⁢(t^), and it is obvious that (B-1) holds with equality for t^.  Moreover, any t for which (B-1) does not hold has a profitable deviation to μ⁢(t^). ⋄

The following two claims show that the mD1 criterion yields the desired conclusion.

Claim: For all m∈Mt~, A⁢(m,t^)≠∅.

Proof: Pick any m∈Mt~.  If t~≤rS⁢(0), then since (B-1) holds with equality for t^, a−∈A⁢(m,t^).  If t~>rS⁢(0), then since (B-2) hold with equality for t^, a+∈A⁢(m,t^). ⋄

Claim: For all m∈Mt~ and t≠t^, A⁢(m,t)⊆A¯⁢(m,t^).

Proof: Fix any m∈Mt~ and t≠t^.  I must show that ∀a∈[a−,a+],

US⁢(a,t)−k⁢C⁢(ν⁢(t~),t) ≥ US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)
⇓
US⁢(a,t^)−k⁢C⁢(ν⁢(t~),t^) > US⁢(at^,t^)−k⁢C⁢(ν⁢(ρ⁢(t^)),t^).

I provide the argument assuming t<t^; it is analogous for t>t^ (using (B-2) instead of (B-1)).  Since (B-1) holds for all t, with equality for t^, it suffices to show that

US⁢(a,t)−k⁢C⁢(ν⁢(t~),t) ≥ US⁢(a−,t)−k⁢C⁢(ν⁢(t−),t)
⇓
US⁢(a,t^)−k⁢C⁢(ν⁢(t~),t^) > US⁢(a−,t^)−k⁢C⁢(ν⁢(t−),t^).

This is true if

US⁢(a,t^)−k⁢C⁢(ν⁢(t~),t^)−[US⁢(a−,t^)−k⁢C⁢(ν⁢(t−),t^)]
>US⁢(a,t)−k⁢C⁢(ν⁢(t~),t)−[US⁢(a−,t)−k⁢C⁢(ν⁢(t−),t)],

which can be be rewritten as

∫a−a∫tt^U12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(t−)ν⁢(t~)∫tt^C12⁢(y,z)⁢𝑑z⁢𝑑y,

which is true because U12S>0>C12. ⋄

Case 2: t^=1

It needs to be shown that for any m∈Mt~, α⁢(m)=aR⁢(1).  If a1=aR⁢(1), this is an immediate consequence of action monotonicity, so assume that a1<aR⁢(1). If ρ⁢(1)>t~, then the same proof as in Case 1 works, except that one now defines t+:=ρ⁢(1).  So consider ρ⁢(1)<t~.  Then a−=a1 and a+=aR⁢(1).  Since a+∈A⁢(m,1), the following claim shows that the mD1 criterion yields the desired conclusion.

Claim: For all t<1 and m∈Mt~, A⁢(m,t)⊆A¯⁢(m,1).

Proof: Fix any t<1 and m∈Mt~.  I must show that ∀a∈[a1,aR⁢(1)],

US⁢(a,t)−k⁢C⁢(ν⁢(t~),t) ≥ US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)
⇓
US⁢(a,1)−k⁢C⁢(ν⁢(t~),1) > US⁢(a1,1)−k⁢C⁢(ν⁢(ρ⁢(1)),1).

Since optimality of μ⁢(t) implies US⁢(at,t)−k⁢C⁢(ρ⁢(t),t)≥US⁢(a1,t)−k⁢C⁢(ρ⁢(1),t), it suffices to show that

US⁢(a,1)−k⁢C⁢(ν⁢(t~),1)−[US⁢(a1,1)−k⁢C⁢(ν⁢(ρ⁢(1)),1)]
>US⁢(a,t)−k⁢C⁢(ν⁢(t~),t)−[US⁢(a1,t)−k⁢C⁢(ν⁢(ρ⁢(1)),t)],

which can be rewritten as

∫a1a∫t1U12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(ρ⁢(1))ν⁢(t~)∫t1C12⁢(y,z)⁢𝑑z⁢𝑑y.

This inequality holds because U12S>0>C12. ⋄ ∎

Lemma B.4.

In any mD1 equilibrium, if ρ⁢(0)>rS⁢(0), then α⁢(m)=aR⁢(0) for any m such that Ψ⁢(m)∈[0,ρ⁢(0)).

Hence, if the lowest type is using inflated language, then all unused messages at the bottom must be attributed by the Receiver to type 0.

Proof.

Assume rS⁢(0)<ρ⁢(0).  It suffices to show that α⁢(m)=aR⁢(0) for any m such that Ψ⁢(m)∈[rS⁢(0),ρ⁢(0)), because action monotonicity then implies that α⁢(m)=aR⁢(0) for any m such that Ψ⁢(m)∈[0,rS⁢(0)).  Accordingly, pick any m such that Ψ⁢(m)∈[rS⁢(0),ρ⁢(0)).  For any t, let at:=α⁢(μ⁢(t)).  It follows from message and action monotonicity that ξl⁢(Ψ⁢(m))=aR⁢(0) and ξh⁢(Ψ⁢(m))=a0.  Plainly, a0∈A⁢(m,0), so the mD1 criterion yields the result if for all t>0, A⁢(m,t)⊆A¯⁢(m,0).  Equivalently, I must show that ∀a∈[aR⁢(0),a0] and ∀t>0,

US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t) ≥ US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)
⇓
US⁢(a,0)−k⁢C⁢(ν⁢(Ψ⁢(m)),0) > US⁢(a0,0)−k⁢C⁢(ν⁢(ρ⁢(0)),0).

That (μ,α) is an equilibrium implies

US⁢(at,t)−k⁢C⁢(ν⁢(ρ⁢(t)),t)≥US⁢(a0,t)−k⁢C⁢(ν⁢(ρ⁢(0)),t),

and hence it suffices to show that

US⁢(a,0)−k⁢C⁢(ν⁢(Ψ⁢(m)),0)−[US⁢(a0,0)−k⁢C⁢(ν⁢(ρ⁢(0)),0)]
>US⁢(a,t)−k⁢C⁢(ν⁢(Ψ⁢(m)),t)−[US⁢(a0,t)−k⁢C⁢(ν⁢(ρ⁢(0)),t)].

This inequality can be rewritten as

∫aa0∫0tU12S⁢(y,z)⁢𝑑z⁢𝑑y>k⁢∫ν⁢(Ψ⁢(m))ν⁢(ρ⁢(0))∫0tC12⁢(y,z)⁢𝑑z⁢𝑑y,

which holds because C12<0<U12S. ∎

Lemma B.5.

In any mD1 equilibrium, there is a cutoff type t¯∈[0,t¯] such that all types t<t¯ are separating with ρ⁢(t)=ρ∗⁢(t), while all μ⁢(t)∈M1 for any t>t¯.

Hence, the Sender’s behavior in an mD1 equilibrium is an LSHP strategy, modulo perhaps the behavior of the cutoff type.

Proof.

I prove the result in two steps.

Claim: There is a cutoff type t¯∈[0,1) such that all types below are separating and all types above are sending messages in M1.

Proof: We know there must be some pooling, by Theorem 1.  So it suffices to prove that |Γ⁢(m)|>1 implies m∈M1, because then t¯=inf{t:ρ⁢(t)=1} satisfies the needed properties for a cutoff type.  Suppose there is some mp such that Ψ⁢(mp)<1 and |Γ⁢(mp)|>1.  Let a^:=limε→0α⁢(μ⁢(th⁢(mp)−ε)).  By Lemma B.1, for all small enough ε>0, μ⁢(th⁢(rp)−ε)∈MΨ⁢(mp), α(μ(th(mp)−ε)=a^, and a^<aR⁢(th⁢(mp)).  By Lemma B.2, ∃η>0 such that for any m with Ψ⁢(m)∈(Ψ⁢(mp),Ψ⁢(mp)+η), |Γ⁢(m)|=0.  By Lemma B.3, for any m with Ψ⁢(m)∈(Ψ⁢(mp),Ψ⁢(mp)+η), α⁢(m)=aR⁢(th⁢(rp)).  It follows that for small enough ε>0 and δ>0, a type th⁢(rp)−ε strictly prefers to send message any m∈MΨ⁢(mp)+δ rather than playing μ⁢(th⁢(rp)−ε), a contradiction. ⋄

Claim: t¯≤t¯ and ρ⁢(t)=ρ∗⁢(t) for all t<t¯.

Proof: Assume t¯>0, for there is nothing to prove otherwise.  Since all types in [0,t¯) are separating, Lemma 1 implies that ρ⁢(t)>rS⁢(t) for all t∈(0,t¯).  The same continuity argument as in the proof of Lemma 1 shows that ρ must be continuous at 0, hence ρ⁢(0)≥rS⁢(0).  But then, we must have ρ⁢(0)=rS⁢(0), for if not, action monotonicity implies that action monotonicity implies that α⁢(m)=aR⁢(0) for all m∈MrS⁢(0), and type 0 can profitably deviate to some m∈MrS⁢(0).  Both parts of the desired conclusion now follows from Lemma A.1. ⋄ ∎

Lemma B.6.

Assume rS⁢(0)<1.  In any mD1 equilibrium with cutoff t¯=0, ρ⁢(0)∈{rS⁢(0),1}.

This says that so long as not all types have the same cost-minimizing messages, the lowest type must either minimize its costs or maximally inflate its message.

Proof.

Assume t¯=0 and ρ⁢(0)≠1.  By Lemma B.5, type 0 is separating, hence α⁢(μ⁢(0))=aR⁢(0), while ρ⁢(t)=1 for all t>0.  If ρ⁢(0)>rS⁢(0), then by action monotonicity, α⁢(m)=aR⁢(0) for any m∈MrS⁢(0), and type 0 can profitably deviate to such a message.  Therefore, ρ⁢(0)≤rS⁢(0).  Suppose ρ⁢(0)<rS⁢(0).  Let a^:=limε↓0α⁢(μ⁢(ε)).  We must have US⁢(a^,0)−k⁢C⁢(ν⁢(1),0)=US⁢(aR⁢(0),0)−k⁢C⁢(ρ⁢(0),0), because otherwise, a small enough type ε>0 would have a profitable deviation to μ⁢(0).  Pick an arbitrary m∈MrS⁢(0).  By action monotonicity, α⁢(m)∈[aR⁢(0),a^], and hence US⁢(α⁢(m),0)≥min⁡{US⁢(aR⁢(0),0),US⁢(a^,0)}.  Since rS⁢(0)∈(ρ⁢(0),1), we have C⁢(ν⁢(rS⁢(0)),0)<min⁡{C⁢(ν⁢(ρ⁢(0)),0),C⁢(ν⁢(1),0)}, and it follows that US(α(m),0)−kC(ν(rS(0)),0))>US(a^,0)−kC(ν(1),0). Therefore, type 0 has a profitable deviation to m, a contradiction. ∎

Lemma B.7.

In any mD1 equilibrium with cutoff t¯, letting a1:=limt↓t¯α⁢(μ⁢(t)),

  1. (i)

    if t¯>0, US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯)=US⁢(a1,t¯)−k⁢C⁢(ν⁢(1),t¯);

  2. (ii)

    if t¯=0, US⁢(aR⁢(0),0)−k⁢C⁢(ν⁢(rS⁢(0)),0)≤US⁢(a1,0)−k⁢C⁢(ν⁢(1),0).

Proof.

(i) Assume t¯∈(0,1).  First suppose ρ∗⁢(t¯)=1.  Then μ⁢(t¯)∈M1, and we must have US⁢(aR⁢(t¯),t¯)=US⁢(a1,t¯).  Since all types below t¯ are separating, equilibrium requires that for all ε>0,

US(aR(t¯−ε)),t¯)−kC(ν(ρ∗(t¯−ε)),t¯)≤US(a1,t¯)−kC(ν(1),t¯).

The desired conclusion follows from the above inequality and continuity of all the relevant functions.

So suppose ρ∗⁢(t¯)<1.  I claim that ρ⁢(t¯)∈{ρ∗⁢(t¯),1}.  If this is not the case, ρ⁢(t¯)∈(ρ∗⁢(t¯),1) by message monotonicity, hence t¯ is separating.  But then, action monotonicity implies that α⁢(m)=aR⁢(t) for all m∈Mρ∗⁢(t), and since ρ∗⁢(t¯)>rS⁢(t¯), t¯ can profitably deviate to any m∈Mρ∗⁢(t).

Consider first that ρ⁢(t¯)=t^, in which case t¯ is separating.  Define for ε≥0,

W⁢(ε):=US⁢(aR⁢(t¯),t¯+ε)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯+ε)−[US⁢(a1,t¯+ε)−k⁢C⁢(ν⁢(1),t¯+ε)].

If the Lemma does not hold, W⁢(0)>0 (the reverse inequality is inconsistent with optimality of μ⁢(t¯)).  But then, by continuity of W, for small enough ε>0, a type t¯+ε would prefer to deviate to playing μ⁢(t¯), contradicting equilibrium.

It remains to consider ρ⁢(t¯)=1.  Lemma B.3 implies that for all m∈Mρ∗⁢(t¯), α⁢(m)=aR⁢(t¯). Thus, if the Lemma does not hold, optimality of μ⁢(t¯) implies that US⁢(a1,t¯)−k⁢C⁢(ν⁢(1),t¯)>US⁢(aR⁢(t¯),t¯)−k⁢C⁢(ν⁢(ρ∗⁢(t¯)),t¯).  But then, by continuity of the relevant functions, we have that that for small enough ε>0,

US⁢(a1,t¯−ε)−k⁢C⁢(ν⁢(1),t¯−ε)>US⁢(aR⁢(t¯−ε),t¯−ε)−k⁢C⁢(ν⁢(ρ∗⁢(t¯−ε)),t¯−ε),

implying that a type t¯−ε has a profitable deviation, contradicting equilibrium.

(ii) Assume t¯=0.  The result is obvious if rS⁢(0)=1, so assume rS⁢(0)<1.  Suppose first ρ⁢(0)=1.  Then Lemma B.4 implies that for any m∈MrS⁢(0), α⁢(m)=aR⁢(0).  The desired result now follows from from optimality of μ⁢(0).  So consider ρ⁢(0)<1.  By Lemma B.6, type 0 is separating with ρ⁢(0)=rS⁢(0).  If the Lemma is not true, then optimality of μ⁢(0) implies US(aR(0),0)−kC(ν(rS(0),0)>US(a1,0)−kC(ν(1),0).  But then, by continuity of the relevant functions, for small enough ε>0, a type ε has a profitable deviation to μ⁢(0), contradicting equilibrium. ∎

Proof of Theorem B.1. (1) Fix an mD1 equilibrium (μ,α).  Lemmas B.1, B.5, and B.7 imply that there is an associated cutoff type t¯ and strictly increasing sequence ⟨t0=t¯,t1,…,tJ=1⟩ that satisfy (4), (5), and (6).  Moreover, by Lemma B.5, all types t<t¯ are playing μ⁢(t)∈Mρ∗⁢(t), while all types t>t¯ are playing μ⁢(t)∈M1.  Hence, the proof of Theorem 2 shows that there is an LSHP equilibrium, (μ~,α~), such that for all t≠t¯, μ~⁢(t)=μ⁢(t) and α~⁢(μ~⁢(t))=α⁢(μ⁢(t)).

(2) Pick an LSHP equilibrium, (μ,α), that is constructed in the proof of Theorem 2.  I will argue that this is an mD1 equilibrium.  Message and action monotonicity are obviously satisfied, so it only remains to check that every out-of-equilibrium response α⁢(m) passes the third part of the mD1 criterion.  Let Mμ denote the range of μ, i.e. the set of messages used in equilibrium.

Step 1: First consider any m∉Mμ such that there is an m~∈Mμ with Ψ⁢(m~)=Ψ⁢(m).  Then we must have A¯⁢(m,t)=∅ for all t, for otherwise some type can profitably deviate to some message in MΨ⁢(m).  Hence, the mD1 criterion permits any response to m, in particular α⁢(m).

Step 2: Suppose t¯>0.  Consider any m such that Ψ⁢(m)∈[ρ∗⁢(t¯),1).  We have ξl⁢(Ψ⁢(m))=aR⁢(t¯)<ξh⁢(Ψ⁢(m))=aR⁢(t¯,t1), and α⁢(m)=aR⁢(t¯).  By construction, (5) holds.  So the argument used in the proof of Lemma B.3 (in particular, the Claim in Case 1) can be applied to show that A⁢(m,t)⊂A¯⁢(m,t¯) for any t≠t¯.  Moreover, it can be verified that there exists some a∈[ξl⁢(m),ξh⁢(m)] such that

US(a,t¯)−C(ν(Ψ(m)),t¯)=US(α(μ(t¯))−kC(ν(ρ(t¯)),t¯),

and because of U12S>0>C12,

US(a,t)−C(ν(Ψ(m)),t)<US(α(μ(t))−kC(ν(ρ(t)),t)

for all t≠t¯.  Hence, A⁢(m,t¯)⊈A¯⁢(m,t) for any t≠t¯.  Therefore, α⁢(m)=aR⁢(t¯) passes the mD1 test.

Step 3: Suppose t¯>0.  Consider any m such that Ψ⁢(m)<rS⁢(0).  We have ξl⁢(Ψ⁢(m))=ξh⁢(Ψ⁢(m))=α⁢(m)=aR⁢(0).  It follows that A⁢(m,t)=∅ for all t, hence α⁢(m) passes the mD1 test.

Step 4: Suppose t¯=0, hence Mμ⊆M1.  Pick any m such that Ψ⁢(m)<1.  We have ξl⁢(Ψ⁢(m))=α⁢(m)=aR⁢(0)<ξh⁢(Ψ⁢(m))=aR⁢(t¯,t1).  The argument of Lemma B.4 can be applied to show that A⁢(m,t)⊆A¯⁢(m,0) for all t.  There are now two cases to consider.  First, suppose A⁢(m,0)=∅.  Then it follows that A⁢(m,t)=∅ for all t, hence any response to m passes the mD1 test.  On the other hand, suppose A⁢(m,0)≠∅.  Then because (6) holds by construction, continuity implies that exists some a∈[ξl⁢(Ψ⁢(m)),ξh⁢(Ψ⁢(m))] such that

US(a,0)−C(ν(Ψ(m)),0)=US(α(μ(0))−kC(ν(ρ(0)),0),

and because of U12S>0>C12,

US(a,t)−C(ν(Ψ(m)),t)<US(α(μ(t))−kC(ν(ρ(t)),t)

for all t>0.  Hence, A⁢(m,0)⊈A¯⁢(m,t) for any t>0.  Therefore, α⁢(m)=aR⁢(t¯) passes the mD1 test.  ∎

References

  • M.G. Allingham and A. Sandmo (1972) Income tax evasion: a theoretical analysis. Journal of Public Economics 1, pp. 323–338. Cited by: §1.
  • D. Austen-Smith and J. S. Banks (2000) Cheap talk and burned money. Journal of Economic Theory 91 (1), pp. 1–16. Cited by: footnote 3.
  • J. S. Banks and J. Sobel (1987) Equilibrium selection in signaling games. Econometrica 55 (3), pp. 647–661. Cited by: §3.2.
  • B. D. Bernheim and S. Severinov (2003) Bequests as signals: an explanation for the equal division puzzle. Journal of Political Economy 111 (4), pp. 733–764. Cited by: §1.1, §3.2, The Monotonic D1 Criterion, Appendix B: Equilibrium Refinement, footnote 1, footnote 11, footnote 14.
  • H. Cai and J. T. Wang (2006) Overcommunication in strategic information transmission games. Games and Economic Behavior 56 (1), pp. 7–36. Cited by: §1.
  • Y. Chen, N. Kartik, and J. Sobel (2008) Selecting cheap-talk equilibria. Econometrica 76 (1), pp. 117–136. Cited by: §1.1, §1.1, §3.5, Appendix A: Proofs, footnote 17.
  • Y. Chen (2007) Perturbed communication games with honest senders and naive receivers. Note: mimeo, Arizona State University Cited by: §1.1, §1.1, §2.1.
  • I. Cho and D. Kreps (1987) Signaling games and stable equilibria. Quarterly Journal of Economics 102 (2), pp. 179–221. Cited by: §3.2, The Monotonic D1 Criterion, The Monotonic D1 Criterion, footnote 26.
  • I. Cho and J. Sobel (1990) Strategic stability and uniqueness in signaling games. Journal of Economic Theory 50 (2), pp. 381–418. Cited by: §1.1, §1, §3.2, footnote 14.
  • E. Coddington and N. Levinson (1955) Theory of ordinary differential equations. New York: McGraw-Hill. Cited by: Appendix A: Proofs, Appendix A: Proofs.
  • V. Crawford and J. Sobel (1982) Strategic information transmission. Econometrica 50 (6), pp. 1431–1451. Cited by: §1, §1, §2, §5.
  • R. Deneckere and S. Severinov (2007) Optimal screening with costly misrepresentation. Note: mimeo Cited by: §1.1.
  • W. Dessein (2002) Authority and communication in organizations. Review of Economic Studies 69 (4), pp. 811–838. Cited by: §1, §4.2, §4.2, §4.2, §4, §6, footnote 21.
  • P. Esö and A. Galambos (2008) Disagreement and evidence production in pure communication games. Note: mimeo, Northwestern University Cited by: footnote 25.
  • P. Esö and J. Schummer (2004) Bribing and signaling in second-price auctions. Games and Economic Behavior 47 (2), pp. 299–324. Cited by: §3.2, footnote 14.
  • U. Gneezy (2005) Deception: the role of consequences. American Economic Review 95 (1), pp. 384–394. Cited by: §1.
  • J. R. Green and J. Laffont (1986) Partially verifiable information and mechanism design. Review of Economic Studies 53 (3), pp. 447–56. Cited by: §1.1.
  • J. R. Green and N. L. Stokey (2007) A two-person game of information transmission. Journal of Economic Theory 127 (1), pp. 90–104. Cited by: §1.
  • S. J. Grossman (1981) The informational role of warranties and private disclosure about product quality. Journal of Law & Economics 24 (3), pp. 461–483. Cited by: §1, §5.
  • S. Hurkens and N. Kartik (2008) Would i lie to you? on social preferences and lying aversion. Note: forthcoming in Experimental Economics Cited by: §1.
  • M. Ivanov (2007) Informational control and organizational design. Note: mimeo, Pennsylvania State University Cited by: §6.
  • N. Kartik, M. Ottaviani, and F. Squintani (2007) Credulity, lies, and costly talk. Journal of Economic Theory 134 (1), pp. 93–116. Cited by: §1.1, §1.1, §3.1.
  • N. Kartik (2005) On cheap talk and burned money. Note: mimeo, University of California, San Diego External Links: Link Cited by: footnote 3.
  • N. Kartik (2007) A note on cheap talk and burned money. Journal of Economic Theory 136 (1), pp. 749–758. Cited by: footnote 3.
  • E. Kohlberg and J. Mertens (1986) On the strategic stability of equilibria. Econometrica 54 (5), pp. 1003–1037. Cited by: §3.2.
  • J. M. Lacker and J. A. Weinberg (1989) Optimal contracts under costly state falsification. Journal of Political Economy 97 (6), pp. 1345–1363. Cited by: §1.
  • H. Lin and M. F. McNichols (1998) Underwriting relationships, analysts’ earnings forecasts and investment recommendations. Journal of Accounting and Economics 25, pp. 101–127. Cited by: §1.
  • G. Maggi and A. Rodriguez-Clare (1995) Costly distortion of information in agency problems. RAND Journal of Economics 26 (4), pp. 675–689. Cited by: §1.
  • G. Mailath (1987) Incentive compatability in signaling games with a continuum of types. Econometrica 55 (6), pp. 1349–1365. Cited by: §1.1, §3.1, Appendix A: Proofs, Appendix A: Proofs.
  • A. Manelli (1996) Cheap talk and sequential equilibria in signaling games. Econometrica 69 (4), pp. 917–942. Cited by: §1.1.
  • R. Michaely and K. L. Womack (1999) Conflict of interest and the credibility of underwriter analyst recommendations. Review of Financial Studies 12 (4), pp. 653–86. Cited by: §1.
  • P. R. Milgrom (1981) Good news and bad news: representation theorems and applications. Bell Journal of Economics 12 (2), pp. 380–391. Cited by: §1, §5.
  • P. Milgrom and J. Roberts (1986a) Pricing and advertising signals of product quality. Journal of Political Economy 94 (4), pp. 796–821. Cited by: §1.
  • P. Milgrom and J. Roberts (1986b) Relying on the information of interested parties. RAND Journal of Economics 17 (1), pp. 18–32. Cited by: §5.1, §5.
  • R. Myerson and M. Satterthwaite (1983) Efficient mechanisms for bilateral trading. Journal of Economic Theory 28, pp. 265–281. Cited by: §6.
  • M. Ottaviani and F. Squintani (2006) Naive audience and communication bias. International Journal of Game Theory 35 (1), pp. 129–150. Cited by: §1.1, §1.1, §2.1.
  • S. Sánchez-Pagés and M. Vorsatz (2006) Enjoy the silence: an experiment on truth-telling. Note: mimeo, University Maastricht Cited by: §1.
  • D. J. Seidmann and E. Winter (1997) Strategic information transmission with verifiable messages. Econometrica 65 (1), pp. 163–170. Cited by: §5.
  • M. Spence (1973) Job market signaling. Quarterly Journal of Economics 87 (3), pp. 355–374. Cited by: §1.
  • J. C. Stein (1989) Efficient capital markets, inefficient firms: a model of myopic corporate behavior. Quarterly Journal of Economics 104 (4), pp. 655–669. Cited by: §1.1.
  • K. Valley, L. Thompson, R. Gibbons, and M. H. Bazerman (2002) How communication improves efficiency in bargaining games. Games and Economic Behavior 38, pp. 127–155. Cited by: §6.
  • R. E. Verrecchia (1983) Discretionary disclosure. Journal of Accounting and Economics 5, pp. 179–194. Cited by: footnote 25.
HTML from LaTeXML, with custom CSS/JS. The PDF is more accurate.