By topic
Repeated Bilateral Trade Problem
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, FF, Stefano Leonardi: "Repeated Bilateral Trade Against a Smoothed Adversary". COLT, 2023. [arXiv] [Proceedings]
Yossi Azar, Amos Fiat, FF: "An α-regret Analysis of Adversarial Bilateral Trade". NeurIPS, 2022. [arXiv] [Proceedings] [NeurIPS talk]
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, FF, Stefano Leonardi: "A Regret Analysis of Bilateral Trade". EC, 2021. [arXiv] [Proceedings][EC talk] [Google TechTalks] [Journal version MOR 2024]
Submodular Maximization
Paul Duetting, FF, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam: "Fully Dynamic Submodular Maximization over Matroids". ICML, 2023. [arXiv] [Proceedings]
Marwa El Halabi, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski, FF: "Fairness in Streaming Submodular Maximization over a Matroid Constraint". ICML, 2023. [arXiv] [Proceedings]
Paul Duetting, FF, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam: "Deletion Robust Submodular Maximization over Matroids". ICML, 2022 (long presentation: top 2% of the submissions). [arXiv] [Proceedings] [ICML talk]
Georgios Amanatidis, FF, 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 (Spotlight), 2021. [arXiv] [Proceedings] [ICML talk]
Georgios Amanatidis, FF, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser: "Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint". NeurIPS, 2020. [arXiv] [Proceedings] [NeurIPS talk] [Journal version JAIR 2022]
Online Learning
Martino Bernasconi, Matteo Castiglioni, Andrea Celli, FF: "Bandits with Replenishable Knapsacks: the Best of both Worlds". ICLR, 24 [arXiv] [Proceedings]
Emmanuel Esposito, FF, Dirk van der Hoeven, Nicolò Cesa-Bianchi: "Learning on the Edge: Online Learning with Stochastic Feedback Graphs". NeurIPS, 2022. [arXiv] [Proceedings] [NeurIPS talk by Emmanuel]
Dirk van der Hoeven, FF, Nicolò Cesa-Bianchi: "Beyond Bandit Feedback in Online Multiclass Classification". NeurIPS, 2021. [arXiv] [Proceedings] [NeurIPS talk by Dirk]
Pandora's Problem
Ben Berger, Tomer Ezra, Michal Feldman, FF: "Pandora's Problem with Deadlines". AAAI, 24. [Proceedings]
Ben Berger, Tomer Ezra, Michal Feldman, FF: "Pandora's Problem with Combinatorial Cost". EC, 2023. [arXiv] [Proceedings]
Shant Boodaghians, FF, Philip Lazos, Stefano Leonardi: "Pandora's Box Problem with Order Constraints". EC, 2020. [arXiv] [Proceedings] [Lightning talk] [EC talk] [Journal version MOR]
Algorithmic Game Theory
Michal Feldman, FF, Simon Mauras, Rebecca Reiffenhäuser: "Truthful Matching with Online Items and Offline Agents". ICALP'23. [arXiv] [Proceedings] [Journal version ALGORITHMICA 2024]
Constantine Caramanis, Paul Duetting, Matthew Faw, FF, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhauser: "Single Sample Prophet Inequalities via Greedy-Ordered Selection". SODA 2022. [arXiv] [Proceedings]. Previous version [arXiv]
Georgios Amanatidis, Georgios Birmpas, FF, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser: "Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness". WINE, 2021. Best paper award! [arXiv] [Proceedings] [Rebecca's talk] [Journal version MOR 2023]
Paul Dütting, FF, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser: "Efficient Two-Sided Markets with Limited Information". STOC, 2021. [arXiv] [Proceedings] [Rebecca's STOC talk]
Shant Boodaghians, FF, Stefano Leonardi, Yishay Mansour, Ruta Mehta. "Online Revenue Maximization for Server Pricing". IJCAI, 2020. [arXiv] [Proceedings] [Journal version JAAMAS 2022]