Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
Ioannis PanageasStratis SkoulakisLuca VianoXiao WangVolkan CevherPublished in: ICML (2023)
Keyphrases
- congestion games
- nash equilibrium
- regret minimization
- pure strategy
- nash equilibria
- game theory
- pure nash equilibria
- pure nash equilibrium
- game theoretic
- bandit problems
- worst case
- regret bounds
- multi armed bandit problems
- upper confidence bound
- normal form games
- mixed strategy
- stochastic games
- pareto optimal
- cooperative
- multi armed bandit
- incomplete information
- cost function
- lower bound
- solution concepts
- learning algorithm
- evolutionary game theory
- variational inequalities
- stackelberg game
- decision problems
- approximation algorithms
- upper bound
- multi agent systems