Login / Signup
Algorithm for Computing Approximate Nash Equilibrium in Continuous Games with Application to Continuous Blotto.
Sam Ganzfried
Published in:
Games (2021)
Keyphrases
</>
nash equilibrium
regret minimization
dynamic programming
game theory
objective function
optimal solution
linear programming
game theoretic
fictitious play
computational complexity
np hard
worst case
stochastic games
genetic algorithm
convex hull
multi agent
nash equilibria
mixed strategy