Finding approximate Nash equilibria of bimatrix games via payoff queries.
John FearnleyRahul SavaniPublished in: EC (2014)
Keyphrases
- nash equilibria
- game theory
- nash equilibrium
- stochastic games
- game theoretic
- normal form games
- incomplete information
- fictitious play
- pure strategy
- mixed strategy
- query processing
- solution concepts
- subgame perfect
- cooperative
- multi agent learning
- repeated games
- multiagent learning
- worst case
- approximate answers
- multi agent systems
- dynamic environments
- learning algorithm
- cost function
- special case