Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto

DOI10.3390/g12020047zbMath1479.91065arXiv2006.07443OpenAlexW3166362867MaRDI QIDQ2052549

Sam Ganzfried

Publication date: 26 November 2021

Published in: Games (Search for Journal in Brave)

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

zbMATH Keywords

imperfect informationcontinuous gameBlotto gamenational security

Mathematics Subject Classification ID

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

Related Items

Toward the Nash equilibrium solutions for large-scale pentagonal fuzzy continuous static games, On Stackelberg leader with min-max followers to solve fuzzy continuous static games, Multiple oracle algorithm to solve continuous games, A preface for the special issue ``economics of conflict and terrorism

Uses Software

• Gurobi
• Pluribus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
• A Blotto game with multi-dimensional incomplete information
• First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
• Separable and low-rank continuous games
• A Blotto game with incomplete information
• Discrete Colonel Blotto and general lotto games
• The Colonel Blotto game
• Non-cooperative games
• An iterative method of solving a game
• From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
• The Complexity of Computing a Nash Equilibrium
• Superhuman AI for multiplayer poker
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points