| Titolo | Pubblicato in | Anno |
|---|---|---|
| Truthful Matching with Online Items and Offline Agents | ALGORITHMICA | 2024 |
| Bilateral Trade: A Regret Minimization Perspective | MATHEMATICS OF OPERATIONS RESEARCH | 2023 |
| Pandora's Box Problem with Order Constraints | MATHEMATICS OF OPERATIONS RESEARCH | 2023 |
| Truthful Matching with Online Items and Offline Agents | 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) | 2023 |
| Pandora's Problem with Combinatorial Cost | EC '23: Proceedings of the 24th ACM Conference on Economics and Computation | 2023 |
| Fully Dynamic Submodular Maximization over Matroids | Volume 202: International Conference on Machine Learning, 23-29 July 2023, Honolulu, Hawaii, USA | 2023 |
| Fairness in Streaming Submodular Maximization over a Matroid Constraint | Proceedings of Machine Learning Research | 2023 |
| Repeated Bilateral Trade Against a Smoothed Adversary | Proceedings of Machine Learning Research | 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 |
| An α-regret analysis of Adversarial Bilateral Trade | Advances in Neural Information Processing Systems 35 (NeurIPS 2022) | 2022 |
| Deletion Robust Submodular Maximization over Matroids | Proceedings of Machine Learning Research | 2022 |
| Learning on the Edge: Online Learning with Stochastic Feedback Graphs | Advances in neural Information processing systems | 2022 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint | THE JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH | 2022 |
| 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 |
| A Regret Analysis of Bilateral Trade | Proceedings of the 22nd {ACM} Conference on Economics and Computation | 2021 |
| Beyond Bandit Feedback in Online Multiclass Classification | Advances in neural Information processing systems | 2021 |
| Data of patients undergoing rehabilitation programs | DATA IN BRIEF | 2020 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
