Complexity of and Algorithms for Borda Manipulation

Abstract : We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin packing and multiprocessor scheduling, we propose two new approximation methods to compute manipulations of the Borda rule. Experiments show that these methods significantly outperform the previous best known approximation method. We are able to find optimal manipulations in almost all the randomly generated elections tested. Our results suggest that, whilst computing a manipulation of the Borda rule by a coalition is NP-hard, computational complexity may provide only a weak barrier against manipulation in practice.
Type de document :
Communication dans un congrès
AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, Aug 2011, San-Francisco, United States. 2011
Liste complète des métadonnées

https://hal.inria.fr/hal-00642093
Contributeur : Laurent Simon <>
Soumis le : jeudi 17 novembre 2011 - 12:00:25
Dernière modification le : jeudi 17 novembre 2011 - 12:00:25

Identifiants

  • HAL Id : hal-00642093, version 1

Citation

George Katsirelos, Toby Walsh, Jessica Davies, Nina Narodytska. Complexity of and Algorithms for Borda Manipulation. AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, Aug 2011, San-Francisco, United States. 2011. 〈hal-00642093〉

Partager

Métriques

Consultations de la notice

148