29 citations · 29 across the 3 of their papers we have counts for
3 papers
cs.GT2010
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type
Edith Elkind, Piotr Faliszewski, Arkadii Slinko
The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social ch…
cs.GT2010★ 29 cited
Approximation Algorithms for Campaign Management
Edith Elkind, Piotr Faliszewski
We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The…
cs.GT2010
Equilibria of Plurality Voting with Abstentions
Yvo Desmedt, Edith Elkind
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the r…