Recognition: 2 theorem links
· Lean TheoremDistribution-Free Equilibrium in Search Contests
Pith reviewed 2026-05-15 07:38 UTC · model grok-4.3
The pith
In search contests with sequential draws, equilibrium acceptance rates, costs, and payoffs are independent of the value distribution.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
In the unique symmetric equilibrium, players use threshold strategies whose resulting acceptance probability, expected search expenditure, and expected payoffs are invariant to the underlying distribution of values, and the total search costs incurred by all players exactly equal the prize, producing full rent dissipation.
What carries the argument
Symmetric Nash equilibrium threshold strategy in sequential search without recall, where the distribution terms cancel in the indifference condition that determines the threshold.
If this is right
- Full rent dissipation holds for any distribution.
- The socially efficient prize level is larger for heavy-tailed distributions.
- With a finite number of draws allowed, increasing the number of competitors can raise the quality threshold when search costs are low.
- A social planner who chooses both prize and number of players prefers the smallest field size with unlimited draws unless the distribution is heavy-tailed or draws are capped.
Where Pith is reading between the lines
- Contest designers can set prizes and field sizes without precise knowledge of the value distribution for many equilibrium properties.
- The invariance result suggests similar distribution-free behavior may appear in related models of competitive information acquisition.
- When draws are limited, breadth from more participants can substitute for depth in a way that reverses the usual discouragement effect.
Load-bearing premise
Players know the prize and per-draw cost, share common knowledge of the rules, and can compute and play the unique symmetric equilibrium strategy even though the distribution itself is unknown.
What would settle it
Run the game with two different distributions while holding prize and cost fixed and test whether the observed frequency with which players accept a draw stays constant.
Figures
read the original abstract
We study a contest in which $N$ players sequentially draw from a distribution as many times as they want at a fixed cost per draw, with no recall, and the highest accepted value wins a prize. In the unique symmetric equilibrium, the acceptance probability, expected search cost, and players' payoffs do not depend on the underlying distribution. Total search expenditure equals the prize (full rent dissipation). These distribution-free equilibrium properties extend to multiple prizes and to hierarchical competition among designers. The efficient prize that aligns competitive incentives with the social optimum is distribution-dependent: heavy-tailed distributions require much larger prizes. With finite number of draws, adding competitors can raise the quality threshold when search costs are low, reversing the discouragement of the unlimited-draw case. A planner choosing both the prize and the field size always prefers the minimum field ($N=2$) with unlimited draws, but heavy-tailed distributions and finitely many draws favor larger fields, as breadth of parallel exploration compensates for limited depth of individual search.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper models a search contest with N players sequentially drawing values from an unknown distribution F at fixed cost c per draw (no recall), where the highest accepted value wins prize v. It claims that in the unique symmetric equilibrium the acceptance probability, expected search cost, and payoffs are independent of F, with full rent dissipation (aggregate search expenditure equals v). These distribution-free properties extend to multiple prizes and hierarchical competition among designers. The socially efficient prize is F-dependent (larger for heavy-tailed distributions), finite-draw cases can reverse the usual discouragement effect when costs are low, and a planner prefers N=2 with unlimited draws except under heavy tails or finite draws.
Significance. If the central claims hold, the distribution-free equilibrium properties represent a clean and robust contribution to contest and search theory, showing that equilibrium behavior and dissipation are invariant to F under standard assumptions. This simplifies analysis and yields testable predictions without needing to specify F. The extensions to multiple prizes, the F-dependent efficient prize, and the finite-draw reversal of competition effects add substantive value for mechanism design in R&D or labor-market contests. The model ships parameter-free equilibrium characterizations and falsifiable predictions, which strengthen its assessment.
minor comments (3)
- [Abstract] Abstract: the statement that 'the efficient prize ... is distribution-dependent' could briefly note the direction of dependence (e.g., larger for heavy tails) to improve immediate readability.
- [Section 2] Notation: ensure the common-knowledge assumption on the game rules and the fact that F is known up to its family (but not parameters) is stated explicitly when first introducing the equilibrium strategy in the main text.
- [Section 5] The finite-draw extension would benefit from a small numerical table illustrating the threshold reversal for low c and different N to make the contrast with the unlimited-draw case concrete.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our paper and the recommendation for minor revision. The referee's summary accurately captures the central results on distribution-free equilibrium properties, full rent dissipation, and the extensions to multiple prizes, hierarchical competition, efficient prize design, and finite-draw cases.
Circularity Check
Derivation self-contained from equilibrium indifference conditions
full rationale
The paper derives its distribution-free equilibrium properties (acceptance probability, expected search cost, payoffs independent of F, and full rent dissipation) directly from the symmetric Nash equilibrium conditions in the sequential search model. The indifference between accepting and continuing search produces equations in which the distribution F cancels out when computing the expected value of the next draw and the continuation value, without any fitted parameters, self-citation chains, or imported uniqueness theorems. The full rent dissipation result follows immediately from the equilibrium payoff equaling the expected marginal search cost under the prize value. No load-bearing step reduces to a prior result by construction or renames an empirical pattern; the claims are obtained by solving the model under standard assumptions on F and common knowledge of the rules.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Players are risk-neutral expected-payoff maximizers with common knowledge of the game structure, prize, and cost.
- domain assumption The value distribution is fixed and known in form but the equilibrium strategies adjust thresholds accordingly.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
In the unique symmetric equilibrium, the acceptance probability, expected search cost, and players' payoffs do not depend on the underlying distribution. Total search expenditure equals the prize (full rent dissipation).
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
the equilibrium acceptance quantile depends only on the number of players, the search depth, and the cost-prize ratio, not on the underlying distribution
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Aoyagi, M. (2010). Information feedback in a dynamic tournament.Games and Economic Behavior, 70(2), 242–260
work page 2010
-
[2]
Boudreau, K.J., Lacetera, N., and Lakhani, K.R. (2011). Incentives and problem uncertainty in innovation contests: An empirical analysis.Management Science, 57(5), 843–863
work page 2011
-
[3]
Baye, M.R., Kovenock, D., and de Vries, C.G. (1996). The all-pay auction with complete information.Economic Theory, 8(2), 291–305
work page 1996
-
[4]
Bolton, P. and Harris, C. (1999). Strategic experimentation.Econometrica, 67(2), 349–374
work page 1999
-
[5]
Chade, H. and Smith, L. (2006). Simultaneous search.Econometrica, 74(5), 1293–1307
work page 2006
-
[6]
Dahan, E. and Mendelson, H. (2001). An extreme-value model of concept testing.Manage- ment Science, 47(1), 102–116
work page 2001
-
[7]
Drugov, M. and Ryvkin, D. (2020). Tournament rewards and heavy tails.Journal of Eco- nomic Theory, 190, 105116
work page 2020
-
[8]
Che, Y.-K. and Gale, I. (2003). Optimal design of research contests.American Economic Review, 93(3), 646–671
work page 2003
-
[9]
Ederer, F. (2010). Feedback and motivation in dynamic tournaments.Journal of Economics & Management Strategy, 19(3), 733–769. 31
work page 2010
-
[10]
Fullerton, R.L. and McAfee, R.P. (1999). Auctioning entry into tournaments.Journal of Political Economy, 107(3), 573–605
work page 1999
-
[11]
Halac, M., Kartik, N., and Liu, Q. (2017). Contests for experimentation.Journal of Political Economy, 125(5), 1523–1569
work page 2017
-
[12]
Hoppe-Wewetzer, H.C., Katsenos, G., and Ozdenoren, E. (2023). The effects of rivalry on scientific progress under public vs private learning.Journal of Economic Theory, 212, 105710
work page 2023
-
[13]
Keller, G., Rady, S., and Cripps, M. (2005). Strategic experimentation with exponential bandits.Econometrica, 73(1), 39–68
work page 2005
-
[14]
Lazear, E.P. and Rosen, S. (1981). Rank-order tournaments as optimum labor contracts. Journal of Political Economy, 89(5), 841–864
work page 1981
-
[15]
Loury, G.C. (1979). Market structure and innovation.Quarterly Journal of Economics, 93(3), 395–410
work page 1979
-
[16]
McCall, J.J. (1970). Economics of information and job search.Quarterly Journal of Eco- nomics, 84(1), 113–126
work page 1970
-
[17]
Moldovanu, B. and Sela, A. (2001). The optimal allocation of prizes in contests.American Economic Review, 91(3), 542–558
work page 2001
-
[18]
Nelson, R.R. (1961). Uncertainty, learning, and the economics of parallel research and development efforts.Review of Economics and Statistics, 43(4), 351–364
work page 1961
-
[19]
Mortensen, D.T. (1986). Job search and labor market analysis. InHandbook of Labor
work page 1986
-
[20]
Seel, C. and Strack, P. (2013). Gambling in contests.Journal of Economic Theory, 148(5), 2033–2048
work page 2013
-
[21]
Stigler, G.J. (1961). The economics of information.Journal of Political Economy, 69(3), 213–225
work page 1961
-
[22]
Taylor, C.R. (1995). Digging for golden carrots: An analysis of research tournaments.Amer- ican Economic Review, 85(4), 872–890
work page 1995
- [23]
-
[24]
Tullock, G. (1980). Efficient rent seeking. InToward a Theory of the Rent-Seeking Society, 97–112
work page 1980
-
[25]
Whitmeyer, M. (2017). A competitive optimal stopping game.The B.E. Journal of Theo- retical Economics, 18(1)
work page 2017
-
[26]
Weitzman, M.L. (1979). Optimal search for the best alternative.Econometrica, 47(3), 641–654. 33
work page 1979
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.