Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Davide Legacci

dblp:377/9321 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Algorithmic game theory and mechanism design · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
equilibrium computation
1.622025
The impact of uncertainty on regularized learning in games · ICML 2025
No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests · NeurIPS 2024
Algorithmic game theory and mechanism design
learning in games
0.912025
The impact of uncertainty on regularized learning in games · ICML 2025
Algorithmic game theory and mechanism design
game decomposition
0.812024
A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential Weights · ICML 2024
Algorithmic game theory and mechanism design
game dynamics
0.812024
A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential Weights · ICML 2024
Algorithmic game theory and mechanism design › game dynamics › equilibrium convergence
nash equilibrium convergence
0.812024
No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests · NeurIPS 2024
Algorithmic game theory and mechanism design
regret minimization
0.812024
No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests · NeurIPS 2024
Algorithmic game theory and mechanism design › learning in games
regularized learning
0.312025
The impact of uncertainty on regularized learning in games · ICML 2025

Methods — techniques the papers use, named apart from their topics

stochastic dynamics analysis · 0.9perturbation analysis · 0.9shahshahani metric · 0.8poincaré recurrence · 0.8optimistic mirror-prox · 0.8helmholtz decomposition · 0.8follow-the-regularized-leader · 0.8extrapolation · 0.8
YearPublicationVenuePosition
2025 The impact of uncertainty on regularized learning in games
abstract
In this paper, we investigate how randomness and uncertainty influence learning in games. Specifically, we examine a perturbed variant of the dynamics of “follow-the-regularized-leader” (FTRL), where the players’ payoff observations and strategy updates are continually impacted by random shocks. Our findings reveal that, in a fairly precise sense, “uncertainty favors extremes”: in any game, regardless of the noise level, every player’s trajectory of play reaches an arbitrarily small neighborhood of a pure strategy in finite time (which we estimate). Moreover, even if the player does not ultimately settle at this strategy, they return arbitrarily close to some (possibly different) pure strategy infinitely often. This prompts the question of which sets of pure strategies emerge as robust predictions of learning under uncertainty. We show that (a) the only possible limits of the FTRL dynamics under uncertainty are pure Nash equilibria; and (b) a span of pure strategies is stable and attracting if and only if it is closed under better replies. Finally, we turn to games where the deterministic dynamics are recurrent—such as zero-sum games with interior equilibria—and show that randomness disrupts this behavior, causing the stochastic dynamics to drift toward the boundary on average.
Pierre-Louis Cauvin, Davide Legacci, Panayotis Mertikopoulos
ICML2
2024 A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential Weights
abstract
In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which decomposes a vector field into a potential and an incompressible component. However, the geometry of game dynamics - and, in particular, the dynamics of exponential / multiplicative weights (EW) schemes - is not compatible with the Euclidean underpinnings of Helmholtz's theorem. This leads us to consider a specific Riemannian framework based on the so-called *Shahshahani metric*, and introduce the class of *incompressible games*, for which we establish the following results: First, in addition to being volume-preserving, the continuous-time EW dynamics in incompressible games admit a constant of motion and are *Poincaré recurrent* - i.e., almost every trajectory of play comes arbitrarily close to its starting point infinitely often. Second, we establish a deep connection with a well-known decomposition of games into a potential and harmonic component (where the players' objectives are aligned and anti-aligned respectively): a game is incompressible if and only if it is harmonic, implying in turn that the EW dynamics lead to Poincaré recurrence in harmonic games.
Davide Legacci, Panayotis Mertikopoulos, Bary S. R. Pradelski
ICML1
2024 No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests
abstract
The long-run behavior of multi-agent online learning -- and, in particular, no-regret learning -- is relatively well-understood in potential games, where players have common interests. By contrast, in general harmonic games -- the strategic complement of potential games, where players have competing interests -- very little is known outside the narrow subclass of $2$-player zero-sum games with a fully-mixed equilibrium. Our paper seeks to partially fill this gap by focusing on the full class of (generalized) harmonic games and examining the convergence properties of "follow-the-regularized-leader" (FTRL), the most widely studied class of no-regret learning schemes. As a first result, we show that the continuous-time dynamics of FTRL are Poincaré recurrent, i.e., they return arbitrarily close to their starting point infinitely often, and hence fail to converge. In discrete time, the standard, "vanilla" implementation of FTRL may lead to even worse outcomes, eventually trapping the players in a perpetual cycle of best-responses. However, if FTRL is augmented with a suitable extrapolation step -- which includes as special cases the optimistic and mirror-prox variants of FTRL -- we show that learning converges to a Nash equilibrium from any initial condition, and all players are guaranteed at most $\mathcal{O}(1)$ regret. These results provide an in-depth understanding of no-regret learning in harmonic games, nesting prior work on $2$-player zero-sum games, and showing at a high level that potential and harmonic games are complementary not only from the strategic but also from the dynamic viewpoint.
Davide Legacci, Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras, Bary S. R. Pradelski
NeurIPS1