English
Related papers

Related papers: Condorcet cycle elections with influential voting …

200 papers

When selecting a subset of candidates (a so-called committee) based on the preferences of voters, proportional representation is often a major desideratum. When going beyond simplistic models such as party-list or district-based elections,…

Computer Science and Game Theory · Computer Science 2023-02-07 Markus Brill , Jannik Peters

We consider an odd-sized "jury", which votes sequentially between two states of Nature (say A and B, or Innocent and Guilty) with the majority opinion determining the verdict. Jurors have private information in the form of a signal in…

Theoretical Economics · Economics 2021-10-12 Steve Alpern , Bo Chen

In ranked-choice elections voters cast preference ballots which provide a voter's ranking of the candidates. The method of ranked-choice voting (RCV) chooses a winner by using voter preferences to simulate a series of runoff elections. Some…

General Economics · Economics 2023-06-12 Mallory Dickerson , Erin Martin , David McCune

Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps…

Multiagent Systems · Computer Science 2019-08-15 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

We use Hotelling's spatial model of competition to investigate the position-taking behaviour of political candidates under a class of electoral systems known as scoring rules. In a scoring rule election, voters rank all the candidates…

Computer Science and Game Theory · Computer Science 2013-01-03 Dodge Cahan , John McCabe-Dansted , Arkadii Slinko

The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head contest will also win the overall election. Once the voter…

Data Structures and Algorithms · Computer Science 2024-12-02 Arushi Arora , David Eppstein , Randy Le Huynh

The paper studies information markets concerning single events from an epistemic social choice perspective. Within the classical Condorcet error model for collective binary decisions, we establish equivalence results between elections and…

Computer Science and Game Theory · Computer Science 2024-07-15 Stéphane Airiau , Nicholas Kees Dupuis , Davide Grossi

Independent voters play an increasingly decisive role in contemporary elections, yet their collective behavior remains poorly understood. This paper investigates how a minority of voters with greater flexibility in their political…

Physics and Society · Physics 2025-12-22 Ernő Buzás , Attila Szilva

We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer…

Computer Science and Game Theory · Computer Science 2016-11-28 Gal Cohensius , Shie Manor , Reshef Meir , Eli Meirom , Ariel Orda

In this paper, we provide theoretical and empirical estimates for the likelihood of a negative participation paradox under instant runoff voting in three-candidate elections. We determine the probability of the paradox and related…

Physics and Society · Physics 2024-10-24 David McCune , Jennifer Wilson

We analyze the susceptibility of instant runoff voting (IRV) to a lesser-studied paradox known as a \emph{reinforcement paradox}, which occurs when candidate $X$ wins under IRV in two distinct elections but $X$ loses in the combined…

Physics and Society · Physics 2026-04-20 David McCune , Jennifer Wilson

The major finding, of this article, is an ensemble method, but more exactly, a novel, better ranked voting system (and other variations of it), that aims to solve the problem of finding the best candidate to represent the voters. We have…

Artificial Intelligence · Computer Science 2021-10-15 Gabriel-Claudiu Grama

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Jerome Lang , Tuomas Sandholm

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

Computer Science and Game Theory · Computer Science 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

In this paper, we take a statistical decision-theoretic viewpoint on social choice, putting a focus on the decision to be made on behalf of a system of agents. In our framework, we are given a statistical ranking model, a decision space,…

Artificial Intelligence · Computer Science 2016-03-15 Hossein Azari Soufiani , David C. Parkes , Lirong Xia

Schulze's rule is used in the elections of a large number of organizations including Wikimedia and Debian. Part of the reason for its popularity is the large number of axiomatic properties, like monotonicity and Condorcet consistency, which…

Artificial Intelligence · Computer Science 2013-04-04 Serge Gaspers , Thomas Kalinowski , Nina Narodytska , Toby Walsh

The study of the number of collisions in a Poisson-Dirichlet coalescent leads to the analysis of the following version of a stochastic leader-elec\-tion algorithm. Consider an infinite family of persons, labeled by $1,2,3,\ldots$, who…

Probability · Mathematics 2016-11-15 Gerold Alsmeyer , Zakhar Kabluchko , Alexander Marynych

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…

Theoretical Economics · Economics 2024-07-03 Jeremias Lenzi
‹ Prev 1 8 9 10 Next ›