Conflicts with multiple battlefields
D Kovenock, B Roberson - 2010 - papers.ssrn.com
This paper examines conflicts in which performance is measured by the players' success or
failure in multiple component conflicts, commonly termed “battlefields”. In multi-battlefield …
failure in multiple component conflicts, commonly termed “battlefields”. In multi-battlefield …
Focality and asymmetry in multi-battle contests
This article examines the influence of focality in Colonel Blotto games with a lottery contest
success function (CSF), where the equilibrium is unique and in pure strategies. We …
success function (CSF), where the equilibrium is unique and in pure strategies. We …
On the value of exposure and secrecy of defense system: First-mover advantage vs. robustness
It is commonly accepted in the literature that, when facing with a strategic terrorist, the
government can be better off by manipulating the terrorist's target selection with exposing …
government can be better off by manipulating the terrorist's target selection with exposing …
Waging simple wars: a complete characterization of two-battlefield Blotto equilibria
We analyze the strategic allocation of resources across two contests as in the canonical
Colonel Blotto game. In the games we study, two players simultaneously allocate their forces …
Colonel Blotto game. In the games we study, two players simultaneously allocate their forces …
A Colonel Blotto gladiator game
We consider a stochastic version of the well-known Blotto game, called the gladiator game.
In this zero-sum allocation game two teams of gladiators engage in a sequence of one-on …
In this zero-sum allocation game two teams of gladiators engage in a sequence of one-on …
Path defense in dynamic defender-attacker blotto games (ddab) with limited information
We consider a path guarding problem in dynamic Defender-Attacker Blotto games (dDAB),
where a team of robots must defend a path in a graph against adversarial agents. Multi-robot …
where a team of robots must defend a path in a graph against adversarial agents. Multi-robot …
Asymmetric battlefield uncertainty in general lotto games
How to strategically allocate resources against opponents is a central component in
adversarial decision-making. Moreover, informational asymmetries often exist between …
adversarial decision-making. Moreover, informational asymmetries often exist between …
Collective action and intra-group conflict with fixed budgets
KA Konrad, F Morath - Defence and Peace Economics, 2024 - Taylor & Francis
We study collective action under adverse incentives: each member of the group has a given
budget ('use-it-or-lose-it') that is private information and can be used for contributions to …
budget ('use-it-or-lose-it') that is private information and can be used for contributions to …
Simultaneous contests with equal sharing allocation of prizes: Computational complexity and price of anarchy
We study a general scenario of simultaneous contests that allocate prizes based on equal
sharing: each contest awards its prize to all players who satisfy some contest-specific …
sharing: each contest awards its prize to all players who satisfy some contest-specific …
A General Lotto game with asymmetric budget uncertainty
The General Lotto game is a popular variant of the famous Colonel Blotto game, in which
two opposing players allocate limited resources over many battlefields. In this paper, we …
two opposing players allocate limited resources over many battlefields. In this paper, we …