Login / Signup
Algorithm for Computing Approximate Nash equilibrium in Continuous Games with Application to Continuous Blotto.
Sam Ganzfried
Published in:
CoRR (2020)
Keyphrases
</>
nash equilibrium
learning algorithm
dynamic programming
regret minimization
game theoretic
optimal solution
worst case
fictitious play
search space
game theory
nash equilibria
objective function
np hard
multi objective
upper bound