Demo Data from EDBT 2026 / reviewers in the wild / expert
Pierre-Louis Cauvin
dblp:410/2797
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 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
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
equilibrium computation |
0.9 | 1 | 2025 | The impact of uncertainty on regularized learning in games · ICML 2025 |
Algorithmic game theory and mechanism design
learning in games |
0.9 | 1 | 2025 | The impact of uncertainty on regularized learning in games · ICML 2025 |
Algorithmic game theory and mechanism design › learning in games
regularized learning |
0.3 | 1 | 2025 | 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.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | The impact of uncertainty on regularized learning in gamesabstractIn 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 |
ICML | 1 |