Complexity of and algorithms for Borda manipulation - INRAE - Institut national de recherche pour l’agriculture, l’alimentation et l’environnement Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Complexity of and algorithms for Borda manipulation

Résumé

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.

Mots clés

Fichier principal
Vignette du fichier
Complexity of and algorithms for Borda manipulation_GK_1.pdf (197.27 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02746213 , version 1 (03-06-2020)

Identifiants

  • HAL Id : hal-02746213 , version 1
  • PRODINRA : 164609

Citer

Jessica Davies, Georgios Katsirelos, Nina Narodytska, Toby Walsh. Complexity of and algorithms for Borda manipulation. Twenty-fifth Conference on Artificial Intelligence, AAAI 2011, Association for the Advancement of Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI). Labo/service de l'auteur, USA., Nov 2011, San Francisco, California, United States. ⟨hal-02746213⟩
9 Consultations
10 Téléchargements

Partager

Gmail Facebook X LinkedIn More