From Duels to Battlefields: Computing Equilibria of Blotto and Other Games

DOI10.1287/moor.2018.0971zbMath1437.91011arXiv1603.00119OpenAlexW2947004509MaRDI QIDQ5108243

Sina Dehghani, Hamid Mahini, Brendan Lucier, Saeed Seddighin, AmirMahdi Ahmadinejad, Mohammad Taghi Hajiaghayi

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.00119

zbMATH Keywords

Nash equilibriumzero-sum gamesalgorithmic game theoryColonel Blotto

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic game theory and complexity (91A68)

Related Items (4)

Discrete Colonel Blotto games with two battlefields ⋮ Multimarket lobbying with reserves ⋮ The multiplayer Colonel Blotto game ⋮ Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto

Cites Work

• Unnamed Item
• Unnamed Item
• Non-symmetric discrete General Lotto games
• On general minimax theorems
• Ranking games
• The ellipsoid method and its consequences in combinatorial optimization
• Distributive politics and electoral competition
• Polynomial-time computation of exact correlated equilibrium in compact games
• Contests with limited resources
• Discrete Colonel Blotto and general lotto games
• Campaign spending regulation in a model of redistributive politics
• The Colonel Blotto game
• Non-cooperative games
• Fast algorithms for finding randomized strategies in game trees
• Reducibility among equilibrium problems
• Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
• Competitive Optimality of Logarithmic Investment
• Polynomial algorithms in linear programming
• Systems defense games: Colonel blotto, command and control
• The Matching Polytope has Exponential Extension Complexity
• The Complexity of Computing a Nash Equilibrium
• Dueling algorithms
• On “Colonel Blotto” and Analogous Games
• Emile Borel, Initiator of the Theory of Psychological Games and Its Application
• The Theory of Play and Integral Equations with Skew Symmetric Kernels
• Commentary on the Three Notes of Emile Borel
• Communication on the Borel Notes
• Constrained Games and Linear Programming
• Optimal oblivious routing in polynomial time

This page was built for publication: From Duels to Battlefields: Computing Equilibria of Blotto and Other Games