Combining Voting Rules Together release_244hji72b5ahzk2kqecyi76q5q

by Nina Narodytska, Toby Walsh, Lirong Xia

Released as a article .

2012  

Abstract

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base voting rules has a desirable property like Condorcet consistency, the combination inherits this property. In addition, we prove that combining voting rules together in this way can make finding a manipulation more computationally difficult. Finally, we study the impact of this combinator on approximation methods that find close to optimal manipulations.
In text/plain format

Archived Files and Locations

application/pdf  121.6 kB
file_5oqddvaovjbtflwfm34ovsei64
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-03-14
Version   v1
Language   en ?
arXiv  1203.3051v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: dacd21b0-3684-44e5-900b-6b3942310830
API URL: JSON