8 citations · 16 across the 18 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Multiplicative Optimism for Constant Regret in Games
Ashkan Soleymani, Georgios Piliouras
We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every playe…
cs.GT2025★ 1 cited
Faster Rates for No-Regret Learning in General Games via Cautious Optimism
Ashkan Soleymani, Georgios Piliouras, Gabriele Farina
We establish the first uncoupled learning algorithm that attains per-player regret in multi-player general-sum games, where is the number of players, …