Stefano Leonardi
Professore Ordinario
E-mail:
| Titolo | Pubblicato in | Anno |
|---|---|---|
| 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 |
| FUN editorial | THEORETICAL COMPUTER SCIENCE | 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 |
| Stochastic graph exploration | 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) | 2019 |
| Algorithms for fair team formation in online labour marketplaces | WWW '19: Companion Proceedings of The 2019 World Wide Web Conference | 2019 |
| (1 + ε)-approximate incremental matching in constant deterministic amortized time | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2019 |
| A mazing 2+ε approximation for unsplittable flow on a path | ACM TRANSACTIONS ON ALGORITHMS | 2018 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma