Federico Fusco

Orcid: 0000-0001-6250-945X

According to our database1, Federico Fusco authored at least 32 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Truthful Matching with Online Items and Offline Agents.
Algorithmica, May, 2024

Bilateral Trade: A Regret Minimization Perspective.
Math. Oper. Res., 2024

Regret Analysis of Bilateral Trade with a Smoothed Adversary.
J. Mach. Learn. Res., 2024

Online Learning with Sublinear Best-Action Queries.
CoRR, 2024

Pandora's Box Problem Over Time.
CoRR, 2024

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints.
CoRR, 2024

An α-regret analysis of adversarial bilateral trade.
Artif. Intell., 2024

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

No-Regret Learning in Bilateral Trade via Global Budget Balance.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Selling Joint Ads: A Regret Minimization Perspective.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Consistent Submodular Maximization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Bandits with Replenishable Knapsacks: the Best of both Worlds.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Pandora's Problem with Deadlines.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Pandora's Box Problem with Order Constraints.
Math. Oper. Res., February, 2023

Pandora's Problem with Combinatorial Cost.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Fairness in Streaming Submodular Maximization over a Matroid Constraint.
Proceedings of the International Conference on Machine Learning, 2023

Fully Dynamic Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2023

Truthful Matching with Online Items and Offline Agents.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Repeated Bilateral Trade Against a Smoothed Adversary.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
J. Artif. Intell. Res., 2022

Deletion Robust Non-Monotone Submodular Maximization over Matroids.
CoRR, 2022

Online revenue maximization for server pricing.
Auton. Agents Multi Agent Syst., 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Learning on the Edge: Online Learning with Stochastic Feedback Graphs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

An $\alpha$-regret analysis of Adversarial Bilateral Trade.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Deletion Robust Submodular Maximization over Matroids.
Proceedings of the International Conference on Machine Learning, 2022

2021
Prophet Inequalities for Matching with a Single Sample.
CoRR, 2021

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Efficient two-sided markets with limited information.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Regret Analysis of Bilateral Trade.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Beyond Bandit Feedback in Online Multiclass Classification.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 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


  Loading...