4 citations · 5 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Optimal Online Stochastic Matching
Paul Duetting, Michal Feldman, Mathieu Molina
We resolve the problem of unweighted online stochastic matching with a known arrival law by establishing its optimal competitive ratio. For Poisson arrivals, we achieve $1-e/e^e\ap…
cs.DS2024★ 1 cited
Prophet Inequalities: Competing with the Top Items is Easy
Mathieu Molina, Nicolas Gast, Patrick Loiseau +1
We explore a prophet inequality problem, where the values of a sequence of items are drawn i.i.d. from some distribution, and an online decision maker must select one item irrevoca…