Uri Nadav

Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics

We consider the fundamental problem of selecting $k$ out of $n$ random variables in a way that the expected highest or second-highest value is maximized. This question captures several applications where we have uncertainty about the quality of candidates (e.g. auction bids, search results) and have…