8 citations · 13 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.GT2020★ 8 cited
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
Aranyak Mehta, Uri Nadav, Alexandros Psomas +1
We consider the fundamental problem of selecting out of random variables in a way that the expected highest or second-highest value is maximized. This question captures sev…
cs.GT2020★ 1 cited
Fair and Efficient Online Allocations with Normalized Valuations
Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan
A set of divisible resources becomes available over a sequence of rounds and needs to be allocated immediately and irrevocably. Our goal is to distribute these resources to maximiz…