3 citations · 8 across the 23 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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…
stat.ML2023
What can online reinforcement learning with function approximation benefit from general coverage conditions?
Fanghui Liu, Luca Viano, Volkan Cevher
In online reinforcement learning (RL), instead of employing standard structural assumptions on Markov decision processes (MDPs), using a certain coverage condition (original from o…