On the Computational Hardness of Manipulating Pairwise Voting Rules.

Rohit Vaish Neeldhara Misra Shivani Agarwal Avrim Blum

Published in: AAMAS (2016)

Keyphrases

pairwise
scoring rules
np hardness
np hard
similarity measure
markov random field
computationally hard
computational complexity
mathematical programming
pairwise comparisons
computational social choice
multi agent systems
worst case