40 citations · 78 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training
Goran Zuzic, Di Wang, Aranyak Mehta +1
We address the challenge of finding algorithms for online allocation (i.e. bipartite matching) using a machine learning approach. In this paper, we focus on the AdWords problem, wh…
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
Zhe Feng, Guru Guruganesh, Christopher Liaw +2
The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produ…