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
A Data-Driven Approach to Refine Predictions of Differentiated Thyroid Cancer Outcomes: A Prospective Multicenter Study THE JOURNAL OF CLINICAL ENDOCRINOLOGY AND METABOLISM 2023
Pandora's Box Problem with Order Constraints MATHEMATICS OF OPERATIONS RESEARCH 2023
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria Proceedings of the 24th {ACM} Conference on Economics and Computation, {EC} 2023, London, United Kingdom, July 9-12, 2023}, pages = {67--87} 2023
Online revenue maximization for server pricing AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2022
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
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint THE JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2022
Distortion-Oblivious Algorithms for Minimizing Flow Time Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022 2022
FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection International Joint Conference on Neural Networks, {IJCNN} 2022, Padua, Italy, July 18-23, 2022 2022
Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July 2022 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

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