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

How Wasteful is Signaling?††thanks: We thank Nageeb Ali, Emir Kamenica, Hongcheng Li, Elliot Lipnowski, George Mailath, Benny Moldovanu, Georg Nöldeke, Andrea Prat, Refine.ink, Larry Samuelson, and Joel Sobel for helpful comments.

Alex Frankel University of Chicago, Booth School of Business; Email: afrankel@chicagobooth.edu.    Navin Kartik Yale University, Department of Economics; Email: nkartik@gmail.com.
September 2026
Abstract

Signaling is wasteful. But how wasteful? We study the fraction of surplus dissipated in a separating equilibrium. For isoelastic environments, this waste ratio has a simple formula: β/(β+σ), where β is the benefit elasticity (reward to higher perception) and σ is the elasticity of higher types’ relative cost advantage. The ratio is constant across types and is independent of other parameters, including convexity of cost in the signal. We show that the directional effects of β and σ on waste extend to non-isoelastic environments. In an application to signaling tournaments, more competitors or fewer prizes increase waste, with full dissipation in large tournaments.

1 Introduction

Signaling is wasteful. In the canonical Spence (1973) model and its innumerable applications and descendants, agents take costly actions to distinguish themselves from lower types. The resulting separating equilibrium reveals information but necessarily dissipates surplus—a fundamental source of inefficiency under asymmetric information.111Of course, signaling activities can also generate benefits: education builds human capital; and prosocial behavior brings positive externalities, which signaling can amplify (Bénabou and Tirole, 2006). Our paper focuses on the wasteful component of signaling.

But how wasteful is signaling, and what does the waste depend on? Despite more than 50 years of research, these basic questions have received limited attention, and the literature does not offer simple answers.

A natural intuition suggests that the magnitude of waste should depend on the difficulty of signaling. If signaling costs are highly convex in the action (a “hard” test), agents encounter high marginal costs quickly, which ought to limit total expenditure. This reasoning suggests that policies that make signaling more difficult—via exam difficulty, advertising costs, or certification requirements—could reduce waste. However, while such policies reduce the level of signaling, they also increase the cost of lower signals.

Reducing signaling stakes instead—scaling down the benefits of being thought of as a higher type—also dampens signaling, and does indeed lower signaling costs. But reducing stakes also lowers signaling benefits. It is not obvious what the overall effect of difficulty or stakes is on the waste ratio, i.e., the proportion of private surplus burned through signaling.

Our paper studies the classic continuum-type signaling model used in economics, presented formally in Section 2, and focuses on the essentially unique separating equilibrium. Our main result, Theorem 1 in Section 3, has two parts. First, under a standard multiplicative cost structure, the waste ratio is invariant to both difficulty and stakes. Importantly, difficulty captures not just the scale of costs, but also the shape (convexity).

Second, consider a canonical isoelastic class of costs and benefits: the cost for type θ of taking signaling action a is given by C⁢(a,θ)=D⁢(a)⁢θ−σ, while the benefit of being thought of as type θ^ is V⁢(θ^)=s⁢θ^β. Here, β>0 is the elasticity of benefits (how steeply rewards rise with perceived type), σ>0 is the elasticity of cost “strain” (how quickly higher types’ comparative advantage grows), and D⁢(⋅) and s>0 are the difficulty and stakes respectively. Under such isoelasticity, we find that the waste ratio for any type is the constant

W=ββ+σ.

Waste thus depends only on β/σ, increasing from zero to one in that fraction. This constant waste ratio avoids issues of aggregation across types and delivers a simple answer to our motivating question.

We then show in Theorem 2 that (under multiplicative costs) waste is constant across types if and only if the costs and benefits satisfy a constant relative elasticity condition. Hence, up to the labeling of types, the isoelastic class is the unique setting for such uniform dissipation. This characterization provides a theoretical foundation for the isoelastic specification.

Theorem 3 establishes comparative statics beyond the isoelastic specification: when benefit and cost strain elasticities are type dependent, a pointwise increase in the benefit elasticity and pointwise decrease in the strain elasticity imply a higher waste at every type. This generalizes the directional effects of β and σ seen in the isoelastic waste formula.

In Section 4, we relate the waste ratio, which accounts only for agents’ private benefits from signaling, to the social value of information. Specifically, we consider a labor market in which workers signal to competing firms that make productive investments complementary to the type of worker they hire. We compare the separating equilibrium to a pooling equilibrium, which avoids waste but has less efficient investments. The efficiency benefits of separation outweigh the signaling costs when the type distribution is sufficiently spread out or when the signaling technology has high strain elasticity.

In Section 5, we apply our results to signaling in tournaments. When N candidates compete for m prizes, the waste increases in N and decreases in m. In other words, greater competition for prizes yields higher rent dissipation. With symmetric agents and any fixed number of prizes, a growing field eventually dissipates all surplus. One special case is with uniformly distributed types, unit strain elasticity, and a winner-take-all market with m=1. In that case, the waste ratio takes the simple form of (N−1)/N, which is precisely the dissipation rate in classic Tullock (1980) contests.

The conclusion, Section 6, discusses implications, interpretations, and limitations.

Related Literature.

The costly signaling literature in economics, surveyed by Riley (2001) and Sobel (2009), identifies conditions for separating equilibria and highlights that information revelation entails surplus dissipation. However, we are aware of little work that systematically analyzes this waste. A notable exception is Hoppe, Moldovanu, and Sela (2009), who show that in a continuum model of two-sided signaling before assortative matching, exactly half of total output is dissipated. Viewed agent by agent, their model in fact maps into ours, with the one-half quantity emerging from our waste formula under their parameters; fn. 8 elaborates. Another exception is Bernheim and Bodoh-Creed (2023), who show that dissipation can vanish when agents have heterogeneous bliss points and choose many actions (or, equivalently, costs are scaled up). Our paper instead quantifies waste in the canonical signaling setting with homogeneous bliss points.

In the biological signaling literature, Nöldeke and Samuelson (1999) show that offspring’s equilibrium cost is proportional to parents’ fitness loss, with a constant depending only on genetic relatedness. Their analysis does not yield a constant waste ratio (cost relative to sender’s benefit, which need not track parental loss), and their assumption of a linear cost precludes questions about signaling difficulty. But our paper shares with them a common theme that given some structure, dissipation can admit a simple formula based on primitive parameters, with certain invariance properties. By contrast, Bergstrom et al. (2002) point out that without structure, little can be said about the equilibrium level of signaling costs.

We discuss some other literature connections later in the paper.

2 Model

An agent has type θ∈Θ:=[0,θ¯⟩, where 0<θ¯≤∞.222We use the notation [0,x⟩ to mean [0,x] if x<∞ and [0,∞) if x=∞. The type is drawn from some distribution with full support on Θ. After privately learning her type, the agent chooses a publicly observable signal or action a∈ℝ≥0. An observer sees the action and forms a belief θ^∈Θ about the agent’s type.333As we will focus on separating equilibria, we only need to consider degenerate beliefs on a single type. The agent’s payoff is V⁢(θ^)−C⁢(a,θ). We maintain throughout the following assumption (primes and subscripts on functions denote derivatives in the usual manner).

Assumption 1.

The benefit function V:Θ→ℝ≥0 and cost function C:ℝ≥0×Θ→ℝ≥0∪{∞} satisfy:

  1. 1.

    V is continuous, with V⁢(0)=0; on the interior (0,θ¯), it is continuously differentiable with V′⁢(θ)>0.

  2. 2.

    On ℝ≥0×(0,θ¯⟩, C is finite and continuous with C⁢(0,θ)=0; on ℝ>0×(0,θ¯⟩, C is differentiable in a with Ca>0, and Ca is continuously differentiable with Ca⁢θ<0; and for each θ>0, lima→∞C⁢(a,θ)=∞. The lowest type has cost C⁢(a,0)=limθ→0C⁢(a,θ) for all a.

Part 1 of Assumption 1 says that agents prefer to be perceived as higher types, with the benefit from the lowest perception normalized to zero. Part 2 says that higher actions are costlier, and higher types have lower marginal costs. While it may be natural for costs to be convex in the action, we don’t need to assume that. Part 2 also normalizes C⁢(0,θ)=0 for all θ, so that the payoff from taking the lowest action and receiving the lowest perception is zero. The technical conditions in the two parts are largely standard; note that we allow for type 0 to have infinite costs for actions a>0 to encompass canonical isoelastic costs, detailed in Section 3.

Equilibrium.

We study (fully) separating equilibria. The equilibrium definition is standard and relegated to Appendix A, where Proposition 2 shows that any separating equilibrium can be described by a continuous, strictly increasing agent (pure) strategy A:Θ→ℝ≥0 that is differentiable at interior types and satisfies A⁢(0)=0. Incentive compatibility requires that each type θ optimally chooses A⁢(θ) given that the observer correctly inverts the strategy on the equilibrium path, i.e., when beliefs satisfy θ^⁢(a)=A−1⁢(a) in the range of A. Off-path beliefs can simply be set to θ^⁢(⋅)=0.

Thus, in a separating equilibrium A, any type θ solves

maxa⁡[V⁢(θ^⁢(a))−C⁢(a,θ)],

where θ^⁢(⋅)=A−1⁢(⋅). For θ∈(0,θ¯), the first-order condition evaluated at the optimal action A⁢(θ) is

Ca⁢(A⁢(θ),θ)=V′⁢(θ)⋅θ^′⁢(A⁢(θ))=V′⁢(θ)A′⁢(θ), (1)

where the first equality uses θ^⁢(A⁢(θ))=θ and the second uses θ^′⁢(A⁢(θ))=1/A′⁢(θ).

Equation 1 has a simple interpretation. Its left-hand side is the marginal cost of increasing the action; the right-hand side is the marginal benefit of inducing a higher belief scaled by the marginal increase in action required for that higher belief. Together with A⁢(0)=0, Equation 1 defines a boundary-value differential equation in A. There is a unique solution by standard arguments.444More precisely, standard existence and uniqueness results for ordinary differential equations can be applied on (0,θ¯) and extended to the boundary by continuity; see the arguments in, for example, Mailath (1987) or Kartik (2009). That solution, which we continue to refer to as just A subsequently, characterizes the unique separating equilibrium (uniqueness is up to the specification of off-path beliefs); sufficiency is verified by Proposition 3 in Appendix A.

The Waste Ratio.

To measure signaling inefficiency we define three quantities. The opt-out payoff UO⁢(θ):=V⁢(0)−C⁢(0,θ)=0 is what a type would get if it chose the least-cost action and was perceived as the lowest type. The complete-information payoff UC⁢I⁢(θ):=V⁢(θ)−C⁢(0,θ)=V⁢(θ) is what a type would get if it revealed itself costlessly. Lastly, U⁢(θ):=V⁢(θ)−C⁢(A⁢(θ),θ) is a type’s separating equilibrium payoff.

Definition 1.

The waste ratio for type θ>0 is the fraction of its payoff from costless separation that is dissipated through costly signaling:

W⁢(θ):=UC⁢I⁢(θ)−U⁢(θ)UC⁢I⁢(θ)−UO⁢(θ)=C⁢(A⁢(θ),θ)V⁢(θ). (2)

We refer to the denominator V⁢(θ) as surplus: it is the payoff that type θ would hypothetically get by verifying her type at zero cost. The numerator C⁢(A⁢(θ),θ) is the deadweight loss from signaling. The ratio W⁢(θ) thus measures the effective “tax” that the separating equilibrium imposes on the agent to secure her surplus.

Note that our definition of waste compares the agent’s cost of information revelation to a frictionless benchmark in which information is revealed at no private cost. This benchmark is, of course, unachievable. Relatedly, we are not defining waste relative to a pooling equilibrium or any other equilibrium. Waste is also only defined in terms of the agent’s private surplus, not necessarily social surplus from information. We discuss social surplus and pooling equilibria in Section 4.

Our goal is to understand how the waste ratio (2) depends on the parameters of the signaling environment.555The waste ratio can be viewed as analogous to the “Price of Anarchy” in algorithmic game theory (Koutsoupias and Papadimitriou, 1999; Roughgarden, 2005). That literature generally studies worst-case bounds across multiple equilibria; we are interested in the exact value in the separating equilibrium. Furthermore, we define waste pointwise across types, whereas Bayesian Price of Anarchy typically uses ex-ante expected payoffs (Roughgarden et al., 2017). A consequence of our results is that the latter distinction is rendered moot in isoelastic environments.

3 Signaling’s Waste

We hereafter focus on multiplicatively separable costs—or just multiplicative costs, for short—that are commonplace in signaling models. Formally, we assume that

C⁢(a,θ)=D⁢(a)⋅S⁢(θ), (3)

where D:ℝ≥0→ℝ≥0 and S:Θ→ℝ>0∪{∞}. Here D⁢(a) represents the difficulty of action a (relative to other actions) and S⁢(θ) represents the strain experienced by type θ (relative to other types). Assumption 1 part 2 implies (i) D⁢(0)=0, D′⁢(a)>0 for a>0, and lima→∞D⁢(a)=∞; and (ii) for θ>0, we have S⁢(θ) finite and S′⁢(θ)<0, while S⁢(0)=limθ→0S⁢(θ). Note that S⁢(0)=∞ corresponds to type 0 facing prohibitive signaling costs for any a>0.666But C⁢(0,0)=D⁢(0)⁢S⁢(0)=0, using the convention 0×∞=0.

It is also useful to write, without loss,

V⁢(θ)=s⋅B⁢(θ),

where s>0 represents the agent’s stakes in signaling and B:Θ→ℝ≥0.

We define, for interior θ, the benefit elasticity

β~⁢(θ):=d⁢ln⁡V⁢(θ)d⁢ln⁡θ=d⁢ln⁡B⁢(θ)d⁢ln⁡θ=θ⁢B′⁢(θ)B⁢(θ)>0,

and, for multiplicative costs, the strain elasticity

σ~⁢(θ):=−∂ln⁡C⁢(a,θ)∂ln⁡θ=−d⁢ln⁡S⁢(θ)d⁢ln⁡θ=−θ⁢S′⁢(θ)S⁢(θ)>0.

This pair of elasticity functions characterizes an environment under multiplicative costs: given β~ and σ~, one can recover B and S up to normalization constants.

3.1 The Constant of Dissipation

A leading parametric specification is that of isoelastic costs and benefits:

Definition 2.

An isoelastic environment is defined by

B⁢(θ)=θβandS⁢(θ)=θ−σ,

for some constant benefit elasticity β>0 and constant strain elasticity σ>0.

Note that the definition stipulates isoelasticity in B and S, but not in difficulty D. Our first result says that multiplicative costs ensure the waste ratio is independent of stakes and difficulty, and isoelasticity further implies a constant waste ratio across types.

Theorem 1.

Under multiplicative costs:

  1. 1.

    The waste ratio W⁢(θ) is invariant to stakes (s) and difficulty (D⁢(⋅)).

  2. 2.

    In an isoelastic environment, the waste ratio is constant: for any θ>0, it is

    W⁢(θ)=ββ+σ. (4)

The irrelevance of the difficulty D in the first part of Theorem 1 is straightforward: since actions are differentiated only through their costs, changing D⁢(a) amounts to relabeling actions without affecting equilibrium costs.777Given any cost function C⁢(a,θ), equilibrium costs and waste will be unchanged by relabeling actions. Multiplicative costs permit the relabeling to be interpreted as a type-independent change in the cost of an action—the action’s “difficulty”. The irrelevance to stakes s follows from a two-step decomposition. Scaling both stakes and difficulty by α>0 yields a strategically equivalent game, preserving both equilibrium actions and the waste ratio. Scaling difficulty (but not stakes) back down by 1/α then leaves equilibrium costs, and hence the waste ratio, unchanged.

The theorem’s second part provides a remarkably simple formula for how much surplus is wasted by signaling in isoelastic environments. The textbook example (e.g., Fudenberg and Tirole, 1991, p. 329) with B⁢(θ)=θ and C⁢(a,θ)=a/θ corresponds to β=σ=1, and so precisely 50% of the surplus is dissipated.888This waste ratio of 1/2 also appears in Hoppe, Moldovanu, and Sela (2009, Proposition 8). Translating their two-sided signaling model into our notation agent by agent, and assuming symmetric type distributions, an agent of type θ who takes signaling action a and is thought to be type θ^ receives payoff θ⋅θ^−a; maximizing that expression is equivalent to maximizing θ^−a/θ, i.e., a case of σ=β. More generally, only the ratio β/σ matters; waste is monotonically increasing in β/σ, ranging all the way from 0 to 1. These directional effects are intuitive. Higher β means a greater incentive to separate from lower types; the rat race for higher beliefs becomes fiercer and more of the surplus is burned. Conversely, higher σ confers a stronger relative cost advantage to higher types, so separation requires less waste.

To explain why isoelasticity delivers a constant waste, we present the theorem’s proof.

  • Proof of Theorem 1.

    Substituting Ca⁢(a,θ)=D′⁢(a)⁢S⁢(θ) and V⁢(θ)=s⁢B⁢(θ) into Equation 1, the separating strategy A satisfies (for interior θ) the differential equation

    D′⁢(A⁢(θ))⁢A′⁢(θ)=s⁢B′⁢(θ)S⁢(θ).

    As the left-hand side is dd⁢θ⁢D⁢(A⁢(θ)), integrate from 0 to θ to obtain

    D⁢(A⁢(θ))=s⁢∫0θB′⁢(t)S⁢(t)⁢𝑑t,

    using D⁢(A⁢(0))=D⁢(0)=0; when the type space includes θ¯, the equality extends to θ=θ¯ by continuity of both sides.

    Thus, equilibrium costs are999Equilibrium costs act similarly to payments in mechanism design, and the derivation of Equation 5 is akin to that of the payment identity there (Myerson, 1981). Appendix F fleshes out the link: after a type-by-type rescaling, (5) is the mechanism-design payment identity, and the signaling game maps to an all-pay auction through which revenue equivalence and order statistics recover the constant-waste formula (4) under isoelasticity.

    C⁢(A⁢(θ),θ)=D⁢(A⁢(θ))⁢S⁢(θ)=s⁢S⁢(θ)⁢∫0θB′⁢(t)S⁢(t)⁢𝑑t, (5)

    and the waste ratio is

    W⁢(θ)=C⁢(A⁢(θ),θ)V⁢(θ)=S⁢(θ)B⁢(θ)⁢∫0θB′⁢(t)S⁢(t)⁢𝑑t. (6)

    Both the stakes s and the difficulty D⁢(⋅) have canceled, establishing part 1.

To better interpret the formula (6), define for θ>0 and t∈[0,θ],

Gθ⁢(t):=B⁢(t)/S⁢(t)B⁢(θ)/S⁢(θ).

Then Gθ is a cumulative distribution function on [0,θ] and we can rewrite (6) as101010In more detail: observe that Gθ⁢(0)=0 (using B⁢(0)=0), Gθ⁢(θ)=1, and for interior t, we have B⁢(t)>0, B′⁢(t)>0, and S′⁢(t)<0, so (B/S)′⁢(t)>0. Hence, Gθ is strictly increasing on [0,θ] and is a cumulative distribution function. Its density is gθ⁢(t)=(B/S)′⁢(t)B⁢(θ)/S⁢(θ). Rewriting the integrand of (6) using B′⁢(t)S⁢(t)=β~⁢(t)β~⁢(t)+σ~⁢(t)⋅(BS)′⁢(t), which can be verified by expanding (B/S)′, and then multiplying by S⁢(θ)/B⁢(θ) yields the integrand β~⁢(t)β~⁢(t)+σ~⁢(t)⁢gθ⁢(t).

W⁢(θ)=∫0θβ~⁢(t)β~⁢(t)+σ~⁢(t)⁢𝑑Gθ⁢(t). (7)

That is, the waste at θ is a weighted average of the ratios β~⁢(t)/(β~⁢(t)+σ~⁢(t)) across types t<θ.

Part 2 of the theorem follows immediately because in an isoelastic environment the integrand in (7) is the constant β/(β+σ). ∎

We highlight that, even outside isoelastic environments, Equation 7 expresses waste at any type θ as a weighted average of the ratios β~⁢(t)/(β~⁢(t)+σ~⁢(t)) across all lower types t<θ. We rely on this formula in later analyses.

Example 1.

An isoelastic environment with difficulty D⁢(a)=d⋅aγ for d>0 and γ>0 yields the following separating equilibrium quantities:

A⁢(θ)=(s⁢βd⁢(β+σ))1/γ⁢θ(β+σ)/γandC⁢(A⁢(θ),θ)=s⁢ββ+σ⁢θβ.

Recall that the benefit function is V⁢(θ)=s⁢θβ and waste is W⁢(θ)=C⁢(A⁢(θ),θ)/V⁢(θ). Hence, W⁢(θ)=β/(β+σ). So the difficulty parameters d and γ affect equilibrium actions, but not costs or benefits, and hence not waste. Stakes s affect actions, costs, and benefits, but not waste.

Multiplicative separability of costs is important for Theorem 1 part 1; Appendix E confirms that more generally the waste ratio can either decrease or increase in stakes.111111Multiplicative costs are immaterial for another invariance: the waste ratio W⁢(θ) does not depend on the type distribution F. This invariance owes to the well-known property that the separating equilibrium strategy only depends on the support of F. The strategy discontinuity at complete information carries over to waste; in particular, under isoelasticity, waste equals β/(β+σ) for any full-support F, even though it would be zero under complete information. Similarly, the isoelastic environment is important for part 2 of the theorem. In fact, up to a normalization of types, the constant-waste property characterizes isoelasticity under multiplicative costs. That is the content of our next result, whose proof is in Appendix B.

Theorem 2.

Under multiplicative costs, the waste ratio W⁢(θ) is constant in θ>0 if and only if the ratio of benefit-to-cost elasticities β~⁢(θ)/σ~⁢(θ)=ρ for some constant ρ>0. The waste ratio then is W⁢(θ)=β~⁢(θ)/(β~⁢(θ)+σ~⁢(θ))=ρ/(1+ρ).

Thus, when the ratio of the benefit-to-cost elasticities is constant across types, the tension between signaling incentives and costs resolves identically for all types. In fact, using Equation 7, Proposition 4 in Appendix B establishes a more general result: the waste ratio is monotone in type if the benefit-to-cost elasticity ratio is monotone in type.

To see why Theorem 2 characterizes the isoelastic environment up to relabeling types, note that a constant ratio of benefit-to-cost elasticities ρ means d⁢ln⁡B/(−d⁢ln⁡S)=ρ, and hence S=κ⁢B−1/ρ for some κ>0. Since V is strictly increasing and V⁢(0)=0, it can be reparameterized as V⁢(t)=s⁢tβ via the change of variable t=(V⁢(θ)/s)1/β. It follows that B⁢(t)=tβ, and therefore S⁢(t)=κ⁢t−β/ρ=κ⁢t−σ, where σ=β/ρ. Absorbing the constant κ into D⁢(⋅) yields the isoelastic form.

We note that the assumption of multiplicative costs cannot be dropped from Theorem 2. Proposition 7 in Appendix E shows that a non-multiplicative cost can have constant waste without a constant-elasticity structure.

3.2 Beyond Isoelasticity

Equation 4 implies that waste in isoelastic environments increases when β is higher or σ is lower. Our next result generalizes that comparative static to non-isoelastic cases.

Theorem 3.

Assume multiplicative costs. Consider two environments with benefit and strain elasticities (β~1,σ~1) and (β~2,σ~2) respectively, and corresponding waste ratios W1 and W2. For any θ′>0, if β~2⁢(θ)≥β~1⁢(θ) and σ~2⁢(θ)≤σ~1⁢(θ) for all θ∈(0,θ′), then W2⁢(θ′)≥W1⁢(θ′).

Note that β~2≥β~1 is equivalent to (ln⁡B2)′≥(ln⁡B1)′, which in turn is equivalent to B2/B1 nondecreasing; similarly, σ~2≤σ~1 is equivalent to (ln⁡S2)′≥(ln⁡S1)′, or S2/S1 nondecreasing. So the conditions in Theorem 3 can also be viewed as monotone ratios.

The intuition for the result can be seen from Equation 7: a pointwise increase in β~ and decrease in σ~ raises the integrand β~/(β~+σ~) pointwise, pushing waste up. The formal proof in Appendix C is more nuanced because the weighting distribution Gθ also differs across environments.121212The proof also establishes that if, in addition, either of the elasticity hypotheses holds strictly on a positive measure of types below θ′, then W2⁢(θ′)>W1⁢(θ′).

Example 2.

Consider two environments, one with benefit function B1⁢(θ)=θ and the other with B2⁢(θ)=eθ−1. Both have a common strain function S⁢(θ)=θ−1. The first environment is thus isoelastic with β=σ=1, and has constant waste W1=1/2. The benefit elasticity in the second environment is β~2⁢(θ)=θ⁢eθ/(eθ−1)>1=β~1⁢(θ) for all θ>0. A straightforward computation from Equation 6 yields

W2⁢(θ)=1/θeθ−1⁢∫0θt⁢et⁢𝑑t=(θ−1)⁢eθ+1θ⁢(eθ−1),

which increases from 1/2 (as θ→0) to 1 (as θ→∞). The higher benefit elasticity in the second environment thus yields higher waste at every type.

The elasticity-ranking hypotheses in Theorem 3 are not necessary for its conclusion; after all, in isoelastic environments, waste only depends on the ratio β/σ. However, the hypotheses are tight in the following sense: if β~2⁢(θ)<β~1⁢(θ) for some type θ, there is a common strain function S—in fact, an isoelastic one—such that W2⁢(θ′)<W1⁢(θ′) at some type θ′, and symmetrically for the σ~ condition. See Appendix C.

Lastly, there are simple bounds on waste even without knowing exact forms of the benefit or strain functions. Specifically, Equation 7 directly yields that if there are constants β¯ and σ¯ such that β~⁢(θ)≤β¯ and σ~⁢(θ)≥σ¯ for all θ, then W⁢(θ)≤β¯/(β¯+σ¯) for all θ. Symmetrically, if β~⁢(θ)≥β¯ and σ~⁢(θ)≤σ¯ for all θ, then W⁢(θ)≥β¯/(β¯+σ¯) for all θ.

Example 3.

Suppose the benefit function is V⁢(θ)=θ2 (so β~⁢(θ)=2) but the cost function is only known to have strain elasticity σ~⁢(θ)∈[1,3] for all θ. Then W⁢(θ)∈[2/5, 2/3]; in other words, signaling dissipates between 40% and 67% of each type’s surplus, regardless of the exact strain elasticity.

4 Is the Waste Worth It?

Our waste ratio only factors in the cost of signaling relative to agents’ private benefits from market beliefs. The social value of learning agents’ types may be different from agents’ private value—higher, lower, or even zero. In this section, we explore how the waste from signaling relates to the social value of information in a simple extension of our isoelastic specification.

Assume that agents are workers in a labor market in which firms compete profits down to zero; hence, the social value of information will be fully internalized into agent payoffs.131313This exercise, comparing payoffs in a regime with no information to another regime with costs of generating information as well as allocative benefits of using it, has analogs in other contexts in Hartline and Roughgarden (2008), Hoppe, Moldovanu, and Sela (2009, Sections 6–7), Bulow and Klemperer (2012), and Chakravarty and Kaplan (2013). Specifically, after observing the agent’s signaling action, multiple firms each offer a wage to hire the agent. The agent accepts the highest wage offer, and the hiring firm then takes a decision x∈ℝ≥0, which we interpret as an investment level, that yields gross profit

α⁢θ⁢xγ−x. (8)

So the investment of x is complementary to the agent’s type, leading to output α⁢θ⁢xγ. We assume that α>0 and γ∈(0,1).141414The linearity of (8) in θ is a normalization within the class of power functions. If output were instead α⁢θr⁢xγ for some r>0, we could redefine the type as θ˘=θr, with corresponding benefit and cost elasticities (discussed subsequently) β˘=β and σ˘=σ/r. A routine calculation shows that when a firm believes the agent’s type has expectation θ^, it expects a profit of s⁢θ^β, where s>0 depends on α and γ, and β:=11−γ>1.151515Given expected type θ^, the firm’s optimal investment is x=(α⁢γ⁢θ^)11−γ. Substituting into (8) yields expected profit α11−γ⁢(γγ1−γ−γ11−γ)⁢θ^β. We assume 𝔼⁢[θβ] is finite.

Thus, firm competition implies the agent’s benefit from signaling is V⁢(θ^)=s⁢θ^β. This microfounds our isoelastic benefit specification. The less concave are firms’ outputs (higher γ), the more responsive are their optimal investments and expected profits to the agent’s perceived type, and thus the more convex is the agent’s benefit function.

Define the gross separation value (GSV) as the ex-ante expected social surplus under complete information, the net separation value (NSV) as that minus the expected cost of signaling, and the pooling value (PV) as the surplus when firms invest based on the agent’s mean type. That is,

G⁢S⁢V:=s⁢𝔼⁢[θβ],N⁢S⁢V:=G⁢S⁢V−𝔼⁢[C⁢(A⁢(θ),θ)],P⁢V:=s⁢(𝔼⁢[θ])β.

With an isoelastic signaling cost, our waste formula (4) implies 𝑁𝑆𝑉=σβ+σ⁢G⁢S⁢V. Consequently, separation has higher net value than pooling if and only if

σβ+σ>(𝔼⁢[θ])β𝔼⁢[θβ]. (9)

The left-hand side is the fraction of surplus not dissipated by signaling. The right-hand side—the pooling efficiency ratio—is PV/GSV, the fraction of surplus captured in a pooling equilibrium (which has no signaling waste). Since β>1, this pooling efficiency ratio is strictly below 1 (by Jensen’s inequality) and it decreases in β.161616For β>1, Lyapunov’s inequality implies (𝔼⁢[θβ])1/β is increasing in β, and hence so is ϕ⁢(β):=1β⁢ln⁡𝔼⁢[θβ]. Since ln⁡(𝔼⁢[θ])β𝔼⁢[θβ]=−β⁢(ϕ⁢(β)−ϕ⁢(1)), it follows that the left-hand side of this display—and hence also the pooling efficiency ratio—is decreasing in β.

Inequality (9) is instructive. A higher strain elasticity σ reduces signaling waste and unambiguously favors separation. A higher benefit elasticity β (stemming from a less concave firm output function) increases the waste ratio but also reduces the pooling efficiency ratio, as the social value of information is larger. The net effect on inequality (9) depends on the type distribution, which affects the pooling efficiency ratio but not the waste ratio.

We can also look at the role of the type distribution. The distribution does not affect signaling payoffs on the left-hand side of (9), as previously established, but it does affect pooling efficiency on the right-hand side. Intuitively, information is more valuable when there is more uncertainty, i.e., when the prior distribution is more spread out. Indeed, since θβ is convex, a mean-preserving spread of types raises 𝔼⁢[θβ] without changing (𝔼⁢[θ])β; the pooling efficiency ratio thus falls, favoring separation. If the support of the type distribution is unbounded (θ¯=∞), then for any fixed β and σ, sufficient type heterogeneity justifies separation regardless of how large the waste ratio is. Conversely, if type heterogeneity is sufficiently limited, then pooling dominates separation. For instance, when β=2, inequality (9) reduces to the coefficient of variation of θ exceeding 2/σ; the type distribution matters only through that one statistic. When σ=2 as well, the threshold is 1, which is indeed the condition in Hoppe, Moldovanu, and Sela (2009, Proposition 9) for assortative matching to be welfare superior to random matching—their analogs of our separation and pooling.171717This is not a coincidence: following fn. 8, their setting with symmetric type distributions can be translated into ours with σ=β, so that half of each agent’s gross benefit from matching is dissipated. Since their multiplicative match output makes that gross benefit quadratic in own type, their comparison also reduces to (1/2)⁢𝔼⁢[θ2]≷(𝔼⁢[θ])2, which corresponds to inequality (9) at β=σ=2.

Example 4.

Consider a log-normal distribution of types: ln⁡θ∼𝒩⁢(0,ν2), where the zero mean is a normalization and the variance is ν2>0. Here 𝔼⁢[θβ]=exp⁡(β2⁢ν2/2) and (𝔼⁢[θ])β=exp⁡(β⁢ν2/2), so the pooling efficiency ratio is

exp⁡(−ν2⁢β⁢(β−1)/2).

Pooling efficiency thus decays exponentially in both the variance of log-types and the benefit elasticity. Rearranging (9), separation dominates pooling despite signaling’s waste if and only if

ν2>2⁢ln⁡(1+β/σ)β⁢(β−1). (10)

A higher variance ν2 makes separation relatively more appealing than pooling. In this example, a higher benefit elasticity β also makes separation relatively more appealing, as one can verify that the right-hand side of (10) decreases in β.

5 Application: Competition and Waste

We now apply our results to signaling tournaments, in which agents compete for a prize. Specifically, a set of agents each draw a type and take a signaling action. After observing these actions, a designer awards a prize—a job offer, a promotion, college admission—to the agent with the highest inferred type. We will use our earlier results to show that more agents or fewer prizes increase signaling waste. In other words, more competitive tournaments yield more waste.

5.1 Symmetric Agents and One Prize

To begin, consider a tournament among N≥2 agents for a single prize of value s>0. Agents’ types are their private information, drawn independently from a common cumulative distribution F on [0,1] with continuous density f⁢(θ)>0 for θ>0. Agents simultaneously choose their observable signaling actions a, at multiplicative cost C⁢(a,θ) satisfying Assumption 1 part 2. The prize is awarded to the agent with the highest perceived type.

If agent i is perceived as type θ^i, her probability of winning is ℙ⁢(θ^i>maxj≠i⁡θ^j). In a symmetric separating equilibrium, an agent’s expected benefit is thus

V⁢(θ)=s⋅(F⁢(θ))N−1.

So the tournament induces a signaling game with a specific benefit function that depends on the type distribution and the number of agents. Letting B⁢(θ):=(F⁢(θ))N−1, the benefit elasticity β~ is

β~⁢(θ)=θ⁢B′⁢(θ)B⁢(θ)=θ⁢(N−1)⁢f⁢(θ)⁢(F⁢(θ))N−2(F⁢(θ))N−1=(N−1)⁢θ⁢f⁢(θ)F⁢(θ).

An immediate observation is that the benefit elasticity at each type θ is increasing in the number of agents N. Hence, by Theorem 3, the waste ratio is increasing in the number of agents. Moreover, β~⁢(θ) grows without bound in N at each θ>0, so the integrand β~⁢(t)/(β~⁢(t)+σ~⁢(t)) in (7) tends to one pointwise. Proposition 1 below confirms that all surplus is dissipated in large tournaments as N→∞.

With further assumptions on the type distribution and cost function, we obtain an isoelastic environment. Consider a power-function distribution F⁢(θ)=θz for some z>0. Then the benefit function is B⁢(θ)=θ(N−1)⁢z, with constant benefit elasticity β=(N−1)⁢z. If costs are also of the isoelastic form C⁢(a,θ)=D⁢(a)⁢θ−σ with constant strain elasticity σ>0, then Theorem 1 delivers a constant waste ratio of

W⁢(θ)=(N−1)⁢z(N−1)⁢z+σ. (11)

In particular, for a uniform distribution (z=1) and unit strain elasticity (σ=1), the constant waste is simply (N−1)/N. More generally, in the isoelastic case waste increases in the type distribution’s elasticity z, because a higher z translates into greater convexity of the benefit function. Waste also decreases in the cost strain elasticity σ, as in our general analysis.

5.2 Multiple Prizes and Asymmetric Agents

The above logic can be extended to tournaments with multiple prizes and with heterogeneous agents.

Specifically, consider m identical prizes, where 1≤m<N. Prizes will be awarded to the m agents with the highest inferred types. Each agent i has a multiplicative cost function Ci⁢(a,θ), value si of winning a prize, and type independently drawn from a cumulative distribution Fi on [0,1] with continuous density fi⁢(θ)>0 for θ>0. The parameters Ci, si, and Fi are all commonly known; an agent’s private information is only her realized type θi. We say agents are symmetric if the parameters (Ci,si,Fi) do not vary with i.

In a separating equilibrium, agent i’s value Vi⁢(θ) is si times the probability that at most m−1 others have types above θ. Because of their heterogeneity, agents may have different separating strategies; agent i’s separating strategy Ai⁢(θi) depends on her own cost Ci and prize value si, and on her competitors’ type distributions (Fj)j≠i.181818As elaborated in Appendix F, with symmetric agents the separating equilibrium of the signaling tournament is equivalent to the symmetric equilibrium of a standard all-pay auction with m identical objects; an agent’s private type determines her bidding cost rather than her value of winning, but that is isomorphic. Heterogeneity then yields an asymmetric all-pay auction with bidder-specific rules for winning. The rule that awards the prizes to the top m inferred types can be thought of as the ex post efficient rule when social welfare is maximized by allocating prizes to higher types.

We fix a universe of possible agents, {1,2,…}, with each agent i described by (Ci,si,Fi), and consider the signaling tournament with m prizes and agents 1,…,N. Let the waste ratio for agent i≤N in the corresponding separating equilibrium be given by Wim,N⁢(θ).

Proposition 1.

In a signaling tournament with m prizes and N agents, any agent i’s waste ratio Wim,N⁢(θ) is increasing in N and decreasing in m at every type θ>0. Furthermore, if agents are symmetric, then for any θ>0, we have limN→∞Wim,N⁢(θ)=1.

In other words, a more competitive tournament—either because of more agents or fewer prizes—leads to more waste. These comparative statics follow from Theorem 3 once we establish (in Appendix D) that higher N and lower m both imply pointwise increases in each agent i’s benefit elasticity β~i⁢(θ). Moreover, with symmetric agents and a fixed number of prizes, eventually every type of every agent dissipates all her surplus.191919In fact, full dissipation admits a characterization beyond symmetric agents. Holding agent i’s cost function fixed, consider any sequence of tournaments in which the other agents, the type distributions, and the number of prizes may change with N. Then agent i’s waste ratio at θ>0 converges to one if and only if every type t<θ is eventually shut out of contention relative to θ: the ratio of agent i’s probability of winning a prize when her type is t to that probability when her type is θ tends to zero. See Remark 1 in Appendix D. There is also full dissipation in the aggregate: even though each agent’s expected signaling cost vanishes as the field grows, expected total costs across the N agents converge to s⋅m, the full value of the prizes (Proposition 6).

5.3 Discussion

The above analysis gives a different take on contests and competition than canonical Tullock (1980) contests (see Nitzan (1994) and Corchón (2007) for surveys). In Tullock contests, the vector of actions stochastically determines a winner. For instance, if symmetric agents pay an isoelastic cost xiγ (with γ≥1) to win with probability xi/∑jxj, or equivalently pay a cost of xi to win with probability xi1/γ/∑j(xj)1/γ, the rent dissipation rate is 1γ⁢N−1N.

Our signaling tournament is more like an all-pay auction, where the actions deterministically yield a winner, albeit through an endogenous mapping. Winning is uncertain only because an agent does not know rivals’ types, and thus their actions. Unlike in a Tullock contest with strictly convex costs (γ>1), a growing field of symmetric agents drives waste to full dissipation in the limit. Intuitively, with strictly convex costs, the noise in a Tullock contest can preserve some surplus even under extreme competition, whereas separating from a dense field of rivals forces full dissipation under signaling. The waste ratios in the two models coincide for every N only when the Tullock cost is linear (γ=1) and the signaling tournament’s strain elasticity matches the type distribution’s elasticity (σ=z).

More generally, the two models differ in how waste responds to the cost of effort. The Tullock rate 1γ⁢N−1N falls in the cost convexity γ: steeper marginal costs discourage effort. By contrast, Theorem 1 renders the difficulty D⁢(⋅) irrelevant to signaling waste. Separation forces agents to scale their actions with D⁢(⋅) exactly enough to leave the waste ratio unchanged. Signaling waste thus cannot be reduced by making better performance costlier; it falls only with a lower benefit elasticity (fewer competitors or more prizes) or a higher strain elasticity.

Tournament-like signaling and matching have also been studied in richer models by Hopkins (2012) and, as discussed earlier, Hoppe, Moldovanu, and Sela (2009). That the latter’s dissipation is bounded by one half even in large markets—whereas our one-sided tournament dissipates the entire surplus as N→∞—reflects their two-sided structure: each agent dissipates only the own-side rent from winning a better partner, while the other half of the surplus accrues to that partner. In our tournament, no partner absorbs surplus, and competition instead drives waste toward one.

6 Conclusion

We have proposed the waste ratio—the fraction of a type θ’s surplus dissipated through signaling—as a natural measure of signaling inefficiency in separating equilibria. Our main results tie waste to two elasticities under multiplicative costs: the benefit elasticity β~⁢(θ) and the strain elasticity σ~⁢(θ), a measure of higher types’ comparative advantage. Theorem 1 shows that the waste ratio is invariant to signaling stakes and difficulty, and in isoelastic environments where β~⁢(θ)≡β and σ~⁢(θ)≡σ it is the constant β/(β+σ). More generally, Theorem 3 shows that waste rises at every type when the benefit elasticity rises pointwise or the strain elasticity falls pointwise.

The invariance to difficulty undermines some common intuitions about the inefficiency of signaling. Consider the debate about the difficulty of standardized tests for college admissions. Recent trends favor shorter, less complex tests (such as the digital SAT) to reduce student stress. Conversely, some critics call for harder exams to restore selectivity. Our results suggest that, when viewed through the canonical signaling lens, neither approach may address the underlying waste. Adjusting the difficulty of the test uniformly for all students—whether making it easier or harder—need not change the total resource dissipation; it could merely rescale equilibrium effort while leaving the waste ratio constant.202020This invariance does rely on a single-dimensional framework; it could break if students also differ in test-taking aptitude separate from underlying ability, which would lead to “muddled information” (Frankel and Kartik, 2019). As long as admissions at selective colleges resemble winner-take-all signaling tournaments with many competitors, the process is likely to dissipate significant surplus, regardless of how the testing technology is calibrated.

Of course, college admission itself is not the final prize. There are concerns about the “winner-take-all” nature of the broader society (e.g., Frank and Cook, 1996). For a fixed distribution of underlying types, our isoelastic specification captures the inequality of socioeconomic outcomes via the benefit elasticity β. In particular, with value function V⁢(θ)=s⁢θβ, a higher β corresponds to more inequality via a more convex mapping from types to benefits. Our results show that a higher β—corresponding, perhaps, to the US versus lower inequality countries like Canada or Sweden—goes hand in hand with more waste from signaling.

The strain elasticity σ also matters. Another approach to reducing waste would be to make signaling instruments more discriminating in the sense of increasing σ. Returning to exams, a redesigned test that amplifies high-ability students’ comparative advantage—rather than scaling difficulty uniformly—would correspond to increasing σ and would indeed reduce waste. Interestingly, this echoes a discussion in the biological signaling literature: animals can often reliably convey information while incurring minimal waste. The mechanism stems from sharply different marginal costs across types—originally proposed by Zahavi (1977) to refine his earlier “handicap” hypothesis—rather than difficulty. Scholars have argued that because Darwinian selection favors efficiency, it leads to biological signals that are cheap for high-quality types but prohibitive for low-quality types (Penn and Számadó, 2020), corresponding to a high strain elasticity σ.

We close by commenting on some limitations of our analysis. First, we only study separating equilibria. That is consistent with much of the literature’s emphasis, often justified by stability-based arguments (e.g., Cho and Sobel, 1990). But there are also critiques of the exclusive focus on separating equilibria (e.g., Mailath et al., 1993). Equilibria with some pooling, where certain types choose identical actions, can reduce signaling costs and waste (e.g., Krishna et al., 2026).

Second, we focus on the dissipative cost of signaling activities. Such activities can, of course, sometimes be productive; see fn. 1. We expect that even in a broader welfare calculus, our waste ratio is a useful input: the net social value must weigh signaling’s intrinsic benefit against its waste.

Lastly, outside the isoelastic class, we have comparative statics (Theorem 3) and a generalization of the isoelastic formula (Equation 7), but ultimately no simple expression for the waste ratio. Moreover, Theorem 2 indicates that the waste ratio will generally vary with type, meaning that aggregate waste will depend on the type distribution. We do not suggest that isoelasticity should be taken literally. Rather, we view it as focal by analogy to how CRRA utility is canonical not because preferences literally exhibit constant relative risk aversion, but because it affords tractable analyses and scale-free results. We hope the waste formula β/(β+σ) is a similarly useful benchmark for signaling’s welfare cost.

Appendix A Separating Equilibria

A (mixed) strategy for the agent is a measurable mapping α:Θ→Δ⁢(ℝ≥0), where Δ⁢(ℝ≥0) denotes the set of probability distributions over actions. A pure strategy is a strategy α such that α⁢(θ) has singleton support for all θ; we denote a pure strategy more simply by A:Θ→ℝ≥0. Since a belief concentrated on type 0 is the “worst belief” (by monotonicity of the benefit function V), and hence is the most conducive off-path belief to support an equilibrium, we say that strategy α defines a separating equilibrium if there is a measurable belief map θ^:ℝ≥0→Θ such that:

  1. 1.

    (Separation.) For every θ∈Θ, we have θ^⁢(a)=θ for α⁢(θ)-a.e. a.

  2. 2.

    (Incentive compatibility.) For each θ∈Θ, α⁢(θ)-a.e. a, and all a′∈ℝ≥0:

    V⁢(θ)−C⁢(a,θ)≥V⁢(θ^⁢(a′))−C⁢(a′,θ).

Without loss, we can set θ^⁢(a)=0 at off-path actions.

Proposition 2.

Any separating equilibrium is a pure-strategy equilibrium. Moreover, its strategy A:Θ→ℝ≥0 is continuous and strictly increasing on [0,θ¯⟩, differentiable on (0,θ¯), and satisfies

A′⁢(θ)=V′⁢(θ)Ca⁢(A⁢(θ),θ)for ⁢θ∈(0,θ¯), (12)

with boundary condition A⁢(0)=0.

Although we are not aware of an existing result that directly implies Proposition 2, the proof follows familiar lines (cf.  Mailath, 1987) and is provided in the Supplementary Appendix. It is worth noting that because Proposition 2 only establishes necessary conditions for a separating equilibrium, it does not require all of Assumption 1; in particular, it is enough that V is differentiable on the interior of the type space (rather than continuously differentiable), that Ca is continuous (rather than differentiable), and that C⁢(⋅,θ) is strictly increasing—where finite for type 0—for all θ (it is not necessary that Ca⁢θ<0). The additional properties are instead used to verify sufficiency in the next result, whose proof—which largely follows Mailath (1987)—is also in the Supplementary Appendix.

Proposition 3.

A continuous function A:Θ→ℝ≥0 that is differentiable on (0,θ¯) and satisfies (12) and A⁢(0)=0 constitutes a separating equilibrium.

Appendix B Proof of Theorem 2

Let ρ~⁢(θ):=β~⁢(θ)/σ~⁢(θ) denote the ratio of benefit-to-cost elasticities. We first prove the following result.

Proposition 4.

Assume multiplicative costs. If ρ~⁢(θ) is nondecreasing, then W⁢(θ) is nondecreasing; if ρ~⁢(θ) is nonincreasing, then W⁢(θ) is nonincreasing.

  • Proof.

    Recall from Equation 7 in the proof of Theorem 1 that

    W⁢(θ)=∫0θβ~⁢(t)β~⁢(t)+σ~⁢(t)⁢𝑑Gθ⁢(t).

    Consider any θ2>θ1. The distribution Gθ2 first-order stochastically dominates Gθ1 because, for t≤θ1, the monotonicity of B/S implies

    Gθ2⁢(t)=B⁢(t)/S⁢(t)B⁢(θ2)/S⁢(θ2)≤B⁢(t)/S⁢(t)B⁢(θ1)/S⁢(θ1)=Gθ1⁢(t).

    If ρ~ is nondecreasing, so is β~/(β~+σ~), and hence W⁢(θ2)≥W⁢(θ1). The case of ρ~ nonincreasing is symmetric. ∎

Example 2 presented one environment with an increasing ratio of benefit-to-cost elasticities: ρ~2⁢(θ)=θ⁢eθ/(eθ−1). The computation there of an increasing waste ratio function W2 illustrates Proposition 4.

  • Proof of Theorem 2.

    If ρ~⁢(θ)≡ρ is constant, Proposition 4 implies W is both nondecreasing and nonincreasing, hence constant. The converse argument below then gives W=ρ/(1+ρ).

    Conversely, if W⁢(θ)≡k∈(0,1) is constant, differentiating Equation 6 gives 0=(ln⁡B)′⁢(1−k)+(ln⁡S)′⁢k, and hence ρ~⁢(θ)=(ln⁡B)′/(−(ln⁡S)′)=k/(1−k), a constant. Setting ρ:=k/(1−k) gives W=ρ/(1+ρ). ∎

Appendix C Proof of Theorem 3

We state and prove a result for general (non-multiplicative) costs that implies Theorem 3. We present the more general result because, even though it relies on an endogenous object when costs are not multiplicative, it clarifies the underlying logic.

When costs are not multiplicative, we additionally assume C⁢(a,θ) is differentiable in θ with Cθ continuous; under multiplicative costs, this holds automatically because Cθ⁢(a,θ)=D⁢(a)⁢S′⁢(θ). Given a separating function A, define the on-path cost elasticity by

σ~A⁢(θ):=−θ⁢Cθ⁢(A⁢(θ),θ)C⁢(A⁢(θ),θ).

Under multiplicative costs, this simplifies to the primitive strain elasticity σ~⁢(θ) because for any action a, it holds that

−θ⁢Cθ⁢(a,θ)C⁢(a,θ)=−θ⁢D⁢(a)⁢S′⁢(θ)D⁢(a)⁢S⁢(θ)=−θ⁢S′⁢(θ)S⁢(θ). (13)
Proposition 5.

Consider two environments with benefit elasticities β~1 and β~2, separating equilibria A1 and A2, on-path cost elasticities σ~1A1 and σ~2A2, and waste ratios W1 and W2. For any θ′>0, if β~2⁢(θ)≥β~1⁢(θ) and σ~2A2⁢(θ)≤σ~1A1⁢(θ) for all θ∈(0,θ′), then W2⁢(θ′)≥W1⁢(θ′).

This result immediately implies Theorem 3 because of the simplification (13) under multiplicative costs.

  • Proof of Proposition 5.

    For each i∈{1,2}, let Ci∗⁢(θ):=Ci⁢(Ai⁢(θ),θ), so that Wi⁢(θ)=Ci∗⁢(θ)/Vi⁢(θ). Differentiating Ci∗ and using Equation 12, we have

    (Ci∗)′⁢(θ)=∂∂a⁢Ci⁢(Ai⁢(θ),θ)⁢Ai′⁢(θ)+∂∂θ⁢Ci⁢(Ai⁢(θ),θ)=Vi′⁢(θ)+∂∂θ⁢Ci⁢(Ai⁢(θ),θ).

    Hence,

    Wi′⁢(θ)=(Ci∗)′⁢(θ)Vi⁢(θ)−Ci∗⁢(θ)⁢Vi′⁢(θ)(Vi⁢(θ))2=Vi′⁢(θ)Vi⁢(θ)⁢(1−Wi⁢(θ))+1Vi⁢(θ)⁢∂∂θ⁢Ci⁢(Ai⁢(θ),θ).

    Using

    Vi′⁢(θ)Vi⁢(θ)=β~i⁢(θ)θand1Vi⁢(θ)⁢∂∂θ⁢Ci⁢(Ai⁢(θ),θ)=Wi⁢(θ)Ci∗⁢∂∂θ⁢Ci⁢(Ai⁢(θ),θ)=−σ~iAi⁢(θ)θ⁢Wi⁢(θ),

    we obtain

    Wi′⁢(θ)=β~i⁢(θ)θ⁢(1−Wi⁢(θ))−σ~iAi⁢(θ)θ⁢Wi⁢(θ). (14)

    Let Δ⁢(θ):=W2⁢(θ)−W1⁢(θ). Then

    Δ′⁢(θ)+β~1⁢(θ)+σ~1A1⁢(θ)θ⁢Δ⁢(θ)=γ⁢(θ), (15)

    where

    γ⁢(θ):=β~2⁢(θ)−β~1⁢(θ)θ⁢(1−W2⁢(θ))+σ~1A1⁢(θ)−σ~2A2⁢(θ)θ⁢W2⁢(θ).

    Since W2∈(0,1), the elasticity assumptions ensure γ≥0 on (0,θ′).

    Multiplying both sides of (15) by

    H⁢(θ):=exp⁡(−∫θθ′β~1⁢(t)+σ~1A1⁢(t)t⁢𝑑t)

    gives

    dd⁢θ⁢[Δ⁢(θ)⁢H⁢(θ)]=γ⁢(θ)⁢H⁢(θ).

    Integrating from 0 to θ′, we have

    Δ⁢(θ′)⁢H⁢(θ′)−limt→0Δ⁢(t)⁢H⁢(t)=∫0θ′γ⁢(t)⁢H⁢(t)⁢𝑑t.

    Observe that H⁢(θ′)=1, and the limit term is zero because Δ is bounded and, as t→0, H⁢(t)→0 because

    ∫tθ′β~1⁢(u)+σ~1A1⁢(u)u⁢𝑑u≥∫tθ′β~1⁢(u)u⁢𝑑u=∫tθ′V1′⁢(u)V1⁢(u)⁢𝑑u=ln⁡V1⁢(θ′)−ln⁡V1⁢(t)→∞.

    Therefore,

    Δ⁢(θ′)=∫0θ′γ⁢(t)⁢H⁢(t)⁢𝑑t≥0.∎

See Example 5 for an illustration of Proposition 5.

  • Proof of tightness of the conditions in Theorem 3.

    We show that if β~2⁢(θ~)<β~1⁢(θ~) at some type θ~∈(0,θ¯), then there exists a common isoelastic strain function S across the two environments such that W2⁢(θ~)<W1⁢(θ~). The argument for the σ~ condition is analogous.

    Consider the family of isoelastic strain functions Sσ⁢(θ)=θ−σ for σ>0. Evaluating Equation 6 at θ~ under Sσ gives

    Wi⁢(θ~;σ)=θ~−σBi⁢(θ~)⁢∫0θ~Bi′⁢(θ)⁢θσ⁢𝑑θ.

    Multiplying by σ+1 and changing variables to θ=x⁢θ~ yields

    (σ+1)⁢Wi⁢(θ~;σ)=∫01θ~⁢Bi′⁢(x⁢θ~)Bi⁢(θ~)⁢(σ+1)⁢xσ⁢𝑑x. (16)

    As (σ+1)⁢xσ is a density on [0,1] which converges in distribution to the point mass at x=1 as σ→∞, and Bi′ is continuous on (0,θ~],212121Although Bi′ may be unbounded near 0 (e.g., when Bi⁢(θ)=θβ with β<1), types near 0 contribute negligibly to (16): for any fixed ε∈(0,1), since xσ≤εσ on [0,ε] and ∫0εθ~⁢Bi′⁢(x⁢θ~)⁢𝑑x=Bi⁢(ε⁢θ~), the contribution of [0,ε] to the integral in (16) is at most (σ+1)⁢εσ⁢Bi⁢(ε⁢θ~)/Bi⁢(θ~), which goes to 0 as σ→∞. On [ε,1] the integrand is bounded and continuous. it follows that

    limσ→∞(σ+1)⁢Wi⁢(θ~;σ)=θ~⁢Bi′⁢(θ~)Bi⁢(θ~)=β~i⁢(θ~).

    Hence, β~2⁢(θ~)<β~1⁢(θ~) implies that for sufficiently large σ we have

    (σ+1)⁢W2⁢(θ~;σ)<(σ+1)⁢W1⁢(θ~;σ),

    or equivalently W2⁢(θ~;σ)<W1⁢(θ~;σ). ∎

Appendix D Proofs and Additional Results for Section 5

D.1 Proof of Proposition 1

Fix a focal agent facing a set J of opponents. Let PJ,0:=0 and for 1≤m≤|J|, let PJ,m⁢(θ) denote the probability that the focal agent of type θ wins one of m identical prizes, i.e., that at most m−1 opponents in J have types above θ. The agent’s benefit is proportional to PJ,m⁢(θ), so the benefit elasticity is the elasticity of PJ,m. For the proposition’s first statement, it suffices, by Theorem 3, to show that this elasticity rises when an opponent is added to J (increasing the number of agents) or when m is lowered (decreasing the number of prizes). For both these comparative statics, we will use the following lemma, whose proof is later in the section.

Lemma 1.

For any opponent set J and prizes m∈{1,…,|J|}, the ratio PJ,m−1⁢(θ)/PJ,m⁢(θ) is increasing in θ on (0,1].

To interpret the lemma, let Xθ be the number of opponents in J with types above θ, so that PJ,m⁢(θ)=ℙ⁢(Xθ≤m−1) and

PJ,m−1⁢(θ)PJ,m⁢(θ)=ℙ⁢(Xθ≤m−2∣Xθ≤m−1).

The lemma thus says that, conditional on winning one of m prizes, a higher type is more likely to have ranked high enough to win one of only m−1; intuitively, a higher θ stochastically lowers the number of opponents above it.

Comparative static in the number of agents.

Add a new opponent, indexed 0, with type distribution F0. The focal agent of type θ then wins one of the m prizes against J∪{0} either if opponent 0’s type falls below θ (which has probability F0⁢(θ)) and the agent would have won against J, or if it falls above θ (probability 1−F0⁢(θ)) and the agent would have won one of m−1 prizes against J. Hence

PJ∪{0},m⁢(θ)=F0⁢(θ)⁢PJ,m⁢(θ)+(1−F0⁢(θ))⁢PJ,m−1⁢(θ).

Dividing by PJ,m⁢(θ) yields

PJ∪{0},m⁢(θ)PJ,m⁢(θ)=F0⁢(θ)+(1−F0⁢(θ))⁢PJ,m−1⁢(θ)PJ,m⁢(θ).

The right-hand side is increasing in θ: it is a convex combination of 1 and PJ,m−1/PJ,m≤1, in which both the weight F0 placed on 1 and the value PJ,m−1/PJ,m increase in θ (the latter by Lemma 1). Therefore dd⁢θ⁢[log⁡PJ∪{0},m⁢(θ)−log⁡PJ,m⁢(θ)]≥0, so adding an opponent raises the focal agent’s benefit elasticity pointwise.

Comparative static in the number of prizes.

For m≥2, taking logarithms, Lemma 1 states that log⁡PJ,m−1⁢(θ)−log⁡PJ,m⁢(θ) is increasing in θ. Hence reducing the number of prizes from m to m−1 raises the focal agent’s benefit elasticity pointwise.

  • Proof of Lemma 1.

    The claim is trivially true when m=1, as PJ,0≡0. So fix any m≥2 and any 0<θ<θ′≤1. We will show that PJ,m−1⁢(θ′)/PJ,m⁢(θ′)≥PJ,m−1⁢(θ)/PJ,m⁢(θ).

    Let X:=#⁢{j∈J:θj>θ} and X′:=#⁢{j∈J:θj>θ′} count the opponents whose types exceed θ and θ′ respectively, so that PJ,m⁢(θ)=ℙ⁢(X≤m−1) and PJ,m⁢(θ′)=ℙ⁢(X′≤m−1). Each of X and X′ is a sum of independent Bernoulli random variables, one for each opponent j∈J, with success probabilities 1−Fj⁢(θ) and 1−Fj⁢(θ′) respectively. Since 1−Fj⁢(θ′)≤1−Fj⁢(θ) for every j, it follows from Shaked and Shanthikumar (2007, Example 1.C.10) that X dominates X′ in the likelihood-ratio order.222222Their example establishes that for a sum of independent Bernoulli random variables, the ratio of the probability of k+1 successes to that of k is increasing in each of the underlying success probabilities. Changing those success probabilities one at a time gives the likelihood-ratio comparison between X and X′. Writing pk:=ℙ⁢(X=k) and qk:=ℙ⁢(X′=k), it follows that qk/pk is decreasing in k; in particular, qk/pk≥qm−1/pm−1 for every k≤m−2. Summing over these k and rearranging gives

    (∑k=0m−2qk)⁢pm−1≥(∑k=0m−2pk)⁢qm−1,

    which by cross-multiplication and simplification is equivalent to

    PJ,m−1⁢(θ′)PJ,m⁢(θ′)=∑k=0m−2qk∑k=0m−2qk+qm−1≥∑k=0m−2pk∑k=0m−2pk+pm−1=PJ,m−1⁢(θ)PJ,m⁢(θ).∎

Full dissipation as the field grows.

Finally, we prove the limit claim of Proposition 1. Let agents be symmetric, with multiplicative cost C⁢(a,θ) and type distribution F, and fix the number of prizes m. Let Pn⁢(θ) denote PJ,m⁢(θ) for an opponent set J of size n:=N−1≥m, so that Pn⁢(θ) is the probability that at most m−1 of n opponents drawn independently from F have types above θ. The focal agent’s benefit is proportional to Pn, so by Equation 6 her waste ratio is Wim,N⁢(θ)=S⁢(θ)Pn⁢(θ)⁢∫0θPn′⁢(t)S⁢(t)⁢𝑑t. Integrating by parts, using Pn⁢(0)=0 and 1/S⁢(t)≤1/S⁢(θ) to see that the boundary term at t=0 vanishes, we have

1−Wim,N⁢(θ)=∫0θPn⁢(t)Pn⁢(θ)⁢w⁢(t)⁢𝑑t,where ⁢w⁢(t):=S⁢(θ)⁢(1S)′⁢(t). (17)

The weight w is nonnegative (as S is decreasing), satisfies ∫0θw⁢(t)⁢𝑑t=1−S⁢(θ)/S⁢(0)≤1, and does not depend on N. Since the ratio Pn⁢(t)/Pn⁢(θ) lies in [0,1], dominated convergence implies that Wim,N⁢(θ)→1 if Pn⁢(t)/Pn⁢(θ)→0 for almost every t<θ.

So it remains only to establish that the ratio does vanish, in fact at every t<θ. The event that the types of at most m−1 of the n opponents exceed t has probability

Pn⁢(t)=∑k=0m−1(nk)⁢(1−F⁢(t))k⁢F⁢(t)n−k≤m⋅nm−1⁢F⁢(t)n−m+1,

while Pn⁢(θ)≥F⁢(θ)n, the probability that every opponent falls below θ. Hence

Pn⁢(t)Pn⁢(θ)≤m⋅nm−1F⁢(θ)m−1⁢(F⁢(t)F⁢(θ))n−m+1→ 0⁢ as ⁢n→∞,

because F⁢(t)<F⁢(θ) so that (F⁢(t)/F⁢(θ))n−m+1 vanishes geometrically in n while nm−1 increases only polynomially.

Remark 1.

The derivation of (17) applies verbatim to any agent, with her own strain function Si and winning probability in place of S and Pn. It thus yields a characterization of full dissipation well beyond symmetric agents. Concretely, hold agent i’s cost function fixed, consider any sequence of tournaments in which the opponents’ type distributions and the number of prizes mN<N may change with N, and write PiN for agent i’s winning probability. Then, for any θ>0, the waste WimN,N⁢(θ)→1 if and only if every type t<θ is eventually shut out of contention relative to type θ, i.e., PiN⁢(t)/PiN⁢(θ)→0. The “if” direction is the dominated convergence argument above. For the “only if,” since PiN⁢(t) is increasing in t, (17) implies

1−WimN,N⁢(θ)≥PiN⁢(t)PiN⁢(θ)⁢∫tθw⁢(u)⁢𝑑u=PiN⁢(t)PiN⁢(θ)⁢(1−Si⁢(θ)Si⁢(t)),

whose second factor is positive (as Si is strictly decreasing) and independent of N; hence WimN,N⁢(θ)→1 forces PiN⁢(t)/PiN⁢(θ)→0. Notably, whether full dissipation occurs does not depend on any agent’s cost function.

D.2 Aggregate Dissipation

We next establish the aggregate dissipation statement referenced in the text after Proposition 1.

Proposition 6.

Consider the signaling tournament with m prizes and N symmetric agents, and let Am,N denote the common separating-equilibrium strategy. Holding m fixed as N→∞, expected aggregate signaling costs converge to the full value of the prizes:

limN→∞N⋅𝔼⁢[C⁢(Am,N⁢(θ),θ)]=s⋅m.

Because all m prizes are always awarded, N⋅𝔼⁢[V⁢(θ)]=s⋅m; the proposition thus says that, in expectation, aggregate signaling asymptotically dissipates the entire surplus.

  • Proof of Proposition 6.

    Since all m prizes are always awarded, N⋅𝔼⁢[Pn⁢(θ)]=m, where, as in the proof of Proposition 1, Pn⁢(θ) is the probability that at most m−1 of the other n=N−1 types exceed θ. So d⁢μN⁢(θ):=(N/m)⁢Pn⁢(θ)⁢f⁢(θ)⁢d⁢θ defines a probability measure on [0,1], namely the distribution of the type of a uniformly selected prize winner. Since equilibrium costs are C⁢(Am,N⁢(θ),θ)=V⁢(θ)⁢Wim,N⁢(θ) with V=s⁢Pn, we have

    N⋅𝔼⁢[C⁢(Am,N⁢(θ),θ)]s⋅m=∫01Wim,N⁢(θ)⁢𝑑μN⁢(θ)≤ 1.

    Two observations complete the proof. First, μN concentrates at the top: for any t<1, a winner with type at most t requires that fewer than m of the N types exceed t, which has vanishing probability as N→∞; hence μN converges weakly to the point mass at θ=1. Second, waste is monotone in the field size: fixing any N0, Proposition 1 implies Wim,N⁢(θ)≥Wim,N0⁢(θ) for all N≥N0 and θ>0. Since Wim,N0 is bounded and continuous at θ=1, weak convergence yields

    lim infN→∞∫01Wim,N⁢𝑑μN≥limN→∞∫01Wim,N0⁢𝑑μN=Wim,N0⁢(1).

    Now letting N0→∞, Proposition 1 also gives Wim,N0⁢(1)→1. Hence ∫01Wim,N⁢𝑑μN→1, i.e., N⋅𝔼⁢[C⁢(Am,N⁢(θ),θ)]→s⋅m. ∎

Appendix E Waste Need Not be Constant in Stakes

The following result shows how the property that waste is constant in type can generalize beyond the isoelastic environment (part 2 of Theorem 1), once we move beyond multiplicative costs. Unlike in the isoelastic environment, this constant waste can vary with stakes.

Proposition 7.

Assume V⁢(θ)=s⁢B⁢(θ) and

C⁢(a,θ)=B⁢(θ)⋅h⁢(D⁢(a)Q⁢(θ)), (18)

where Q⁢(0)=D⁢(0)=h⁢(0)=0 with Q′,D′,h′>0.232323Our Assumption 1 also imposes other properties, including the single-crossing condition, which under the constant relative elasticity assumption introduced momentarily reduces to x⁢h′′⁢(x)/h′⁢(x)>λ−1 for all x>0. Denote the waste ratio at type θ under stakes s by Ws⁢(θ). If the relative elasticity d⁢ln⁡B⁢(θ)d⁢ln⁡Q⁢(θ) is constant at some λ>0, and if there is a unique solution x∗⁢(s)>0 for x in the equation x⁢h′⁢(x)=s⁢λ, then waste is Ws⁢(θ)=h⁢(x∗⁢(s))/s, which is constant over θ>0.

Under the proposition’s conditions, using s=x∗⁢(s)⁢h′⁢(x∗⁢(s))/λ, the constant waste can be written as

Ws⁢(θ)=λ⁢h⁢(x∗⁢(s))x∗⁢(s)⁢h′⁢(x∗⁢(s))=λεh⁢(x∗⁢(s)),where ⁢εh⁢(x):=d⁢ln⁡h⁢(x)d⁢ln⁡x=x⁢h′⁢(x)h⁢(x).

Hence, since x∗⁢(s) is increasing in s (differentiating and using the single-crossing condition, (x⁢h′⁢(x))′>λ⁢h′⁢(x)>0), waste is decreasing, increasing, or constant in stakes according to whether the elasticity εh is increasing, decreasing, or constant.

In the isoelastic environment, h is the identity and εh⁢(x)≡1, yielding waste that is constant in both type and stakes.242424Specifically, B⁢(θ)=θβ and C⁢(a,θ)=D⁢(a)⁢θ−σ=B⁢(θ)⁢h⁢(D⁢(a)/Q⁢(θ)) for h⁢(x)=x and Q⁢(θ)=θσ+β. Examples 5 and 6 below illustrate cases in which waste is constant across types, but is increasing or decreasing in the stakes. Example 5 also illustrates the result of Proposition 5 that an increase in cost elasticities will decrease the waste ratio.

  • Proof of Proposition 7.

    Consider the strategy A defined by A⁢(0)=0 and for θ>0, A⁢(θ)=D−1⁢(x∗⁢(s)⁢Q⁢(θ)). A routine computation shows that252525Suppressing the argument of x∗, from D⁢(A⁢(θ))=x∗⁢Q⁢(θ) we have D′⁢(A⁢(θ))⁢A′⁢(θ)=x∗⁢Q′⁢(θ), and hence Ca⁢(A⁢(θ),θ)⁢A′⁢(θ)=B⁢(θ)⁢h′⁢(x∗)⁢x∗⁢Q′⁢(θ)Q⁢(θ)=B′⁢(θ)λ⁢h′⁢(x∗)⁢x∗=s⁢B′⁢(θ), where the second equality is because the constant relative elasticity assumption is equivalent to Q′/Q=(1/λ)⋅B′/B, and the last equality is because x∗⁢h′⁢(x∗)=s⁢λ.

    Ca⁢(A⁢(θ),θ)⁢A′⁢(θ)=s⁢B′⁢(θ)=V′⁢(θ).

    Hence Equation 1 holds, and so A is the separating equilibrium strategy.

    Along the equilibrium path,

    C⁢(A⁢(θ),θ)=B⁢(θ)⁢h⁢(D⁢(A⁢(θ))Q⁢(θ))=B⁢(θ)⁢h⁢(x∗⁢(s)).

    Therefore, for θ>0, the waste ratio is

    Ws⁢(θ)=C⁢(A⁢(θ),θ)V⁢(θ)=B⁢(θ)⁢h⁢(x∗⁢(s))s⁢B⁢(θ)=h⁢(x∗⁢(s))s.∎
Example 5.

Let the benefit be linear with V⁢(θ)=s⁢θ for s>0, and let the costs take the non-multiplicative form C⁢(a,θ)=a2/(τ⁢θ+a) for τ>0, which satisfies Assumption 1.

For small a, the cost is approximately a2/(τ⁢θ), which is isoelastic with strain elasticity 1. For large a, the cost is approximately a, which is independent of type. Higher stakes push agents to higher actions, for which high types have a smaller relative cost advantage. This suggests that higher stakes should increase waste, which we confirm below.

It is straightforward to verify using Equation 1 that the separating equilibrium has the linear strategy Aτ,s⁢(θ)=ζ⁢(τ,s)⁢τ⁢θ, where ζ⁢(τ,s)>0 is the unique value of ζ that solves

ζ2⁢(2+ζ)(1+ζ)2=sτ. (19)

The constant waste is thus

Wτ,s⁢(θ)=(ζ⁢(τ,s)⁢τ⁢θ)2τ⁢θ+ζ⁢(τ,s)⁢τ⁢θ⋅1s⁢θ=(ζ⁢(τ,s))2⁢τs⁢(1+ζ⁢(τ,s))=1+ζ⁢(τ,s)2+ζ⁢(τ,s). (20)

As the left-hand side of (19) is strictly increasing in ζ, we see that ζ⁢(τ,s) is strictly decreasing in τ and strictly increasing in s. Hence Wτ,s is strictly decreasing in τ and strictly increasing in s, with range (1/2,1).

Waste monotonicity in the parameter τ is an instance of Proposition 5 because β~⁢(θ)=1 is independent of τ while the on-path cost elasticity is

σ~Aτ,s⁢(θ)=−θ⁢Cθ⁢(Aτ,s⁢(θ),θ)C⁢(Aτ,s⁢(θ),θ)=11+ζ⁢(τ,s),

which is strictly increasing in τ.

Connecting the result to Proposition 7, the cost C⁢(a,θ)=a2/(τ⁢θ+a) can be put in the form of (18) with

h⁢(x)=x2τ+x,B⁢(θ)=Q⁢(θ)=θ,D⁢(a)=a.

The function h is increasing, and there is a constant relative elasticity d⁢ln⁡B⁢(θ)/d⁢ln⁡Q⁢(θ)=1. The proposition thus implies that waste equals h⁢(x∗⁢(τ,s))/s for x∗⁢(τ,s) the solution to x⁢h′⁢(x)=s, i.e., x∗⁢(τ,s) solving

x2⁢(2⁢τ+x)(τ+x)2=s.

The relevant solution is x∗⁢(τ,s)=ζ⁢(τ,s)⁢τ, yielding waste of

h⁢(x∗⁢(τ,s))s=(ζ⁢(τ,s))2⁢τ2s⁢(τ+ζ⁢(τ,s)⁢τ)=(ζ⁢(τ,s))2⁢τs⁢(1+ζ⁢(τ,s)),

just as in (20).

Remark 2.

Notice that in the separating equilibrium of Example 5, the ratio β~⁢(θ)/σ~A⁢(θ) is constant in type. Indeed, there is a generalization of Theorem 2 to non-multiplicative costs: waste is constant in type if and only if the ratio β~⁢(θ)/σ~A⁢(θ) is constant on (0,θ¯). The logic is in the proof of Proposition 5: using Equation 14, we see that W′⁢(θ)=0 implies β~⁢(θ)/σ~A⁢(θ)=W⁢(θ)/(1−W⁢(θ)); and so a constant waste implies a constant β~⁢(θ)/σ~A⁢(θ). Conversely, if β~/σ~A≡ρ, then (14) becomes W′⁢(θ)=σ~A⁢(θ)θ⁢(ρ−(1+ρ)⁢W⁢(θ)), which admits the constant solution ρ/(1+ρ); the integrating-factor argument in that proof, with its vanishing boundary term, shows the waste ratio must coincide with this constant solution.

Example 6.

Let the benefit be linear with V⁢(θ)=s⁢θ for s>0, and let the costs take the non-multiplicative form C⁢(a,θ)=a2/θ+a3/θ2, which satisfies Assumption 1.

For small a, the cost is approximately a2/θ, which is isoelastic with strain elasticity 1. For large a, the cost is approximately a3/θ2, which is isoelastic with strain elasticity 2. Higher stakes push agents to higher actions, for which high types have a larger relative cost advantage due to the higher strain elasticity. This suggests that higher stakes should decrease waste, which we confirm below.

It is straightforward to verify using Equation 1 that the separating equilibrium has the linear strategy As⁢(θ)=c⁢(s)⁢θ, where c⁢(s)>0 is the unique solution to

2⁢c2+3⁢c3=s. (21)

The waste ratio is thus

Ws⁢(θ)=C⁢(As⁢(θ),θ)V⁢(θ)=(c⁢(s))2⁢θ+(c⁢(s))3⁢θ[2⁢(c⁢(s))2+3⁢(c⁢(s))3]⁢θ=1+c⁢(s)2+3⁢c⁢(s), (22)

which is constant across types but depends on s. In particular, since c is increasing in s (Equation 21) and Ws is decreasing in c, we see that Ws is decreasing in s with range (1/3,1/2).

Connecting the result to Proposition 7, the cost C⁢(a,θ)=a2/θ+a3/θ2 can be put in the form of (18) with

h⁢(x)=x2+x3,B⁢(θ)=Q⁢(θ)=θ,D⁢(a)=a.

The function h is increasing, and there is a constant relative elasticity d⁢ln⁡B⁢(θ)/d⁢ln⁡Q⁢(θ)=1, as in Example 5.262626This example’s cost function and the one from Example 5 are special cases of h⁢(x)=x2⁢(τ+x)l, with l=−1 in Example 5 and with τ=1 and l=1 here. A value of l=0 would yield the isoelastic cost C⁢(a,θ)=a2/θ. The proposition thus implies that waste is equal to h⁢(x∗⁢(s))/s for x∗⁢(s) the solution to x⁢h′⁢(x)=s, i.e., x∗⁢(s) solving 2⁢x2+3⁢x3=s. We see that x∗⁢(s) is identical to c⁢(s) from (21), yielding waste of

h⁢(x∗⁢(s))s=c⁢(s)2+c⁢(s)3s=c⁢(s)2+c⁢(s)32⁢c⁢(s)2+3⁢c⁢(s)3=1+c⁢(s)2+3⁢c⁢(s)

just as in (22).

Appendix F Signaling Costs as Payments

This appendix provides an alternative interpretation of some of our results by fleshing out the connection between separating equilibria and mechanism design. Appendix F.1 details how equilibrium signaling costs can be viewed as payments. Appendix F.2 then shows that the signaling game is equivalent to an all-pay auction, and that translation affords an order-statistics reading of the waste ratio.

F.1 The Payment Identity

Assume multiplicative costs and normalize the stakes to s=1, so that V⁢(⋅)=B⁢(⋅). In a separating equilibrium, type θ’s choice of an action can be equivalently viewed as choosing which type θ^ to mimic, i.e., choosing θ^ to maximize B⁢(θ^)−D⁢(A⁢(θ^))⁢S⁢(θ). Divide this payoff by S⁢(θ)>0, which leaves incentives unchanged.272727S⁢(θ) is finite for all θ>0; if S⁢(0)=∞, then assigning v⁢(0)=1/∞=0 also preserves type 0’s incentives. Writing

v⁢(θ):=1S⁢(θ)andb⁢(θ^):=D⁢(A⁢(θ^)),

type θ’s problem becomes

maxθ^⁡v⁢(θ)⁢B⁢(θ^)−b⁢(θ^), (23)

which is the familiar form in mechanism design where an agent with value v⁢(θ) chooses an allocation B⁢(θ^) with payment b⁢(θ^). Note that there is a bijection between types and values because S is strictly decreasing.

In this notation, dividing the second equality of (5) by S⁢(θ) gives

b⁢(θ)=∫0θB′⁢(t)S⁢(t)⁢𝑑t=∫0θv⁢(t)⁢𝑑B⁢(t)=v⁢(θ)⁢B⁢(θ)⏟gross surplus−∫0θB⁢(t)⁢𝑑v⁢(t)⏟information rent, (24)

where the last equality is from integration by parts, using v⁢(0)⁢B⁢(0)=0. This is the payment identity of mechanism design (Myerson, 1981): a type’s payment equals the gross surplus from her allocation less her information rent.

In the above transformation, one must bear in mind that S⁢(θ) is a type-specific scaling. Thus the payment is not a type’s signaling cost; instead, b⁢(θ)=C⁢(A⁢(θ),θ)/S⁢(θ). Similarly for the gross surplus v⁢(θ)⁢B⁢(θ). However, the ratio has a clean interpretation: for θ>0,

W⁢(θ)=C⁢(A⁢(θ),θ)V⁢(θ)=b⁢(θ)v⁢(θ)⁢B⁢(θ). (25)

In other words, the waste ratio is the payment’s share of gross surplus.

Remark 3.

The discussion after Theorem 2 shows that waste is constant exactly when S=κ⁢B−1/ρ. In the present language, this says the reward schedule x:=B∘v−1 (the reward for an agent with value v) is isoelastic: x⁢(v)=c⋅vρ, with W=ρ/(1+ρ). The ratio of elasticities ρ in the theorem is thus the reward schedule’s elasticity. An analogous change of variables, to quantiles rather than values, underlies the treatment of screening problems in Bergemann, Heumann, and Morris (2026). Indeed, their leading example is, in our notation, an isoelastic environment with β=σ=4.

F.2 An All-Pay Auction Representation

The transformed payoff (23) also delivers an all-pay auction representation of our single-agent signaling game. For simplicity assume B is bounded (as is assured by θ¯<∞), and normalize supθ^B⁢(θ^)=1 (a rescaling of stakes, which by Theorem 1 does not affect waste) so that B⁢(θ^) can serve as a probability. Let x=B∘v−1 be the reward schedule, as in Remark 3; x is strictly increasing with x⁢(v⁢(0))=0 and supvx⁢(v)=1. Fix any N≥2 and define

G⁢(v^):=x⁢(v^)1/(N−1), (26)

a cumulative distribution function on the range of v. Consider a symmetric N-bidder independent-private-value all-pay auction in which values are distributed according to G, and suppose all bidders use a common differentiable, strictly increasing bidding strategy b~ with b~⁢(v⁢(0))=0. A bidder with value v who bids to mimic v^ wins with probability G⁢(v^)N−1 and pays b~⁢(v^), so her payoff is

v⁢G⁢(v^)N−1−b~⁢(v^). (27)

By construction, G⁢(v^)N−1=x⁢(v^)=B⁢(θ^) for v^=v⁢(θ^), so when b~=b∘v−1, the payoff (27) coincides with (23): the bidder’s problem and the single agent’s problem are identical. The pertinent equilibrium of the all-pay auction thus matches the signaling equilibrium; in particular, the equilibrium bid at value v⁢(θ) is type θ’s payment b⁢(θ)=D⁢(A⁢(θ)), i.e., the separating strategy measured in difficulty units and indexed by value rather than type.

Remark 4.

The equivalence above is between a single-agent signaling game and an all-pay auction construction in which the number of bidders N is a free parameter and the original type distribution F plays no role (as it does not affect the separating equilibrium). By contrast, the signaling tournament of Section 5 has a given number N of agents actually competing. With symmetric agents in the tournament, the equivalence extends to any number of prizes m: rescaling by S⁢(θ) makes each agent a bidder with value v⁢(θ) distributed according to F∘v−1, and awarding prizes to the m highest inferred types is exactly the all-pay rule awarding m identical objects to the m highest bids. The benefit function then depends explicitly on the given N and F, because an agent perceived as θ^ wins a prize with the probability that at most m−1 of the other N−1 agents have types above θ^.

Waste and the runner-up.

The all-pay auction also provides another interpretation of the waste ratio.

Proposition 8.

The waste ratio satisfies, for any number of bidders N≥2 and type θ>0,

W⁢(θ)=𝔼[Y|Y<v(θ)]v⁢(θ),

where Y is the (random) highest value among the other N−1 bidders.

  • Proof.

    By revenue equivalence (Myerson, 1981), a bidder with value v⁢(θ) bids her expected payment in the corresponding second-price auction: the probability G⁢(v⁢(θ))N−1 of winning times the expected runner-up value 𝔼⁢[Y∣Y<v⁢(θ)]. This bid is type θ’s payment b⁢(θ); since B⁢(θ)=G⁢(v⁢(θ))N−1, the winning probability cancels from the payment’s share of gross surplus (25), yielding the result. ∎

In words, the proposition says that an agent’s waste is the expected runner-up’s value as a fraction of the agent’s own. While there is a genuine runner-up in a symmetric one-prize signaling tournament (Subsection 5.1), in the single-agent case it is fictitious, with the proposition then an accounting identity. Either way, waste is constant across types exactly when the expected runner-up is a constant fraction of the winner’s value. Since the runner-up’s value Y satisfies ℙ⁢(Y≤v)=G⁢(v)N−1=x⁢(v), isoelasticity (x⁢(v)=c⋅vρ) gives 𝔼⁢[Y∣Y<v]=v⋅ρ/(1+ρ), recovering the constant waste formula (4), with ρ=β/σ as in Theorem 2.

References

  • R. Bénabou and J. Tirole (2006) Incentives and prosocial behavior. American Economic Review 96 (5), pp. 1652–1678. Cited by: footnote 1.
  • D. Bergemann, T. Heumann, and S. Morris (2026) Information design and mechanism design: an integrated framework. Note: Cowles Foundation Discussion Paper 2494 Cited by: Remark 3.
  • C. T. Bergstrom, S. Számadó, and M. Lachmann (2002) Separating equilibria in continuous signalling games. Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences 357 (1427), pp. 1595–1606. External Links: Document Cited by: §1.
  • B. D. Bernheim and A. L. Bodoh-Creed (2023) Pervasive signaling. Theoretical Economics 18 (1), pp. 163–196. Cited by: §1.
  • J. Bulow and P. Klemperer (2012) Regulated prices, rent seeking, and consumer surplus. Journal of Political Economy 120 (1), pp. 160–186. Cited by: footnote 13.
  • S. Chakravarty and T. R. Kaplan (2013) Optimal allocation without transfer payments. Games and Economic Behavior 77 (1), pp. 1–20. Cited by: footnote 13.
  • I. Cho and J. Sobel (1990) Strategic stability and uniqueness in signaling games. Journal of Economic Theory 50 (2), pp. 381–418. Cited by: §6.
  • L. C. Corchón (2007) The theory of contests: a survey. Review of Economic Design 11 (2), pp. 69–100. Cited by: §5.3.
  • R. H. Frank and P. J. Cook (1996) The winner-take-all society: why the few at the top get so much more than the rest of us. Penguin Books, New York. External Links: ISBN 9780140259957 Cited by: §6.
  • A. Frankel and N. Kartik (2019) Muddled information. Journal of Political Economy 127 (4), pp. 1739–1776. Cited by: footnote 20.
  • D. Fudenberg and J. Tirole (1991) Game theory. MIT Press, Cambridge, MA. Cited by: §3.1.
  • J. D. Hartline and T. Roughgarden (2008) Optimal mechanism design and money burning. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pp. 75–84. Cited by: footnote 13.
  • E. Hopkins (2012) Job market signaling of relative position, or becker married to spence. Journal of the European Economic Association 10 (2), pp. 290–322. Cited by: §5.3.
  • H. C. Hoppe, B. Moldovanu, and A. Sela (2009) The theory of assortative matching based on costly signals. Review of Economic Studies 76 (1), pp. 253–281. External Links: Document Cited by: §1, §4, §5.3, footnote 13, footnote 8.
  • N. Kartik (2009) Strategic communication with lying costs. Review of Economic Studies 76 (4), pp. 1359–1395. Cited by: footnote 4.
  • E. Koutsoupias and C. Papadimitriou (1999) Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 404–413. Cited by: footnote 5.
  • K. Krishna, S. Lychagin, W. Olszewski, R. Siegel, and C. Tergiman (2026) Pareto improvements in the contest for college admissions. Review of Economic Studies 93 (1), pp. 629–663. Cited by: §6.
  • G. Mailath, M. Okuno-Fujiwara, and A. Postlewaite (1993) Belief-based refinements in signalling games. Journal of Economic Theory 60 (2), pp. 241–276. Cited by: §6.
  • G. Mailath (1987) Incentive compatibility in signaling games with a continuum of types. Econometrica 55 (6), pp. 1349–1365. Cited by: Appendix A, footnote 4.
  • R. B. Myerson (1981) Optimal auction design. Mathematics of Operations Research 6 (1), pp. 58–73. Cited by: §F.1, §F.2, footnote 9.
  • S. Nitzan (1994) Modelling rent-seeking contests. European Journal of Political Economy 10, pp. 41–60. Cited by: §5.3.
  • G. Nöldeke and L. Samuelson (1999) How costly is the honest signaling of need?. Journal of Theoretical Biology 197 (4), pp. 527–539. Cited by: §1.
  • D. J. Penn and S. Számadó (2020) The handicap principle: how an erroneous hypothesis became a scientific principle. Biological Reviews 95 (1), pp. 267–290. External Links: Document Cited by: §6.
  • J. G. Riley (2001) Silver signals: twenty-five years of screening and signaling. Journal of Economic Literature 39 (2), pp. 432–478. Cited by: §1.
  • T. Roughgarden, V. Syrgkanis, and E. Tardos (2017) The price of anarchy in auctions. Journal of Artificial Intelligence Research 59, pp. 59–101. Cited by: footnote 5.
  • T. Roughgarden (2005) Selfish routing and the price of anarchy. MIT Press. Cited by: footnote 5.
  • M. Shaked and J. G. Shanthikumar (2007) Stochastic orders. Springer. Cited by: §D.1.
  • J. Sobel (2009) Signaling games. In Encyclopedia of Complexity and Systems Science, R. A. Meyers (Ed.), pp. 8116–8143. Cited by: §1.
  • M. Spence (1973) Job market signaling. Quarterly Journal of Economics 87 (3), pp. 355–374. Cited by: §1.
  • G. Tullock (1980) Efficient rent seeking. In Toward a Theory of the Rent-Seeking Society, J. M. Buchanan, R. D. Tollison, and G. Tullock (Eds.), pp. 97–112. Cited by: §1, §5.3.
  • A. Zahavi (1977) The cost of honesty (further remarks on the handicap principle). Journal of Theoretical Biology 67 (3), pp. 603–605. Cited by: §6.

Supplementary Appendix

Appendix G Omitted Proofs

The following lemma is used in the proof of Proposition 2.

Lemma 2.

C⁢(⋅,0) is strictly increasing on {a≥0:C⁢(a,0)<∞}.

  • Proof.

    Since C⁢(⋅,θ) is strictly increasing for θ>0, the limit definition of C⁢(⋅,0) implies it is weakly increasing. To establish strict monotonicity, consider a′′>a′≥0 with C⁢(a′′,0)<∞. For any θ>0, we have

    C⁢(a′′,θ)−C⁢(a′,θ)=∫a′a′′Ca⁢(x,θ)⁢𝑑x.

    For any x>0, the function Ca⁢(x,⋅) is strictly decreasing on (0,θ¯⟩ because Ca⁢θ<0 on this domain, and so L⁢(x):=limθ→0Ca⁢(x,θ) exists in ℝ>0∪{∞}. By monotone convergence,

    C⁢(a′′,0)−C⁢(a′,0)=∫a′a′′L⁢(x)⁢𝑑x>0.∎
  • Proof of Proposition 2.

    We proceed in three steps.

    Step 1: Any separating equilibrium has a pure strategy.

    Consider any separating equilibrium strategy α and type θ. Incentive compatibility requires C⁢(a,θ)=C⁢(a′,θ) for α⁢(θ)-a.e. a and a′, since any such actions induce the same belief θ. By the strict monotonicity of C⁢(⋅,θ) for θ>0 and using Lemma 2 for θ=0 (noting that this type will never choose an action with infinite cost), we have a=a′ for α⁢(θ)-almost every a and a′, which implies α⁢(θ) has singleton support. Hence α is a pure strategy.

    Step 2: The boundary condition A⁢(0)=0.

    Let A be a separating equilibrium (pure) strategy. If A⁢(0)>0, then V⁢(0)−C⁢(A⁢(0),0)<V⁢(0)−C⁢(0,0), contradicting incentive compatibility (IC) for type 0.

    Step 3: Monotonicity, continuity, and differentiability.

    Let A be a separating equilibrium (pure) strategy. We first show A is strictly increasing. Consider any θ′>θ. IC for type θ to not mimic θ′ gives C⁢(A⁢(θ′),θ)−C⁢(A⁢(θ),θ)≥V⁢(θ′)−V⁢(θ)>0. Since C⁢(⋅,θ) is nondecreasing, it follows that A⁢(θ′)>A⁢(θ).

    We next show A is continuous. Consider any θ∗∈(0,θ¯) and let a−:=limθ↑θ∗A⁢(θ) and a+:=limθ↓θ∗A⁢(θ), which exist by monotonicity. IC for type θ∗ implies that for all θ<θ∗, we have

    V⁢(θ∗)−C⁢(A⁢(θ∗),θ∗)≥V⁢(θ)−C⁢(A⁢(θ),θ∗).

    Taking θ↑θ∗ and using continuity of V and C yields

    V⁢(θ∗)−C⁢(A⁢(θ∗),θ∗)≥V⁢(θ∗)−C⁢(a−,θ∗). (28)

    Applying IC in the reverse direction (for a type θ<θ∗ to not mimic θ∗) and taking the same limit yields the opposite inequality to (28). Hence C⁢(A⁢(θ∗),θ∗)=C⁢(a−,θ∗). An analogous argument using types above θ∗ gives C⁢(A⁢(θ∗),θ∗)=C⁢(a+,θ∗). Since C⁢(⋅,θ∗) is strictly increasing, this implies a−=A⁢(θ∗)=a+, so A is continuous at θ∗. The same argument, using only a−, also establishes continuity at θ∗=θ¯ when θ¯<∞. At θ∗=0, observe that if a+:=limθ↓0A⁢(θ)>A⁢(0)=0, then some type close to 0 would profitably deviate to action 0 because (i) V⁢(θ)→0 as θ→0, whereas (ii) for θ>0, C⁢(A⁢(θ),θ)≥C⁢(a+,θ) is bounded away from 0 because C⁢(a+,⋅) is decreasing. Hence limθ↓0A⁢(θ)=A⁢(0).

We now establish differentiability on the interior. Fix θ∈(0,θ¯) and θ′≠θ. Adding the IC inequalities for θ to not mimic θ′ and vice-versa, and rearranging, yields

C⁢(A⁢(θ′),θ)−C⁢(A⁢(θ),θ)≥V⁢(θ′)−V⁢(θ)≥C⁢(A⁢(θ′),θ′)−C⁢(A⁢(θ),θ′). (29)

Since C is differentiable in its first argument, the mean value theorem implies that the left-hand side of (29) equals Ca⁢(a~,θ)⋅(A⁢(θ′)−A⁢(θ)) for some a~ between A⁢(θ) and A⁢(θ′), and analogously for the right-hand side with Ca⁢(a~′,θ′) for some a~′ between A⁢(θ) and A⁢(θ′). Substituting into (29) and dividing by θ′−θ gives

Ca⁢(a~,θ)⁢(A⁢(θ′)−A⁢(θ)θ′−θ)≥V⁢(θ′)−V⁢(θ)θ′−θ≥Ca⁢(a~′,θ′)⁢(A⁢(θ′)−A⁢(θ)θ′−θ), (30)

where the inequalities are written for θ′>θ and would flip if θ′<θ. Either way, take θ′→θ: since a~,a~′→A⁢(θ) by continuity of A, and Ca is continuous, both Ca⁢(a~,θ) and Ca⁢(a~′,θ′) converge to Ca⁢(A⁢(θ),θ)>0. Since the middle term of (30) converges to V′⁢(θ) and the two outer terms share the common factor A⁢(θ′)−A⁢(θ)θ′−θ with coefficients converging to the same positive limit, we conclude that A′⁢(θ) exists with

A′⁢(θ)=V′⁢(θ)Ca⁢(A⁢(θ),θ).

Note that if V′ is continuous on (0,θ¯), then A′ is continuous on that domain because Ca and A are both continuous on that domain and Ca⁢(A⁢(θ),θ)>0 for θ>0 (noting that A⁢(θ)>0 for θ>0 by separation).

∎

  • Proof of Proposition 3.

    Let A have the stated properties. Note that for interior θ, if A⁢(θ)=0 then Ca⁢(0,θ)>0: the derivative must exist and be nonzero to satisfy (12), as V′⁢(θ)>0, and the derivative cannot be negative because C⁢(⋅,θ) is continuous and Ca⁢(a,θ)>0 for a>0. Using Assumption 1, it follows that for all interior θ, no matter the value of A⁢(θ), both V′⁢(θ)>0 and Ca⁢(A⁢(θ),θ)>0, and hence (12) implies A′⁢(θ)>0. By continuity of A, it is strictly increasing on [0,θ¯⟩.

    We now verify that A defines a separating equilibrium. Since any off-path action is met with belief θ^=0, it is strictly worse than action 0. So any type θ can be viewed as only choosing which type θ~ to mimic, with payoff

    Π⁢(θ,θ~):=V⁢(θ~)−C⁢(A⁢(θ~),θ).

    Consider incentive compatibility among types in (0,θ¯⟩. For any such θ and any interior θ~, we have A⁢(θ~)>0 (as A is strictly increasing with A⁢(0)=0), and so, substituting V′⁢(θ~)=Ca⁢(A⁢(θ~),θ~)⁢A′⁢(θ~) from (12),

    Π2⁢(θ,θ~)=V′⁢(θ~)−Ca⁢(A⁢(θ~),θ)⁢A′⁢(θ~)=A′⁢(θ~)⁢[Ca⁢(A⁢(θ~),θ~)−Ca⁢(A⁢(θ~),θ)].

    Since A′⁢(θ~)>0 for interior θ~ and Ca⁢θ<0, this expression is positive when θ~<θ and negative when θ~>θ. Hence Π⁢(θ,⋅) is increasing on (0,θ) and decreasing on (θ,θ¯), so θ~=θ maximizes Π⁢(θ,⋅) on (0,θ¯); continuity of Π⁢(θ,⋅) extends the comparison to θ~=θ¯ when the type space includes θ¯. In particular, type θ¯ does not gain from mimicking any lower type, and no type gains from mimicking θ¯.

    Finally, we address type 0. Consider an arbitrary other type θ>0. We must show Π⁢(θ,θ)≥Π⁢(θ,0) and Π⁢(0,0)≥Π⁢(0,θ). Taking each in turn:

    1. 1.

      Incentive compatibility on (0,θ¯⟩ implies Π⁢(θ,θ)≥Π⁢(θ,θ~) for all θ~>0, while continuity of V, A and C⁢(⋅,θ) imply Π⁢(θ,θ~)→Π⁢(θ,0) as θ~→0. Hence, Π⁢(θ,θ)≥Π⁢(θ,0).

    2. 2.

      For any θ~>0, the previous point implies Π⁢(θ~,θ~)≥Π⁢(θ~,0)=0, and hence 0≤C⁢(A⁢(θ~),θ~)≤V⁢(θ~). Since V⁢(θ~)→0 as θ~→0, it follows that Π⁢(θ~,θ~)→0=Π⁢(0,0). Moreover, for any θ~>0 we have Π⁢(θ~,θ~)≥Π⁢(θ~,θ) by incentive compatibility on (0,θ¯⟩, and Π⁢(θ~,θ)→Π⁢(0,θ) by the limit property of C⁢(⋅,0) in Assumption 1. Hence Π⁢(0,0)≥Π⁢(0,θ). ∎

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