18 citations · 30 across the 5 of their papers we have counts for
5 papers
Online Combinatorial Allocations and Auctions with Few Samples
Paul Dütting, Thomas Kesselheim, Brendan Lucier +2
In online combinatorial allocations/auctions, n bidders sequentially arrive, each with a combinatorial valuation (such as submodular/XOS) over subsets of m indivisible items. The a…
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…
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
Rebecca Reiffenhäuser
In the weighted bipartite matching problem, the goal is to find a maximum-weight matching in a bipartite graph with nonnegative edge weights. We consider its online version where t…
Efficient Two-Sided Markets with Limited Information
Paul Dütting, Federico Fusco, Philip Lazos +2
A celebrated impossibility result by Myerson and Satterthwaite (1983) shows that any truthful mechanism for two-sided markets that maximizes social welfare must run a deficit, resu…
Trend Detection based Regret Minimization for Bandit Problems
Paresh Nakhe, Rebecca Reiffenhäuser
We study a variation of the classical multi-armed bandits problem. In this problem, the learner has to make a sequence of decisions, picking from a fixed set of choices. In each ro…