Stefano Leonardi


Titolo Pubblicato in Anno
Bilateral Trade: A Regret Minimization Perspective MATHEMATICS OF OPERATIONS RESEARCH 2023
Deep active learning for misinformation detection using geometric deep learning ONLINE SOCIAL NETWORKS AND MEDIA 2023
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2022
Single-Sample Prophet Inequalities via Greedy-Ordered Selection Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022
Algorithms for fair k-clustering with multiple protected attributes OPERATIONS RESEARCH LETTERS 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity Proceedings of the 38th International Conference on Machine Learning 2021
Efficient two-sided markets with limited information STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing 2021
Stochastic bandits for multi-platform budget optimization in online advertising The Web Conference 2021 - Proceedings of the World Wide Web Conference, WWW 2021 2021
Flow time scheduling with uncertain processing time STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing 2021
A Regret Analysis of Bilateral Trade Proceedings of the 22nd {ACM} Conference on Economics and Computation 2021
Approximately Efficient Two-Sided Combinatorial Auctions ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2020
Online revenue maximization for server pricing Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence Main track 2020
Pandora's Box problem with order constraints EC '20: Proceedings of the 21st ACM Conference on Economics and Computation 2020
Prior-free multi-unit auctions with ordered bidders THEORETICAL COMPUTER SCIENCE 2020
Budget Feasible Mechanisms on Matroids ALGORITHMICA 2020
Envy, Regret, and Social Welfare Loss The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Designing Cost-Sharing Methods for Bayesian Games THEORY OF COMPUTING SYSTEMS 2019
Preface 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 2019

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma