Skip to Main content Skip to Navigation

Vers des modes de scrutin moins manipulables

François Durand 1, 2 
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : We investigate the coalitional manipulation of voting systems: is there a subset of voters who, by producing an insincere ballot, can secure an outcome that they strictly prefer to the candidate who wins if all voters provide a sincere ballot? From a theoretical point of view, we develop a framework that allows us to study all kinds of voting systems: ballots can be linear orders of preferences over the candidates (ordinal systems), grades or approval values (cardinal systems) or even more general objects. We prove that for almost all voting systems from literature and real life, manipulability can be strictly diminished by adding a preliminary test that elects the Condorcet winner if one exists. Then we define the notion of decomposable culture and prove that it is met, in particular, when voters are independent. Under this assumption, we prove that for any voting system, there exists a voting system that is ordinal, has some common properties with the original voting system and is at most as manipulable. As a consequence of these theoretical results, when searching for a voting system whose manipulability is minimal (in a class of reasonable systems), investigation can be restricted to those that are ordinal and meet the Condorcet criterion.In order to provide a tool to investigate these questions in practice, we present SVVAMP, a Python package we designed to study voting systems and their manipulability. We use it to compare the coalitional manipulability of several voting systems in a variety of cultures, i.e. probabilistic models generating populations of voters with random preferences. Then we perform the same kind of analysis on real elections. Lastly, we determine voting systems with minimal manipulability for very small values of the number of voters and the number of candidates and we compare them with classical voting systems from literature and real life. Generally speaking, we show that the Borda count, Range voting and Approval voting are especially vulnerable to manipulation. In contrast, we find an excellent resilience to manipulation for the voting system called IRV (also known as STV) and its variant Condorcet-IRV.
Document type :
Complete list of metadata

Cited literature [188 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Monday, July 11, 2016 - 10:58:09 AM
Last modification on : Tuesday, August 2, 2022 - 4:17:03 AM
Long-term archiving on: : Wednesday, October 12, 2016 - 11:40:15 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01242440, version 2


François Durand. Vers des modes de scrutin moins manipulables. Modélisation et simulation. Université Pierre et Marie Curie - Paris VI, 2015. Français. ⟨NNT : 2015PA066519⟩. ⟨tel-01242440v2⟩



Record views


Files downloads