Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions.
Vittorio BilòMichele FlamminiGianpiero MonacoLuca MoscardelliPublished in: WINE (2015)
Keyphrases
- congestion games
- nash equilibria
- cost function
- pure nash equilibria
- incomplete information
- pure strategy
- nash equilibrium
- game theory
- stochastic games
- game theoretic
- pure nash equilibrium
- fictitious play
- solution concepts
- long run
- multiagent learning
- reinforcement learning
- optimal control
- autonomous agents
- special case
- cooperative