Control complexity in Bucklin and fallback voting

A theoretical analysis

Gabor Erdelyi, Michael Fellows, Jorg Rothe, Lena Schend

    Research output: Contribution to journalArticleResearchpeer-review

    12 Downloads (Pure)

    Abstract

    Electoral control models ways of changing the outcome of an election via such actions as adding, deleting, or partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been used to establish so-called resistanceresults. We show that fallback voting, an election system proposed by Brams and Sanver[12]to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting and show that it performs almost as well as fallback voting in terms of control resistance. Furthermore, we investigate the parameterized control complexity of Bucklin and fallback voting, according to several parameters that are often likely to be small for typical instances. In a companion paper [28], we challenge our worst-case complexity results from an experimental point of view.
    Original languageEnglish
    Pages (from-to)632-660
    Number of pages29
    JournalJournal of Computer and System Sciences
    Volume81
    Issue number4
    DOIs
    Publication statusPublished - Jun 2015

    Fingerprint

    Voting
    Theoretical Analysis
    Elections
    Partitioning
    Computational complexity
    Polynomial time
    Computational Complexity
    Likely
    Polynomials

    Cite this

    Erdelyi, Gabor ; Fellows, Michael ; Rothe, Jorg ; Schend, Lena. / Control complexity in Bucklin and fallback voting : A theoretical analysis. In: Journal of Computer and System Sciences. 2015 ; Vol. 81, No. 4. pp. 632-660.
    @article{300778ab5474433cb6fee83338ae89ce,
    title = "Control complexity in Bucklin and fallback voting: A theoretical analysis",
    abstract = "Electoral control models ways of changing the outcome of an election via such actions as adding, deleting, or partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been used to establish so-called resistanceresults. We show that fallback voting, an election system proposed by Brams and Sanver[12]to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting and show that it performs almost as well as fallback voting in terms of control resistance. Furthermore, we investigate the parameterized control complexity of Bucklin and fallback voting, according to several parameters that are often likely to be small for typical instances. In a companion paper [28], we challenge our worst-case complexity results from an experimental point of view.",
    author = "Gabor Erdelyi and Michael Fellows and Jorg Rothe and Lena Schend",
    year = "2015",
    month = "6",
    doi = "10.1016/j.jcss.2014.11.002",
    language = "English",
    volume = "81",
    pages = "632--660",
    journal = "Journal of Computer and System Sciences",
    issn = "0022-0000",
    publisher = "Academic Press",
    number = "4",

    }

    Control complexity in Bucklin and fallback voting : A theoretical analysis. / Erdelyi, Gabor; Fellows, Michael; Rothe, Jorg; Schend, Lena.

    In: Journal of Computer and System Sciences, Vol. 81, No. 4, 06.2015, p. 632-660.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

    T1 - Control complexity in Bucklin and fallback voting

    T2 - A theoretical analysis

    AU - Erdelyi, Gabor

    AU - Fellows, Michael

    AU - Rothe, Jorg

    AU - Schend, Lena

    PY - 2015/6

    Y1 - 2015/6

    N2 - Electoral control models ways of changing the outcome of an election via such actions as adding, deleting, or partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been used to establish so-called resistanceresults. We show that fallback voting, an election system proposed by Brams and Sanver[12]to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting and show that it performs almost as well as fallback voting in terms of control resistance. Furthermore, we investigate the parameterized control complexity of Bucklin and fallback voting, according to several parameters that are often likely to be small for typical instances. In a companion paper [28], we challenge our worst-case complexity results from an experimental point of view.

    AB - Electoral control models ways of changing the outcome of an election via such actions as adding, deleting, or partitioning either candidates or voters. To protect elections from such control attempts, computational complexity has been used to establish so-called resistanceresults. We show that fallback voting, an election system proposed by Brams and Sanver[12]to combine Bucklin with approval voting, displays the broadest control resistance currently known to hold among natural election systems with a polynomial-time winner problem. We also study the control complexity of Bucklin voting and show that it performs almost as well as fallback voting in terms of control resistance. Furthermore, we investigate the parameterized control complexity of Bucklin and fallback voting, according to several parameters that are often likely to be small for typical instances. In a companion paper [28], we challenge our worst-case complexity results from an experimental point of view.

    UR - http://www.scopus.com/inward/record.url?scp=84924939951&partnerID=8YFLogxK

    U2 - 10.1016/j.jcss.2014.11.002

    DO - 10.1016/j.jcss.2014.11.002

    M3 - Article

    VL - 81

    SP - 632

    EP - 660

    JO - Journal of Computer and System Sciences

    JF - Journal of Computer and System Sciences

    SN - 0022-0000

    IS - 4

    ER -