An Analysis of Random Elections with Large Numbers of Voters

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Matthew Harrison-Trainor

Ngôn ngữ: eng

Ký hiệu phân loại: 324.6 Election systems and procedures; suffrage

Thông tin xuất bản: 2020

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 165151

 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.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH