activity
20202026
most citedSingle-Sample Prophet Inequalities via Greedy-Ordered Selection

25 citations · 121 across the 26 of their papers we have counts for

collaborators
Showing 2021Show all

7 papers · 1 filter

cs.DS2021★ 25 cited

Single-Sample Prophet Inequalities via Greedy-Ordered Selection

Constantine Caramanis, Paul Dütting, Matthew Faw +6

We study single-sample prophet inequalities (SSPIs), i.e., prophet inequalities where only a single sample from each prior distribution is available. Besides a direct, and optimal,…

cs.GT2021

Bilateral Trade: A Regret Minimization Perspective

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they h…

cs.GT2021★ 5 cited

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

Georgios Amanatidis, Georgios Birmpas, Federico Fusco +3

We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefo…

cs.LG2021★ 1 cited

Beyond Bandit Feedback in Online Multiclass Classification

Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi

We study the problem of online multiclass classification in a setting where the learner's feedback is determined by an arbitrary directed graph. While including bandit feedback as…

cs.DS2021

Prophet Inequalities for Matching with a Single Sample

Paul Dütting, Federico Fusco, Philip Lazos +2

We consider the prophet inequality problem for (not necessarily bipartite) matching problems with independent edge values, under both edge arrivals and vertex arrivals. We show con…

cs.LG2021★ 8 cited

A Regret Analysis of Bilateral Trade

Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they h…

cs.DS2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

Georgios Amanatidis, Federico Fusco, Philip Lazos +3

Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances moti…