The structure and complexity of Nash equilibria for a selfish routing game.
Dimitris FotakisSpyros C. KontogiannisElias KoutsoupiasMarios MavronicolasPaul G. SpirakisPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- nash equilibria
- nash equilibrium
- game theory
- pure strategy
- stochastic games
- incomplete information
- game theoretic
- fictitious play
- worst case
- decision problems
- subgame perfect
- genetic algorithm
- mixed strategy
- resource allocation
- cooperative
- artificial intelligence
- computer games
- routing protocol
- solution concepts
- dynamic programming
- special case
- congestion games