An Analysis of Random Elections with Large Numbers of Voters

Matthew Harrison-Trainor

Papers from arXiv.org

Abstract: In an election in which each voter ranks all of the candidates, we consider the head-to-head results between each pair of candidates and form a labeled directed graph, called the margin graph, which contains the margin of victory of each candidate over each of the other candidates. A central issue in developing voting methods is that there can be cycles in this graph, where candidate $\mathsf{A}$ defeats candidate $\mathsf{B}$, $\mathsf{B}$ defeats $\mathsf{C}$, and $\mathsf{C}$ defeats $\mathsf{A}$. In this paper we apply the central limit theorem, graph homology, and linear algebra to analyze how likely such situations are to occur for large numbers of voters. There is a large literature on analyzing the probability of having a majority winner; our analysis is more fine-grained. The result of our analysis is that in elections with the number of voters going to infinity, margin graphs that are more cyclic in a certain precise sense are less likely to occur.

Date: 2020-09
New Economics Papers: this item is included in nep-cdm, nep-des and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2009.02979 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2009.02979

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().