Andrea Celli
Andrea Celli is a computer scientist whose research develops no-regret learning methods for equilibrium finding in strategic games. He earned a computer science PhD at Politecnico di Milano, visited Carnegie Mellon’s Electronic Marketplaces Lab during his doctorate, and received the 2017 Lesmo prize for the best Italian MSc thesis in artificial intelligence. His 2020 paper on extensive-form correlated equilibria received a NeurIPS Outstanding Paper award and introduced an efficient no-trigger-regret algorithm. Later papers advanced equilibrium learning in 2022, proved the complexity of approximate Φ-equilibria in generalized games in 2025, and studied game payoff estimation from observed play in 2026. As of October 2026, he is an assistant professor in Bocconi’s Department of Computing Sciences.
- Now at
- Bocconi University
- Works
- 74
- Citations
- 400
- h-index
- 11
- Badges
- Links
- Website
Publication numbers from OpenAlex, as of 22 October 2026.
Timeline
-
2017
A Lesmo prize
In 2017, he receives the Lesmo prize for the best Italian MSc thesis in artificial intelligence.
-
2018
A CMU research visit
During his PhD, he visits Carnegie Mellon’s Electronic Marketplaces Lab from January 2018 to May 2018.
-
2020
A NeurIPS paper award
In 2020, he coauthors “No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium” with Alberto Marchesi, Gabriele Farina and Nicola Gatti. The paper gives the first uncoupled no-regret dynamics for extensive-form correlated equilibria and an efficient no-trigger-regret algorithm; NeurIPS names it an Outstanding Paper.
-
September 2021
Joining Bocconi
After earning a computer science PhD at Politecnico di Milano and completing a postdoctoral stint there, he spends one year as a postdoctoral researcher with Facebook Research’s Core Data Science team in London. In September 2021, he joins Bocconi’s Department of Decision Sciences as an assistant professor.
-
2022
Faster equilibrium learning
In 2022, he coauthors “Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria” with Ioannis Anagnostides, Gabriele Farina, Christian Kroer and Tuomas Sandholm. The paper establishes faster no-regret dynamics for extensive-form correlated equilibria in multiplayer, general-sum games with imperfect information.
-
2025
Complexity of correlated equilibria
In 2025, he coauthors “The Complexity of Correlated Equilibria in Generalized Games” with Martino Bernasconi, Matteo Castiglioni and Gabriele Farina. The paper proves that computing an approximate Φ-equilibrium in generalized games is PPAD-complete.
-
2026
Estimating feasible payoffs
In 2026, he coauthors “Optimal Rates for Feasible Payoff Set Estimation in Games” with Annalisa Barbara, Riccardo Poiani and Martino Bernasconi. The paper studies inferring feasible payoff sets from observed behavior and establishes minimax-optimal rates for exact and approximate equilibrium play in zero-sum and general-sum games.
-
As of October 2026
Assistant professor at Bocconi
As of October 2026, he is an assistant professor in Bocconi University’s Department of Computing Sciences.
Career
- Since 2021Bocconi UniversityAssistant Professor
- Until 2021Facebook Research
- 2018Carnegie Mellon University
- 2017–2021Polytechnic University of MilanPostdoctoral researcher
Education
- Polytechnic University of MilanPhD in computer science
Sources and credits
Photo: We have no published photo of Andrea Celli yet. Send us a free-licensed photo.
- Andrea Celli | Bocconi University
- Carnegie Mellon’s Electronic Marketplaces Laboratory
- NeurIPS 2020 Awards
- No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium
- A Record Addition of New Faculty Members from September
- Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria
- The Complexity of Correlated Equilibria in Generalized Games
- Optimal Rates for Feasible Payoff Set Estimation in Games



