Abstracts Mathematics

Add abstract

Want to add your dissertation abstract to this database? It only takes a minute!

Search abstract

Search for abstracts by subject, author or institution

Share this abstract

Quantitative Analysis of Strategic Voting in Anonymous Voting Systems

by Tiance Wang

Institution: Princeton University
Year: 2016
Keywords: Condorcet method; strategic voting; voting; voting theory
Posted: 02/05/2017
Record ID: 2134849
Full text PDF: http://arks.princeton.edu/ark:/88435/dsp013b591b97q


Abstract

Democratically choosing a single preference from three or more candidate options is not a straightforward matter. There are many competing ideas on how to aggregate rankings of candidates. However, the Gibbard-Satterthwaite theorem implies that no fair voting system (equality among voters and equality among candidates) is immune to strategic voting, also known as manipulation. This dissertation is a quantitative analysis of strategic voting from a geometric perspective. Anonymous voting rules, where all voters are equal, can be viewed as a partition of a high dimensional simplex, where different distributions of votes correspond to different points in the simplex, and each particular way of partitioning the simplex corresponds to a voting rule. It is revealed that the orientation, instead of the location, of the boundary determines manipulability. A boundary that separates two winning candidates is not manipulable if and only if the boundary is parallel to all vote changes that does not switch the order of the candidate pair. We analyze the vulnerability to strategic voting of several popular voting systems, including plurality, Borda count and Kemeny-Young, under various vote distributions. When there are three candidates, we show that the Kemeny-Young method, and Condorcet methods in general, are categorically more resistant to strategic voting than many other common voting systems, due to the existence of non-manipulable boundaries. We verify our results on voting data that we collected through an online survey on the 2012 US President Election. Finally, we explore the collective behaviors of manipulative voters. Assume every voter can change their vote for an infinite number of times. They formulate strategies based on their observations on the preference of the population. The observations, which contain noise, are generated by some distribution conditioned on the current vote status. We show that the plurality rule almost always elects the instant run-off winner, while Borda count almost always elects the Condorcet winner (when one exists) as the number of voters grow. Advisors/Committee Members: Cuff, Paul (advisor), Kulkarni, Sanjeev (advisor).

Add abstract

Want to add your dissertation abstract to this database? It only takes a minute!

Search abstract

Search for abstracts by subject, author or institution

Share this abstract

Relevant publications

Book cover thumbnail image
Proof in Alonzo Church's and Alan Turing's Mathema... Undecidability of First Order Logic
by Chimakonam, Jonathan Okeke
   
Book cover thumbnail image
New Splitting Iterative Methods for Solving Multid...
by Tagoudjeu, Jacques
   
Book cover thumbnail image
A Reusable Learning Object Design Model for Elemen...
by Reece, Amanda A.
   
Book cover thumbnail image
Finding the Real Odds Attrition and Time-to-Degree in the FSU College of...
by Lightfoot, Robert C.
   
Book cover thumbnail image
Modelling and Simulation of Stochastic Volatility ...
by Kahl, Christian
   
Book cover thumbnail image
Radiative Transfer Using Boltzmann Transport Theor...
by Littlejohn, Carnell
   
Book cover thumbnail image
Modeling Credit Risk and Pricing Credit Derivative...
by Wolf, Martin P.
   
Book cover thumbnail image
Canonical Auto and Cross Correlations of Multivari...
by Bulach, Marcia Woolf