English
Related papers

Related papers: Why Condorcet Consistency is Essential

200 papers

Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set, assuming that the number of voters is odd, and alternatives…

Discrete Mathematics · Computer Science 2025-09-26 Bei Zhou , Klas Markström

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the…

Computer Science and Game Theory · Computer Science 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

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

In this paper, we discuss a voting model with two candidates, C_1 and C_2. We set two types of voters--herders and independents. The voting of independent voters is based on their fundamental values; on the other hand, the voting of herders…

Physics and Society · Physics 2015-05-27 Masato Hisakado , Shintaro Mori

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters. We consider two winning conditions, viz. to be a Condorcet winner and to…

Computer Science and Game Theory · Computer Science 2013-04-29 Rudolf Berghammer , Henning Schnoor

We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternatives. Subsequently we provide a simple axiomatic…

Optimization and Control · Mathematics 2025-03-11 Somdeb Lahiri

Despite many examples to the contrary, most models of elections assume that rules determining the winner will be followed. We present a model where elections are solely a public signal of the incumbent popularity, and citizens can protests…

Physics and Society · Physics 2013-02-04 Andrew T. Little , Joshua A. Tucker , Tom LaGatta

Social decision schemes (SDSs) map the preferences of a group of voters over some set of $m$ alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard implies that there…

Theoretical Economics · Economics 2022-01-26 Felix Brandt , Patrick Lederer , René Romen

An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive…

Computer Science and Game Theory · Computer Science 2019-06-25 Nathann Cohenn , Edith Elkind , Foram Lakhani

From the perspective of social choice theory, ranked-choice voting (RCV) is known to have many flaws. RCV can fail to elect a Condorcet winner and is susceptible to monotonicity paradoxes and the spoiler effect, for example. We use a…

General Economics · Economics 2023-03-07 Adam Graham-Squire , David McCune

A "repeat voting" procedure is proposed, whereby voting is carried out in two identical rounds. Every voter can vote in each round, the results of the first round are made public before the second round, and the final result is determined…

Theoretical Economics · Economics 2022-11-30 Sergiu Hart

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC)…

Multiagent Systems · Computer Science 2022-02-25 Jiehua Chen , Sanjukta Roy

Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees. The Necessary President problem asks whether a candidate, if…

Computer Science and Game Theory · Computer Science 2026-02-12 Katarína Cechlárová , Ildikó Schlotter

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…

Theoretical Economics · Economics 2020-09-08 Matthew Harrison-Trainor

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

Political candidates often shift their positions opportunistically in hopes of capturing more votes. When there are only two candidates, the best strategy for each of them is often to move towards the other. This eventually results in two…

Dynamical Systems · Mathematics 2023-10-25 Christoph Börgers , Bruce Boghosian , Natasa Dragovic , Anna Haensch