activity
20122026
most citedSketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

62 citations · 372 across the 112 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2025

Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games

Yi Feng, Kaito Fujii, Stratis Skoulakis +2

Since Polyak's pioneering work, heavy ball (HB) momentum has been widely studied in minimization. However, its role in min-max games remains largely unexplored. As a key component…

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

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…

cs.GT2023

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…

cs.GT2018

Let's be Honest: An Optimal No-Regret Framework for Zero-Sum Games

Ehsan Asadi Kangarshahi, Ya-Ping Hsieh, Mehmet Fatih Sahin +1

We revisit the problem of solving two-player zero-sum games in the decentralized setting. We propose a simple algorithmic framework that simultaneously achieves the best rates for…