11 citations · 48 across the 34 of their papers we have counts for
4 papers · 1 filter
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs
Paul Dütting, Michal Feldman, Thomas Kesselheim +1
We present a general framework for stochastic online maximization problems with combinatorial feasibility constraints. The framework establishes prophet inequalities by constructin…
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Thomas Kesselheim, Andreas Tönnis
We study various generalizations of the secretary problem with submodular objective functions. Generally, a set of requests is revealed step-by-step to an algorithm in random order…
Best-Response Dynamics in Combinatorial Auctions with Item Bidding
Paul Dütting, Thomas Kesselheim
In a combinatorial auction with item bidding, agents participate in multiple single-item second-price auctions at once. As some items might be substitutes, agents need to strategiz…
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
Thomas Kesselheim, Andreas Tönnis
The \emph{Temp Secretary Problem} was recently introduced by Fiat et al. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. W…