2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.GT2014★ 2 cited
A Near-Optimal Mechanism for Impartial Selection
Nicolas Bousquet, Sergey Norin, Adrian Vetta
We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently…
cs.GT2012★ 2 cited
On the Implications of Lookahead Search in Game Playing
Vahab Mirrokni, Nithum Thain, Adrian Vetta
Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical…