8 citations · 34 across the 7 of their papers we have counts for
Showing cs.GTShow 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.GT2014★ 6 cited
Computational Complexity of Approximate Nash Equilibrium in Large Games
Aviad Rubinstein
We prove that finding an epsilon-Nash equilibrium in a succinctly representable game with many players is PPAD-hard for constant epsilon. Our proof uses succinct games, i.e. games…