25 citations · 31 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Online Allocation using Few Samples
Matthew Faw, Sahil Singla, Yifan Wang
We study online allocation problems where requests over resources arrive in an adversarial order and must be served immediately and irrevocably. This framework captures bot…
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,…