3 citations · 6 across the 22 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2024
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
Leello Dadi, Ioannis Panageas, Stratis Skoulakis +2
We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an -appro…
cs.GT2023★ 1 cited
Semi Bandit Dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees
Ioannis Panageas, Stratis Skoulakis, Luca Viano +2
In this work, we introduce a new variant of online gradient descent, which provably converges to Nash Equilibria and simultaneously attains sublinear regret for the class of conges…