Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent.
Edward LockhartMarc LanctotJulien PérolatJean-Baptiste LespiauDustin MorrillFinbarr TimbersKarl TuylsPublished in: IJCAI (2019)
Keyphrases
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- pure nash equilibria
- pure nash equilibrium
- extensive form games
- stopping rules
- pure strategy
- fictitious play
- multi agent
- efficient computation
- incomplete information
- stochastic games
- repeated games
- game tree search
- data sets
- long run
- solution concepts
- minimax search
- computer games
- multi agent systems
- search algorithm
- cooperative