Strategy and Effectiveness: An Analysis of Preferential Ballot Voting Methods

Loading...

Date

2011-05-11

Journal Title

Journal ISSN

Volume Title

Repository Usage Stats

370
views
481
downloads

Abstract

To provide insight on various voting systems, we study six election methods using three categories of analysis. First, we prove and discuss the various fundamental election properties satisfied by each method. Since the better election methods tend to satisfy more of these properties, we are able to narrow down the list of preferable voting systems. The next phase focuses on the “crowding out” of candidates in elections. We study the susceptibility of each voting system to this crowding phenomenon, verifying that the best methods are those that do not tend to exhibit this problem. Finally, we take two of the best voting systems and run simulated random elections to assess how often they choose the same winner and which method has the best head-to-head winning percentage. We compare these top methods to another system from the original pool of six as a control example. This thesis should help inform studies of how to choose the best election method and provide a recommendation regarding which methods are generically the best.

Department

Description

Honors Thesis for Graduation with Distinction in Mathematics

Provenance

Subjects

Voting methods, Arrow's theorem, Crowding, Condorcet, Ranked pairs, Least worst defeat

Citation

Citation

Tabachnik, Maksim (2011). Strategy and Effectiveness: An Analysis of Preferential Ballot Voting Methods. Honors thesis, Duke University. Retrieved from https://hdl.handle.net/10161/3746.


Except where otherwise noted, student scholarship that was shared on DukeSpace after 2009 is made available to the public under a Creative Commons Attribution / Non-commercial / No derivatives (CC-BY-NC-ND) license. All rights in student work shared on DukeSpace before 2009 remain with the author and/or their designee, whose permission may be required for reuse.