• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Taming the Exponential Action Set: Sublinear Regret and Fast Convergence to Nash Equilibrium in Online Congestion Games.

Jing DongJingyu WuSiwei WangBaoxiang WangWei Chen
Published in: CoRR (2023)
Keyphrases
  • nash equilibrium
  • congestion games
  • pure nash equilibrium
  • game theory
  • online learning
  • game theoretic
  • nash equilibria
  • regret minimization
  • pure strategy
  • pure nash equilibria
  • np hard