Folgen
Federico Fusco
Federico Fusco
Sapienza University of Rome
Bestätigte E-Mail-Adresse bei diag.uniroma1.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
G Amanatidis, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
Advances in Neural Information Processing Systems 33, 2020
462020
Data of patients undergoing rehabilitation programs
R Seccia, M Boresta, F Fusco, E Tronci, E Di Gemma, L Palagi, ...
Data in brief 30, 105419, 2020
382020
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
C Caramanis, P Dütting, M Faw, F Fusco, P Lazos, S Leonardi, ...
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
352022
Pandora's Box Problem with Order Constraints
S Boodaghians, F Fusco, P Lazos, S Leonardi
Proceedings of the 21st ACM Conference on Economics and Computation, 439-458, 2020
352020
Efficient two-sided markets with limited information
P Dütting, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
332021
A regret analysis of bilateral trade
N Cesa-Bianchi, TR Cesari, R Colomboni, F Fusco, S Leonardi
Proceedings of the 22nd ACM Conference on Economics and Computation, 289-309, 2021
262021
Bilateral trade: A regret minimization perspective
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
Mathematics of Operations Research 49 (1), 171-203, 2024
242024
Repeated Bilateral Trade Against a Smoothed Adversary
N Cesa-Bianchi, TR Cesari, R Colomboni, F Fusco, S Leonardi
The Thirty Sixth Annual Conference on Learning Theory, 1095-1130, 2023
192023
Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness
G Amanatidis, G Birmpas, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
Mathematics of Operations Research 49 (4), 2425-2445, 2024
182024
Deletion robust submodular maximization over matroids
P Dütting, F Fusco, S Lattanzi, A Norouzi-Fard, M Zadimoghaddam
International Conference on Machine Learning, 5671-5693, 2022
172022
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
G Amanatidis, F Fusco, P Lazos, S Leonardi, A Marchetti-Spaccamela, ...
International Conference on Machine Learning, 231-242, 2021
172021
Fully dynamic submodular maximization over matroids
P Dütting, F Fusco, S Lattanzi, A Norouzi-Fard, M Zadimoghaddam
International Conference on Machine Learning, 8821-8835, 2023
152023
An -regret analysis of Adversarial Bilateral Trade
Y Azar, A Fiat, F Fusco
Advances in Neural Information Processing Systems 35, 1685--1697, 2022
152022
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
E Esposito, F Fusco, D van der Hoeven, N Cesa-Bianchi
Advances in Neural Information Processing Systems 35, 34776--34788, 2022
152022
Beyond Bandit Feedback in Online Multiclass Classification
D van der Hoeven, F Fusco, N Cesa-Bianchi
Advances in Neural Information Processing Systems 34, 13280-13291, 2021
132021
No-regret learning in bilateral trade via global budget balance
M Bernasconi, M Castiglioni, A Celli, F Fusco
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 247-258, 2024
112024
The role of transparency in repeated first-price auctions with unknown valuations
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 225-236, 2024
112024
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
G Amanatidis, F Fusco, P Lazos, S Leonardi, R Reiffenhäuser
Journal of Artificial Intelligence Research 74, 661-690, 2022
102022
Bandits with Replenishable Knapsacks: the Best of both Worlds
M Bernasconi, M Castiglioni, A Celli, F Fusco
arXiv preprint arXiv:2306.08470, 2023
92023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
M El Halabi, F Fusco, A Norouzi-Fard, J Tardos, J Tarnawski
International Conference on Machine Learning, 9150-9171, 2023
72023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20