Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games.
Hédi HadijiSarah SachsTim van ErvenWouter M. KoolenPublished in: NeurIPS (2023)
Keyphrases
- nash equilibria
- stochastic games
- game theory
- incomplete information
- nash equilibrium
- fictitious play
- multiagent learning
- game theoretic
- learning algorithm
- pure strategy
- exact learning
- query complexity
- markov decision processes
- imperfect information
- solution concepts
- learning problems
- learning agent
- relational learning
- supervised learning