| Titolo | Pubblicato in | Anno |
|---|---|---|
| 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 |
| 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 |
| 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 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
