Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent.
Edward LockhartMarc LanctotJulien PérolatJean-Baptiste LespiauDustin MorrillFinbarr TimbersKarl TuylsPublished in: CoRR (2019)
Keyphrases
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- pure nash equilibria
- pure strategy
- extensive form games
- pure nash equilibrium
- fictitious play
- repeated games
- multi agent
- game playing
- incomplete information
- long run
- video games
- efficiently computing
- fixed point
- cooperative
- efficient computation
- imperfect information
- learning agents
- game tree search
- solution concepts
- monte carlo
- learning algorithm