pith. sign in

arxiv: 2604.06329 · v1 · submitted 2026-04-07 · 💻 cs.GT

Beyond Arbitrary Allocations: Security Values in Constrained General Lotto Games

Keith Paarporn , Jason R. Marden This is my paper

Pith reviewed 2026-05-10 18:12 UTC · model grok-4.3

classification 💻 cs.GT
keywords General Lotto gameconstrained allocationsecurity valueresource allocationzero-sum gameColonel Blottoadversarial competitionperformance bounds
0
0 comments X

The pith

A player limited to allocating resources in only one contest receives explicit lower and upper bounds on its security value in the General Lotto game.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies a variant of the General Lotto game in which one participant must commit all resources to a single contest instead of spreading them across multiple independent contests. It derives lower and upper bounds on the guaranteed payoff, or security value, that this restricted player can secure against an opponent who faces no such limit. The bounds show how the single-contest rule forces a different allocation strategy and alters the performance floor the restricted player can achieve. This matters in settings where operational rules prevent flexible distribution, such as certain military or market competitions. The results quantify the cost of the restriction in concrete terms.

Core claim

In the constrained General Lotto game, one player must allocate its entire resource budget to exactly one of the contests while the opponent may distribute resources arbitrarily across all contests. The paper establishes both a lower bound and an upper bound on the security value attainable by the constrained player, expressed in terms of the players' total resources and the number of contests. These bounds demonstrate that the single-contest restriction changes the optimal strategic behavior and provides performance guarantees that differ from those in the standard unconstrained model.

What carries the argument

The security value of the constrained player, defined as the payoff it can guarantee in the worst case against an optimal unconstrained opponent under the single-contest allocation rule.

If this is right

  • The constrained player must concentrate its resources on one contest rather than hedging across several, leading to different equilibrium strategies.
  • The security value lies between explicit functions of total resources and contest count, supplying quantitative performance guarantees.
  • Operational constraints of this type reduce the range of achievable payoffs relative to the unconstrained General Lotto game.
  • Decision makers facing single-contest limits can use the bounds to evaluate worst-case outcomes before committing resources.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar single-contest restrictions could be imposed on other Colonel Blotto variants to study their effect on equilibrium payoffs.
  • The bounds may serve as benchmarks when testing heuristic allocation algorithms in simulated multi-contest environments.
  • Relaxing the complete-information assumption while keeping the allocation constraint would likely tighten or loosen the security-value interval.

Load-bearing premise

The setting is a zero-sum game with complete information in which the only restriction is that one player must place all resources into a single contest.

What would settle it

A concrete numerical example with given resource totals and contest values in which the constrained player's guaranteed payoff lies strictly outside the derived lower and upper bounds.

Figures

Figures reproduced from arXiv: 2604.06329 by Jason R. Marden, Keith Paarporn.

Figure 2
Figure 2. Figure 2: This plot shows lower and upper bounds on max-min and [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
read the original abstract

Resource allocation problems across multiple contests are ubiquitous in adversarial settings, from military operations to market competition. While Colonel Blotto and General Lotto games have provided valuable theoretical foundations for such problems, their equilibrium characterizations typically permit resources to be arbitrarily allocated across all contests -- a flexibility that rarely aligns with practical constraints. This paper introduces a novel constrained variant of the General Lotto game where one player is restricted to allocating resources to only a single contest. In this model we provide lower and upper bounds on the security values for this constrained player, quantifying how the inability to distribute resources across multiple contests fundamentally changes optimal strategic behavior and performance guarantees. These findings contribute to a broader understanding of how operational constraints shape strategic outcomes in competitive resource allocation, with implications for decision-makers facing similar constraints in practice.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper introduces a constrained variant of the General Lotto game in which one player may allocate its total resource budget to only a single contest rather than distributing it arbitrarily across all contests. It derives explicit lower and upper bounds on the security value attained by this constrained player in the resulting zero-sum game and discusses how the restriction alters optimal strategies relative to the unconstrained case.

Significance. If the bounds are tight and the derivations hold, the work supplies concrete performance guarantees that quantify the penalty imposed by a realistic operational constraint. This extends the classical General Lotto literature in a direction relevant to applications such as military targeting or competitive bidding where full resource flexibility is unavailable.

minor comments (3)
  1. [Abstract] The abstract states that bounds are derived but does not preview their functional form or dependence on the number of contests; adding one sentence with the explicit expressions would improve readability.
  2. [Model section] Notation for the security value (e.g., v_c for the constrained player) should be introduced at the first use in the model section rather than assumed from the abstract.
  3. [Numerical results / figures] Figure captions could explicitly label which curve corresponds to the lower bound and which to the upper bound to avoid ambiguity when comparing to the unconstrained benchmark.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our work on constrained General Lotto games and for recommending minor revision. The assessment correctly identifies the core contribution: explicit bounds on the security value for a player restricted to single-contest allocation. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity detected in derivation

full rationale

The paper introduces a constrained General Lotto game with one player restricted to a single contest and derives explicit lower and upper bounds on that player's security value. The setup relies on standard zero-sum complete-information assumptions and the stated single-contest restriction; the bounds are obtained by analyzing the resulting game rather than by fitting parameters to data or redefining inputs as outputs. No self-definitional equations, fitted-input predictions, or load-bearing self-citations appear in the provided abstract or claim descriptions. The derivation chain remains self-contained against the model primitives.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Review based solely on abstract; no explicit free parameters, axioms, or invented entities are identifiable from the provided text. The model implicitly relies on standard zero-sum game assumptions and the definition of security value from prior General Lotto literature.

pith-pipeline@v0.9.0 · 5424 in / 1015 out tokens · 40028 ms · 2026-05-10T18:12:07.417994+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    A continuous Colonel Blotto game,

    O. Gross and R. Wagner, “A continuous Colonel Blotto game,” RAND Project, Air Force, Santa Monica, Tech. Rep., 1950

    work page 1950

  2. [2]

    The Colonel Blotto game,

    B. Roberson, “The Colonel Blotto game,”Economic Theory, vol. 29, no. 1, pp. 1–24, 2006

    work page 2006

  3. [3]

    The heterogeneous Colonel Blotto game,

    G. Schwartz, P. Loiseau, and S. S. Sastry, “The heterogeneous Colonel Blotto game,” inInt. Conf. on NETwork Games, COntrol and OPti- mization, Oct 2014, pp. 232–238

    work page 2014

  4. [4]

    Generalizations of the General Lotto and Colonel Blotto games,

    D. Kovenock and B. Roberson, “Generalizations of the General Lotto and Colonel Blotto games,”Economic Theory, vol. 71, pp. 997–1032, 2021

    work page 2021

  5. [5]

    Colonel Blotto games with favoritism: competitions with pre-allocations and asymmetric effectiveness,

    D. Q. Vu and P. Loiseau, “Colonel Blotto games with favoritism: competitions with pre-allocations and asymmetric effectiveness,” in Proceedings of the 22nd ACM Conference on Economics and Compu- tation, 2021, pp. 862–863

    work page 2021

  6. [6]

    Rein- forcement strategies in General Lotto games,

    K. Paarporn, R. Chandan, M. Alizadeh, and J. R. Marden, “Rein- forcement strategies in General Lotto games,”IEEE Transactions on Automatic Control, vol. 70, no. 4, pp. 2228–2241, 2025

    work page 2025

  7. [7]

    Incomplete and asymmetric information in General Lotto games,

    ——, “Incomplete and asymmetric information in General Lotto games,”IEEE Transactions on Automatic Control, vol. 70, no. 6, pp. 3617–3632, 2025

    work page 2025

  8. [8]

    The value of com- promising strategic intent in General Lotto games,

    G. Diaz-Garcia, K. Paarporn, and J. R. Marden, “The value of com- promising strategic intent in General Lotto games,” in2025 American Control Conference (ACC), 2025, pp. 1554–1559

    work page 2025

  9. [9]

    Multi-layer network formation via a Colonel Blotto game,

    E. M. Shahrivar and S. Sundaram, “Multi-layer network formation via a Colonel Blotto game,” in2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), Dec 2014, pp. 838–841

    work page 2014

  10. [10]

    Colonel Blotto games in network systems: Models, strategies, and applica- tions,

    S. Guan, J. Wang, H. Yao, C. Jiang, Z. Han, and Y . Ren, “Colonel Blotto games in network systems: Models, strategies, and applica- tions,”IEEE Transactions on Network Science and Engineering, vol. 7, no. 2, pp. 637–649, 2020

    work page 2020

  11. [11]

    The defense of networked targets in General Lotto games,

    A. Aghajan, K. Paarporn, and J. R. Marden, “The defense of networked targets in General Lotto games,”IEEE Transactions on Control of Network Systems, vol. 13, no. 1, pp. 3–15, 2026

    work page 2026

  12. [12]

    Dynamic defender- attacker Blotto game,

    D. Shishika, Y . Guan, M. Dorothy, and V . Kumar, “Dynamic defender- attacker Blotto game,” in2022 American Control Conference (ACC). IEEE, 2022, pp. 4422–4428

    work page 2022

  13. [13]

    Focality and asymmetry in multi-battle contests,

    S. M. Chowdhury, D. Kovenock, D. Rojo Arjona, and N. T. Wilcox, “Focality and asymmetry in multi-battle contests,”The Economic Journal, vol. 131, no. 636, pp. 1593–1619, 2021

    work page 2021

  14. [14]

    A Blotto game approach to ride-hailing markets with electric vehicles,

    M. Maljkovic, G. Nilsson, and N. Geroliminis, “A Blotto game approach to ride-hailing markets with electric vehicles,” in2024 European Control Conference (ECC), 2024, pp. 2877–2882

    work page 2024

  15. [15]

    Fundamental concepts of cyber resilience: Introduction and overview,

    I. Linkov and A. Kott, “Fundamental concepts of cyber resilience: Introduction and overview,”Cyber resilience of systems and networks, pp. 1–25, 2019

    work page 2019

  16. [16]

    A Tullock-contest-based approach for cyber security investments,

    D. Iliaev, S. Oren, and E. Segev, “A Tullock-contest-based approach for cyber security investments,”Annals of Operations Research, vol. 320, no. 1, pp. 61–84, 2023

    work page 2023

  17. [17]

    Discrete Colonel Blotto and General Lotto games,

    S. Hart, “Discrete Colonel Blotto and General Lotto games,”Interna- tional Journal of Game Theory, vol. 36, no. 3-4, pp. 441–460, 2008. APPENDIX A. Proof of Lemma 4.3 Here, we provide a detailed proof for Lemma 4.3, the analytical characterization (11) of the upper bound in Theo- rem 3.1. Recall that UB(p)(12) is defined as ( 1− Y 2X (v⊤p)2 maxc∈C vcpc ,i...

    work page 2008