3 papers
cs.DS2024
Interval-Constrained Bipartite Matching over Time
Andreas Abels, Mariia Anapolska, Christina Büsing
Interval-constrained online bipartite matching problem frequently occurs in medical appointment scheduling: Unit-time jobs representing patients arrive online and are assigned to a…
cs.DS2022
Prophet Inequalities over Time
Andreas Abels, Elias Pitschmann, Daniel Schmand
In this paper, we introduce an over-time variant of the well-known prophet inequality with i.i.d. random variables. Instead of stopping with one realized value at some point in the…
cs.DS2022
Knapsack Secretary Through Boosting
Andreas Abels, Leon Ladewig, Kevin Schewior +1
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have different sizes and multiple items m…