Computing Approximate Nash Equilibria in Network Congestion Games.
Andreas Emil FeldmannHeiko RöglinBerthold VöckingPublished in: SIROCCO (2008)
Keyphrases
- nash equilibria
- congestion games
- incomplete information
- pure strategy
- game theory
- stochastic games
- nash equilibrium
- fictitious play
- game theoretic
- pure nash equilibria
- multiagent learning
- solution concepts
- cooperative
- multi agent systems
- infinite horizon
- mixed strategy
- decision making
- optimal solution
- reinforcement learning