
FineGrained Complexity and Algorithms for the Schulze Voting Method
We study computational aspects of a wellknown singlewinner voting rule...
read it

Stable Voting
In this paper, we propose a new singlewinner voting system using ranked...
read it

Elections with Few Voters: Candidate Control Can Be Easy
We study the computational complexity of candidate control in elections ...
read it

Bad cycles in iterative Approval Voting
This article is about synchronized iterative voting in the context of Ap...
read it

Bribery as a Measure of Candidate Success: Complexity Results for ApprovalBased Multiwinner Rules
We study the problem of bribery in multiwinner elections, for the case w...
read it

Probabilistic Evaluation of Candidates and Symptom Clustering for Multidisorder Diagnosis
This paper derives a formula for computing the conditional probability o...
read it
An Analysis of Random Elections with Large Numbers of Voters
In an election in which each voter ranks all of the candidates, we consider the headtohead 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 ๐ defeats candidate ๐ก, ๐ก defeats ๐ข, and ๐ข defeats ๐ . 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 finegrained. 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.
READ FULL TEXT
Comments
There are no comments yet.