default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Fusco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Yossi Azar, Amos Fiat, Federico Fusco:
An α-regret analysis of adversarial bilateral trade. Artif. Intell. 337: 104231 (2024)- [j6]Michal Feldman, Federico Fusco
, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. Algorithmica 86(5): 1600-1622 (2024) - [j5]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Regret Analysis of Bilateral Trade with a Smoothed Adversary. J. Mach. Learn. Res. 25: 234:1-234:36 (2024) - [j4]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. Math. Oper. Res. 49(1): 171-203 (2024) - 2023
- [j3]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. Math. Oper. Res. 48(1): 498-519 (2023) - 2022
- [j2]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online revenue maximization for server pricing. Auton. Agents Multi Agent Syst. 36(1): 11 (2022) - [j1]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. J. Artif. Intell. Res. 74: 661-690 (2022)
Conference and Workshop Papers
- 2024
- [c22]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Deadlines. AAAI 2024: 20337-20343 - [c21]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. ICLR 2024 - [c20]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. ICML 2024 - [c19]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. STOC 2024: 225-236 - [c18]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
No-Regret Learning in Bilateral Trade via Global Budget Balance. STOC 2024: 247-258 - 2023
- [c17]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - [c16]Michal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. ICALP 2023: 58:1-58:20 - [c15]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. ICML 2023: 8821-8835 - [c14]Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. ICML 2023: 9150-9171 - [c13]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Combinatorial Cost. EC 2023: 273-292 - 2022
- [c12]Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. ICML 2022: 5671-5693 - [c11]Yossi Azar, Amos Fiat, Federico Fusco:
An $\alpha$-regret analysis of Adversarial Bilateral Trade. NeurIPS 2022 - [c10]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. NeurIPS 2022 - [c9]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - 2021
- [c8]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ICML 2021: 231-242 - [c7]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. NeurIPS 2021: 13280-13291 - [c6]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. EC 2021: 289-309 - [c5]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient two-sided markets with limited information. STOC 2021: 1452-1465 - [c4]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. WINE 2021: 149-166 - 2020
- [c3]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. IJCAI 2020: 4106-4112 - [c2]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. NeurIPS 2020 - [c1]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. EC 2020: 439-458
Informal and Other Publications
- 2024
- [i28]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints. CoRR abs/2405.16118 (2024) - [i27]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Consistent Submodular Maximization. CoRR abs/2405.19977 (2024) - [i26]Georgios Amanatidis, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis:
Pandora's Box Problem Over Time. CoRR abs/2407.15261 (2024) - [i25]Matteo Russo, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco, Daniel Haimovich, Dima Karamshuk, Stefano Leonardi, Niek Tax:
Online Learning with Sublinear Best-Action Queries. CoRR abs/2407.16355 (2024) - [i24]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Paul Dütting, Federico Fusco:
Selling Joint Ads: A Regret Minimization Perspective. CoRR abs/2409.07819 (2024) - 2023
- [i23]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - [i22]Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco:
Pandora's Problem with Combinatorial Cost. CoRR abs/2303.01078 (2023) - [i21]Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski:
Fairness in Streaming Submodular Maximization over a Matroid Constraint. CoRR abs/2305.15118 (2023) - [i20]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. CoRR abs/2305.19918 (2023) - [i19]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
Bandits with Replenishable Knapsacks: the Best of both Worlds. CoRR abs/2306.08470 (2023) - [i18]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. CoRR abs/2307.09478 (2023) - [i17]Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco:
No-Regret Learning in Bilateral Trade via Global Budget Balance. CoRR abs/2310.12370 (2023) - 2022
- [i16]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Submodular Maximization over Matroids. CoRR abs/2201.13128 (2022) - [i15]Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR abs/2208.07582 (2022) - [i14]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. CoRR abs/2210.04229 (2022) - [i13]Yossi Azar, Amos Fiat, Federico Fusco:
An α-regret analysis of Adversarial Bilateral Trade. CoRR abs/2210.06846 (2022) - [i12]Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. CoRR abs/2211.02004 (2022) - 2021
- [i11]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser:
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. CoRR abs/2102.08327 (2021) - [i10]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. CoRR abs/2102.08754 (2021) - [i9]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Prophet Inequalities for Matching with a Single Sample. CoRR abs/2104.02050 (2021) - [i8]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. CoRR abs/2106.03596 (2021) - [i7]Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness. CoRR abs/2109.08644 (2021) - [i6]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. CoRR abs/2109.12974 (2021) - [i5]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - 2020
- [i4]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. CoRR abs/2002.06968 (2020) - [i3]Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Efficient Two-Sided Markets with Limited Information. CoRR abs/2003.07503 (2020) - [i2]Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser:
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2007.05014 (2020) - 2019
- [i1]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. CoRR abs/1906.09880 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
