Biography & Research Overview
Stefano Leonardi is Full Professor of Computer Science at the Department of Computer, Control, and Management Engineering “Antonio Ruberti” (DIAG), Sapienza University of Rome, where he leads the Algorithms and Data Science Research Group. His research spans the theoretical and practical foundations of Online and Approximation Algorithms, Online Learning, Algorithmic Game Theory, Mechanism Design, and Economics & Computation.
Department of Computer, Control, and Management Engineering "Antonio Ruberti" (DIAG)
Via Ariosto 25, Room B205, 00185 Roma, Italy
Honors & Peer Recognitions
-
2025
Fellow of the Accademia dei Lincei
Italian National Academy of Sciences
-
2025
Fellow of the ACM
Association for Computing Machinery
-
2018
Fellow of the EATCS
European Association for Theoretical Computer Science
Major Funded Grants
-
2018–2024
ERC Advanced Research Grant AMDROMA
Algorithmic and Mechanism Design Research in Online Markets (Principal Investigator)
AMDROMA ERC Project Website -
2023–2025
MIUR PRIN Project: Learning in Markets and Society
Leader of the Sapienza University Research Node
-
2022–2025
PNRR SoBigData.it
Strengthening the Italian Infrastructure for Social Mining & Big Data (Sapienza Node Leader)
Top 10 Most Recent Journal Publications
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
SIAM Journal on Computing, 55(5), 903–938, 2026.
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser
Theory of Computing, forthcoming, 2026.
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, Seeun William Umboh
Algorithmica, 88(3), Article 43, 2026.
Efficient Two-Sided Markets with Limited Information
Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
SIAM Journal on Computing, 55(1), 65–92, 2026.
Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-Optimal Adaptive Complexity
Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser
Theoretical Computer Science, 1060, Article 115629, 2026.
Fair Division with Interdependent Values
Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo
Theoretical Computer Science, 1076, Article 115969, 2026.
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Mathematics of Operations Research, 50(4), 2717–2737, 2025.
Prophet Inequalities via the Expected Competitive Ratio
Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis
ACM Transactions on Economics and Computation, 13(2), Article 7, 1–32, 2025.
Fair Projections as a Means toward Balanced Recommendations
Aris Anagnostopoulos, Luca Becchetti, Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn
ACM Transactions on Intelligent Systems and Technology, 16(1), Article 3, 1–32, 2025.
Regret Analysis of Bilateral Trade with a Smoothed Adversary
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Journal of Machine Learning Research, 25, Article 234, 1–36, 2024.
Top 10 Most Recent Conference Proceedings
Contextual Online Bilateral Trade
Romain Cosson, Federico Fusco, Anupam Gupta, Stefano Leonardi, Renato Paes Leme, Matteo Russo
Proceedings of the ACM Conference on Economics and Computation (EC 2026), 2026.
Online Convex Optimization with Sublinear Noisy Probes
Simone Di Gregorio, Anupam Gupta, Stefano Leonardi, Matteo Russo
Proceedings of the Thirty-Ninth Conference on Learning Theory (COLT), PMLR, vol. 336, pp. 1938–1962, 2026.
Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
Riccardo Colini Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schäfer, Artem Tsikiridis
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1795–1823, 2026.
Contract Design Beyond Hidden-Actions
Tomer Ezra, Stefano Leonardi, Matteo Russo
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2113–2133, 2026.
Multicalibration Yields Better Matchings
Riccardo Colini Baldeschi, Simone Di Gregorio, Simone Fioravanti, Federico Fusco, Ido Guy, Daniel Haimovich, Stefano Leonardi, Fridolin Linder, Lorenzo Perini, Matteo Russo, Cem Sirin, Niek Tax
Proceedings of the 43rd International Conference on Machine Learning (ICML), PMLR, vol. 306, pp. 21230–21240, 2026.
Online Learning in the Random-Order Model
Martino Bernasconi, Andrea Celli, Riccardo Colini Baldeschi, Federico Fusco, Stefano Leonardi, Matteo Russo
Proceedings of the 42nd International Conference on Machine Learning (ICML), PMLR, vol. 267, pp. 3899–3919, 2025.
QPP-RA: Aggregating Large Language Model Rankings
Filippo Betello, Matteo Russo, Paul Dütting, Stefano Leonardi, Fabrizio Silvestri
Proceedings of the 2025 International ACM SIGIR Conference on Innovative Concepts and Theories in Information Retrieval (ICTIR), pp. 103–114, 2025.
Algorithmically Fair Maximization of Multiple Submodular Objective Functions
Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2025), pp. 115–123, 2025.
Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, Seeun William Umboh
Approximation, Randomization, and Combinatorial Optimization (APPROX/RANDOM 2024), LIPIcs, vol. 317, pp. 12:1–12:24, 2024.
Online Learning with Sublinear Best-Action Queries
Matteo Russo, Andrea Celli, Riccardo Colini Baldeschi, Federico Fusco, Daniel Haimovich, Dima Karamshuk, Stefano Leonardi, Niek Tax
Advances in Neural Information Processing Systems 37 (NeurIPS 2024), pp. 40407–40433, 2024.
Major Conference Leadership
- EC 2026: General Chair, 27th ACM Conference on Economics and Computation, Rome.
- STOC 2022: General Chair, 54th ACM Symposium on Theory of Computing, Rome.
- WWW 2015: General Co-Chair, 24th International World Wide Web Conference, Florence.
PhD Students Supervision Total: 14
Current PhD Students
Algorithmic mechanism design through deep learning
Learning and probabilistic chaining in algorithmic game theory
Online computation & pricing in markets (co-supervised with P. Sankowski)
Graduated PhD Alumni
Learning and optimization in mechanism design
Now: Postdoctoral Researcher at EPFL, Lausanne
Online learning & submodular optimization for pricing
Now: Assistant Professor at Sapienza University of Rome
Machine learning methods for precision medicine
Now: Postdoctoral Researcher at Harvard University
Data science & web algorithms
Now: Researcher at IMI Sanpaolo, Torino
Algorithmic mechanism design
Now: Professor at Technical University of Warsaw
Auction design & online advertising
Now: Researcher at Meta Central Applied Science, London
Web mining & information retrieval
Now: Researcher at National Research Council (CNR)
Web search algorithms (co-supervised with R. Baeza-Yates)
Now: Senior Researcher at Unicredit Research
Graph mining & web characterization
Now: VP, Data, AI & Analytics at Ancestry, USA
Approximation & game theory (co-supervised with K. Mehlhorn)
Now: Senior Researcher at CWI / Prof at VU Amsterdam
Distributed systems & wireless networks (co-supervised with A. Marchetti-Spaccamela)
Now: Professor at Sapienza University of Rome
Postdoctoral Researchers & Scholars Total: 22
Current Postdoctoral Fellows
PhD London School of Economics (Economics & Computation)
PhD Gran Sasso Science Institute (Algorithm Design)
Postdoctoral Alumni
Now: Software Engineer / Researcher at Google Inc.
Academic Teaching — A.Y. 2025/2026
Department of Computer, Control, and Management Engineering "Antonio Ruberti" (DIAG)
Office Hours (Ricevimento):
By email appointment at Via Ariosto 25, Room B205 (leonardi@diag.uniroma1.it)
Economics and Computation
Target Programs: Master's Degree in Data Science / Computer Science Engineering / Management Engineering / Artificial Intelligence and Robotics
Wed 12:00 – 15:00
Dr. Johannes Brüstle
Foundational concepts of game theory, strategies, and computational economic modeling.
Single Item Auctions, Multi-parameter Mechanism Design, Revenue Maximizing Auctions, Sponsored Search Auctions, Spectrum Auctions.
Walrasian Equilibria, Stable Matching, Kidney Exchange, House Allocation mechanisms.
Games and solution concepts, Congestion Games, Selfish Routing, Price of Anarchy, Potential Games.
Voting systems, rank aggregation, fair division protocols.
Secretary Problems, Prophet Inequalities under online constraints.
Learning Equilibria in Games, Experts algorithms, Multi-Armed Bandits, Learning dynamics in digital markets.
Material & References:
[1] Classroom site for Slides and Lecture Notes.
[2] Tim Roughgarden, Twenty Lectures on Algorithmic Game Theory, Cambridge University Press (DOI: 10.1017/CBO9781316779309).
Algorithm Design
Target Program: Master's Degree in Engineering of Computer Science
Room 41, San Pietro in Vincoli
Thu: 12:00 – 14:00
Code: pxamzsy
Exam Rules & Modalities:
1) Partial Exams (Advised): Two partial exams held in April and May.
2) Traditional Written Exam & Oral: For students who fail or do not submit partials, answering questions on the remaining program during regular written sessions.
Main Textbook: [1] J. Kleinberg, E. Tardos, Algorithm Design, Addison Wesley, 2005. (Web Resources)
References: [2] Cormen et al., Introduction to Algorithms (3rd ed.); [3] Williamson & Shmoys, Design of Approximation Algorithms; [4] Vijay Vazirani, Approximation Algorithms.
Logica e Metodi Probabilistici per l'Informatica
Target Program: Laurea del Primo Livello in Scienze Matematiche per l'Intelligenza Artificiale (II Semestre)
Wed: 15:00 – 17:00 (Aula Picone)
Sez 2: Prof. Stefano Leonardi
Tutor: Simone Di Gregorio
1. Algoritmi e probabilità
[Ref. 1, Capp. 1, 2]Probabilità, Eventi, Variabili Aleatorie (Binomiale e Geometrica); Analisi di algoritmi probabilistici con/senza memoria, Coupon Collector, Selezione k-esimo elemento minimo, Quicksort randomizzato, Karger Min-Cut.
2. Metodi di campionamento e allocazione probabilistica
[Ref. 1, Cap. 3, 4.1-4.2, 10.1-10.2, 5.1-5.2]Momenti e Deviazione, Funzioni generatrici, Chernoff-Hoeffding bounds, Metodo Monte Carlo, Campionamento imparziale, Balls in Bins, Counting triangles, VC dimension, Random projections.
3. Processi stocastici ed applicazioni
[Ref. 1, Capp. 7.1-7.4]Catene di Markov e convergenza, Random walks ed algoritmo PageRank, Random walks per 2-SAT, Random Walks su grafi non orientati.
Materiale Didattico: Esercizi e materiale disponibili sul sito Piazza del corso.
Riferimenti: [1] M. Mitzenmacher, E. Upfal, Probability and Computing, Cambridge University Press; [2] S. Dasgupta, C.H. Papadimitriou, U.V. Vazirani, Algorithms, McGraw Hill.