Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games.
Avrim BlumEyal Even-DarKatrina LigettPublished in: Theory Comput. (2010)
Keyphrases
- regret minimization
- nash equilibria
- nash equilibrium
- game theoretic
- game theory
- worst case
- online convex optimization
- fictitious play
- online learning
- confidence bounds
- stochastic games
- solution concepts
- upper confidence bound
- lower bound
- routing protocol
- multiagent learning
- weighted majority
- learning algorithm
- machine learning
- multi agent systems
- imperfect information
- upper bound
- objective function
- pure strategy
- convergence rate
- pure nash equilibrium
- video games