3 citations · 3 across the 4 of their papers we have counts for
4 papers
(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
Ioannis Anagnostides, Ioannis Panageas, Nikolas Patris +1
Follow the regularized leader FTRL is the premier algorithm for online optimization. However, despite decades of research on its convergence in constrained optimization -- and pote…
Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
Nikolas Patris, Stelios Stavroulakis, Fivos Kalogiannis +2
We consider the problem of computing Nash equilibria in potential games where each player's strategy set is subject to private uncoupled constraints. This scenario is frequently en…
Exponential Lower Bounds for Fictitious Play in Potential Games
Ioannis Panageas, Nikolas Patris, Stratis Skoulakis +1
Fictitious Play (FP) is a simple and natural dynamic for repeated play with many applications in game theory and multi-agent reinforcement learning. It was introduced by Brown (194…
Improved Bounds for Online Facility Location with Predictions
Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis +2
We consider Online Facility Location in the framework of learning-augmented online algorithms. In Online Facility Location (OFL), demands arrive one-by-one in a metric space and mu…