Equilibrium Architecture in Multi-Battle Contests with Count-Dependent Prizes

summary

The gist

Equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields…

In short

The study investigates equilibrium in contests with multiple battlefields and count-dependent prizes. It proves that an equilibrium always exists, and crucially, every such equilibrium forces contestants to allocate their total effort uniformly across all battlefields, effectively turning the complex game into a simple contest based on total effort.

Key concepts

Unrestricted Vector Game
This is the initial model of competing contestants where each chooses an effort level for every battlefield. It's a multi-dimensional game that can be very complex, but the paper shows it simplifies significantly in equilibrium.
Scalar Total-Effort Contest
The key finding is that despite having many battlefields, the equilibrium reduces to a one-dimensional contest. This means the outcome depends only on how much total effort each player puts in across all fields, not how that effort is distributed among them.
Equilibrium Taxonomy
This classifies possible stable outcomes into pure (no mixing), semi-pure (one player mixes), or two-sided mixed (both players mix). The paper characterizes these by examining the expected total effort and prize shares each player receives.

Terminology used across episodes

This episode discusses

The paper

Equilibrium Architecture in Multi-Battle Contests with Count-Dependent Prizes · Read on arXiv

Zhonghong Kuang, Jingfeng Lu

Renmin University of China · National University of Singapore

We study how aggregating local victories shapes participation and equilibrium uniqueness. Two contestants with possibly different marginal costs compete across identical Tullock battlefields with discriminatory power at most one. A nonconstant, nondecreasing, symmetric schedule divides a fixed prize by victory count. We establish existence and show that every realized equilibrium allocation divides effort equally across battlefields. Equilibrium is unique through six battlefields, with at most two effort levels per contestant; seven first permits multiple equilibria or randomization by both contestants. The prize schedule and technology, not the cost ratio, determine whether equilibria use infinitely many effort levels; in that case, cost asymmetry changes only the higher-cost contestant's participation probability. Under majority rule, we characterize the unique equilibrium for every battlefield count and cost ratio.

Transcript

Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.

Ruth: I'm Ruth.

Warren: And I'm Warren, here with Iris.

Ruth: We're looking at the paper: "Equilibrium Architecture in Multi-Battle Contests with Count-Dependent Prizes".

Warren: Here's the gist of the paper. Equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields Model Setup and Reduction The study models two risk-neutral contestants competing across identical battlefields governed by a Tullock technology with discriminatory power at most one The prize allocation schedule is defined as admissible if it satisfies budget balance, monotonicity, and nonconstancy By subtracting the constant term from payoffs, the incentives are unchanged, leading to a constant-sum reformulation where each contestant chooses an effort vector with actual total effort E i The unrestricted multidimensional game is shown to reduce in equilibrium to a one-dimensional contest in total effort Equilibrium Taxonomy and Characterization Equilibria are classified as pure, semi-pure (one contestant mixes), or two-sided mixed, with the latter requiring at most countably many positive effort levels accumulating only at zero Proposition 3.1 states that all equilibria give each contestant the same expected total effort, prize share, effort cost, and net payoff The characterization involves finding a unique pure candidate (Proposition 3.2) or identifying the set of distributions satisfying global best-response tests (Proposition 3.4) Geometry and Uniqueness Conditions The best-response geometry is described by the normalized payoff function U(x,y) and the contact set Γ(sigma) defined by argmax t≥0 of phi(t)-sigma t A pure equilibrium requires that the tangent lines to phi at c and 1/c lie on or above the reward curve for every nonnegative effort ratio (Proposition 3.2) The strict reciprocal-deviation inequalities are used to rule out two-sided mixing, fixing one contestant’s effort in every equilibrium Battlefield Count Dependence The number of battlefields significantly impacts the equilibrium structure, with uniqueness guaranteed for six battlefields and multiplicity or two-sided mixing permitted starting at seven battlefields The sharp schedule-robust pure-equilibrium threshold is given by 0<r≤r all J, which ensures uniqueness and purity for every admissible schedule For majority rule, paired odd and even counts generate the same total-effort game, while greater discriminatory power moves the game from a unique pure region to two-sided mixing Majority Rule Correspondence The final application recovers the complete majority-rule correspondence, showing that paired odd and even counts generate identical total-effort games The analysis of the seven-battlefield case demonstrates that multiplicity and two-sided mixing can occur for certain cost ratios, such as when r=c=1 The paper concludes that equilibrium exists despite the discontinuity at mutual inactivity, and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest The results show that an aggregation rule affects not only effort intensity but also the shape of expected rewards and therefore participation, who mixes, and how many effort levels are used The sharp threshold r ≤ 1/ceil(J/2) guarantees that equilibrium is unique and pure for every admissible schedule The six–seven boundary is geometric, where a seventh battlefield first allows a third contact or two-sided mixing This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest This paper establishes existence and uniformity of equilibrium in multi-battle contests with count-dependent prizes, proving that every equilibrium allocates effort uniformly across battlefields The central finding is that equilibrium exists despite the discontinuity at mutual inactivity and every equilibrium equalizes effort across battlefields, reducing the unrestricted vector game to a scalar total-effort contest<ref:2609.

Title and authors: Ruth: So what they’re actually summarizing is that in this multi-battle contest setting with count-dependent prizes, equilibrium isn't just some abstract thing that might not happen; it exists, and it has a very specific structure.

Warren: They are showing that the contestants can end up in three types of equilibrium: pure, where both choose one effort level; semi-pure, where one contestant fixes their effort and the other randomizes; or two-sided mixed.

Iris: The two-sided mixed case is particularly interesting because it says each contestant uses at most countably infinite positive effort levels, meaning they only put probability on a countable set of positive numbers, and those levels can only accumulate at zero.

Ruth: That's the caveat there—the idea that even when players are mixing their strategies, the structure of that mixing is highly constrained and doesn't get messy with uncountable possibilities.

Warren: And they’ve identified a global verification test for two-sided mixing, which is important because it means we have a concrete way to check if an equilibrium strategy falls into that mixed category or not.

Iris: The paper also makes a statement about multiplicity: they find that multiple equilibria with different structures can actually coexist while still generating the same expected total effort, prize share, effort cost, and net payoff.

Ruth: That means you could have several distinct ways players reach an outcome—maybe one where everyone is pure and another where one person mixes—but the overall economic results for both contestants stay identical.

Warren: So if we’re looking at strategy costs to run the game, this suggests that while the exact path taken might change, the expected total effort and cost profile of running it remain robust across these different equilibrium structures.

Iris: I also note that they characterize all equilibria under majority rule, which is a nice way to connect different contest setups together.

Ruth: And then they show how paired odd and even counts generate the same total-effort game through Lemma four point one(i), which helps us characterize all those majority rule equilibria by relating them across different battlefield counts.

The paper's summary: Ruth: The improvements they suggest focus on making this framework more predictive, especially regarding the structure of those equilibria we just talked about. They’re looking at how to use the characterization provided in Theorem four point five and Figure one to predict whether an equilibrium is pure, semi-pure, or two-sided mixed based on things like battlefield count and cost ratios.

Warren: I’m interested in that predictive power because it moves us beyond just knowing that an equilibrium exists to actually figuring out *which* kind of equilibrium we're likely looking at given the setup.

Iris: And then there’s the strategy set identification, which they do by analyzing a high reward elasticity condition, specifically condition number six from Section four point one when costs are equal, and this is key for Proposition four point two about equal costs.

Ruth: That elasticity thing seems to be how they determine if the strategy has finite or countably infinite positive support with zero as its only accumulation point, which is a big deal for modeling real player behavior that mixes strategies.

Warren: I'm also keen on the robustness analysis against schedule changes because they identify schedule-robust thresholds for pure equilibrium using the bound from Proposition four point four, which tells us when an equilibrium stays unique and pure even if we change the prize schedules or cost ratios slightly.

Iris: That threshold is important because it gives a concrete number—like r being less than or equal to r all J—that dictates when we can guarantee a pure equilibrium exists for every admissible schedule.

Ruth: And then they tackle the majority rule correspondence, showing how paired odd and even counts generate the same total-effort game through Lemma four point one(i), which helps us characterize all those majority rule equilibria by relating them across different battlefield counts.

The paper's improvements: Ruth: So to wrap up, the paper on Equilibrium Architecture in Multi-Battle Contests with Count-Dependent Prizes confirms that equilibrium exists even with the discontinuity at mutual inactivity, and every equilibrium equalizes effort across battlefields, reducing the game to a total effort contest.

Warren: The main implication for us is that an aggregation rule affects not just how intensely players try, but also the shape of expected rewards and participation—who mixes, how many effort levels are used.

Iris: And they give us a sharp threshold r less than or equal to one divided by ceiling J over two that guarantees equilibrium is unique and pure for every admissible schedule.

Ruth: That seven-battlefield boundary is geometric; it’s where the game shifts from having a unique pure region to allowing multiplicity or two-sided mixing, which they show happens when the seventh battlefield is introduced.

Warren: So while we have this strong existence and uniformity result, we still need to be careful about how many battlefields we're actually dealing with before things get more complex than just a single total effort contest.

Iris: I just want to add that the paper flags that the method itself doesn't cover every scenario perfectly because it focuses on risk-neutral players and a Tullock technology with at most one discriminatory power.

Ruth: Right, so we have this solid foundation proving existence and uniformity for multi-battle contests with count-dependent prizes, but we still have to consider how real world costs might interact differently. That’s where the next line of inquiry starts.

Conclusion: Ruth: So we're wrapping up on "Equilibrium Architecture in Multi-Battle Contests with Count-Dependent Prizes." The main thing to take away is that even with this gap where nobody is trying to compete, a stable outcome still exists, and every stable outcome ends up having the same total effort across all the battlefields.

Warren: Yeah, I think that total effort contest reduction is the key. It takes this complicated vector game and boils it down to just one thing: how much total effort everyone puts in. And they prove that this holds true for any number of battlefields we throw at it, as long as the setup meets their rules.

Iris: I do want to mention that the paper focuses on risk-neutral players using a Tullock technology where discriminatory power is limited to one, so we have to keep that context in mind when thinking about real-world competition.

Ruth: Exactly. And they give us a sharp threshold, r less than or equal to one divided by ceiling J over two, which guarantees that for any schedule you pick, you can find an equilibrium that is pure and unique.

Warren: That threshold feels pretty concrete for a trader; it gives you a rule for when the game will always have one clear path instead of getting messy with different kinds of mixing strategies.

Iris: I think what’s really interesting is how they map out those equilibria, showing that there can be multiple ways to get to the same total effort outcome, even if the structures—pure versus two-sided mixed—are different.

Ruth: That means you could have several distinct strategies players might use, but the actual cost and reward profile for both contestants will be identical across all of them.

Warren: From a cost perspective, that uniformity suggests that if you understand the rules of the contest, you can predict where the total effort contest will land without worrying about which specific battlefield is causing trouble.

Iris: I just want to add that they don't cover every possible situation because they are sticking to risk-neutral players and a very specific technology.

Ruth: Right, so we have this solid foundation for multi-battle contests with count-dependent prizes, but we still need to consider how real world costs might interact differently when you move away from those assumptions. That’s where the next line of inquiry starts.

More episodes

← Home