Bounding the inefficiency of Nash equilibria in games with finitely many players.
Uriel G. RothblumPublished in: Oper. Res. Lett. (2007)
Keyphrases
- nash equilibria
- game theory
- solution concepts
- pure strategy
- normal form games
- game theoretic
- nash equilibrium
- incomplete information
- stochastic games
- fictitious play
- congestion games
- repeated games
- mixed strategy
- cooperative
- upper bound
- boolean games
- finite number
- multiagent learning
- multi agent systems
- imperfect information
- finite horizon
- resource allocation
- multi player
- dynamic programming
- lower bound
- stackelberg game
- correlated equilibrium
- learning algorithm