4 citations · 6 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 4 cited
Robust Algorithms for the Secretary Problem
Domagoj Bradac, Anupam Gupta, Sahil Singla +1
In classical secretary problems, a sequence of elements arrive in a uniformly random order, and we want to choose a single item, or a set of size . The random order model al…
cs.DS2019
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
Domagoj Bradac, Sahil Singla, Goran Zuzic
Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge exists, we need to perform an expensive test, in which ca…