HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Can a Condorcet Rule Have a Low Coalitional Manipulability?

Abstract : We investigate the possibility of designing a voting rule that both meets the Condorcet criterion and has a low vulnerability to coalitional manipulation. For this purpose, we examine the Condorcification of a voting rule, where the original rule is altered to elect the Condorcet winner when one exists, and we study its impact on coalitional manipulability. A recent result states that for a large class of voting rules based on strict total orders, their Condorcification is at most as coalitionally manipulable as the original rule. We show that for most of them, the improvement is strict. We extend these results to a broader framework that includes weak orders and cardinal voting rules. These results support the main message of this paper: when searching for a "reasonable" voting rule with minimal coalitional manipulability, investigations can be restricted to Condorcet rules. In other words, in a class of "reasonnable" voting rules, it is possible to have both the Condorcet criterion and a minimal vulnerability to coalitional manipulation.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

Contributor : François Durand Connect in order to contact the contributor
Submitted on : Wednesday, September 21, 2016 - 4:06:24 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:03 AM
Long-term archiving on: : Thursday, December 22, 2016 - 1:30:58 PM


Files produced by the author(s)


  • HAL Id : hal-01369877, version 1


François Durand, Fabien Mathieu, Ludovic Noirie. Can a Condorcet Rule Have a Low Coalitional Manipulability?. European Conference on Artificial Intelligence (ECAI), Aug 2016, Den Haag, Netherlands. pp.707-715. ⟨hal-01369877⟩



Record views


Files downloads