| Titolo | Pubblicato in | Anno |
|---|---|---|
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness | MATHEMATICS OF OPERATIONS RESEARCH | 2024 |
| Truthful Matching with Online Items and Offline Agents | 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) | 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 |
| 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 |
| 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 |
| An Optimal Truthful Mechanism for the Online Weighted bipartite Matching Problem | Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms | 2019 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
