Related papers: Cycles in synchronous iterative voting: general ro…
In this paper, I introduce a novel stability axiom for stochastic voting rules, called self-equivalence, by which a society considering whether to replace its voting rule using itself will choose not to do so. I then show that under the…
How often will elections end in landslides? What is the probability for a head-to-head race? Analyzing ballot results from several large countries rather anomalous and yet unexplained distributions have been observed. We identify tactical…
Condorcet's jury theorem states that the correct outcome is reached in direct majority voting systems with sufficiently large electorates as long as each voter's independent probability of voting for that outcome is greater than 0.5. Yet,…
We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it…
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop…
Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…
We evaluate the tendency for different voting methods to promote political compromise and reduce tensions in a society by using computer simulations to determine which voters candidates are incentivized to appeal to. We find that Instant…
There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…
Influence among individuals is at the core of collective social phenomena such as the dissemination of ideas, beliefs or behaviors, social learning and the diffusion of innovations. Different mechanisms have been proposed to implement…
Voting mechanisms are widely accepted and used methods for decentralized decision-making. Ensuring the acceptance of the voting mechanism's outcome is a crucial characteristic of robust voting systems. Consider this scenario: A group of…
The voting method, an ensemble approach for fundamental frequency estimation, is empirically known for its robustness but lacks thorough investigation. This paper provides a principled analysis and improvement of this technique. First, we…
The voter model with multiple states has found applications in areas as diverse as population genetics, opinion formation, species competition and language dynamics, among others. In a single step of the dynamics, an individual chosen at…
In this note we consider situations of (multidimensional) spatial majority voting. We show that under some assumptions usual in this literature, with an even number of voters if the core of the voting situation is singleton (and in the…
In the face of adverse motives, it is indispensable to achieve a consensus. Elections have been the canonical way by which modern democracy has operated since the 17th century. Nowadays, they regulate markets, provide an engine for modern…
Multi-winner approval elections are seen in a variety of settings ranging from academic societies and associations to public elections. In such elections, it is often the case that ballot-length restrictions are enforced; that is, where…
We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to aggregate the votes into a single unified proposal is…
A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…
The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have…
We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…
Random perturbations applied in tandem to an ensemble of oscillating objects can synchronize their motion. We study multiple copies of an arbitrary dynamical system in a stable limit cycle, described via a standard phase reduction picture.…