Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games.
Avrim BlumEyal Even-DarKatrina LigettPublished in: PODC (2006)
Keyphrases
- nash equilibria
- regret minimization
- nash equilibrium
- game theory
- game theoretic
- worst case
- incomplete information
- convergence rate
- stochastic games
- pure strategy
- fictitious play
- confidence bounds
- lower bound
- learning algorithm
- routing protocol
- upper confidence bound
- online learning
- expert advice
- online convex optimization
- bandit problems
- convergence analysis
- regret bounds
- pure nash equilibrium
- multiagent systems
- cooperative