77 citations · 367 across the 40 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.GT2009★ 29 cited
Sum of Us: Strategyproof Selection from the Selectors
Noga Alon, Felix Fischer, Ariel D. Procaccia +1
We consider directed graphs over a set of n agents, where an edge (i,j) is taken to mean that agent i supports or trusts agent j. Given such a graph and an integer k\leq n, we wish…
cs.GT2009★ 25 cited
Strategyproof Approximation Mechanisms for Location on Networks
Noga Alon, Michal Feldman, Ariel D. Procaccia +1
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent…