English
Related papers

Related papers: Why Condorcet Consistency is Essential

200 papers

We initiate the work towards a comprehensive picture of the smoothed satisfaction of voting axioms, to provide a finer and more realistic foundation for comparing voting rules. We adopt the smoothed social choice framework, where an…

Theoretical Economics · Economics 2021-06-04 Lirong Xia

We present the core support criterion, a voting criterion satisfied by Instant Runoff Voting (IRV) that is analogous to the Condorcet criterion but reflective of a different majority rule philosophy. Condorcet methods can be thought of as…

Theoretical Economics · Economics 2024-07-12 Ross Hyman , Deb Otis , Seamus Allen , Greg Dennis

Typical voting rules do not work well in settings with many candidates. If there are just several hundred candidates, then even a simple task such as choosing a top candidate becomes impractical. Motivated by the hope of developing group…

Computer Science and Game Theory · Computer Science 2012-10-03 Ashish Goel , David Lee

We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given…

Computer Science and Game Theory · Computer Science 2023-03-10 Niclas Boehmer , Jin-Yi Cai , Piotr Faliszewski , Austen Z. Fan , Łukasz Janeczko , Andrzej Kaczmarczyk , Tomasz Wąs

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…

Computer Science and Game Theory · Computer Science 2015-05-12 Ben Wise , Steven Bankes

A tournament organizer must select one of $n$ possible teams as the winner of a competition after observing all $\binom{n}{2}$ matches between them. The organizer would like to find a tournament rule that simultaneously satisfies the…

Computer Science and Game Theory · Computer Science 2024-07-26 David Mikšaník , Ariel Schvartzman , Jan Soukup

The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define ("rationalize")…

Computer Science and Game Theory · Computer Science 2010-09-03 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking

In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made…

Artificial Intelligence · Computer Science 2013-03-05 Umberto Grandi , Andrea Loreggia , Francesca Rossi , Kristen Brent Venable , Toby Walsh

Election systems based on scores generally determine the winner by computing the score of each candidate and the winner is the candidate with the best score. It would be natural to expect that computing the winner of an election is at least…

Computer Science and Game Theory · Computer Science 2019-11-21 Zack Fitzsimmons , Edith Hemaspaandra

In 1977, Young proposed a voting scheme that extends the Condorcet Principle based on the fewest possible number of voters whose removal yields a Condorcet winner. We prove that both the winner and the ranking problem for Young elections is…

Computational Complexity · Computer Science 2016-08-16 Jörg Rothe , Holger Spakowski , Jörg Vogel

This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…

Data Structures and Algorithms · Computer Science 2024-01-22 Lisa Hellerstein , Naifeng Liu , Kevin Schewior

We study matching problems in which agents form one side of a bipartite graph and have preferences over objects on the other side. A central solution concept in this setting is popularity: a matching is popular if it is a (weak) Condorcet…

Computer Science and Game Theory · Computer Science 2026-02-19 Telikepalli Kavitha , Jannik Matuschke , Ulrike Schmidt-Kraepelin

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct…

Machine Learning · Computer Science 2020-02-17 Hanan Shteingart , Eran Marom , Igor Itkin , Gil Shabat , Michael Kolomenkin , Moshe Salhov , Liran Katzir

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

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,…

Combinatorics · Mathematics 2023-01-10 Lucas Böttcher , Georgia Kernell

The voting systems known as Alternative Vote (AV) and Single Transferable Vote (STV) are extensively used for elections in Australia, possibly more than in any other jurisdiction. Often proposed as superior alternatives to Plurality and…

Physics and Society · Physics 2025-07-22 Anthony B. Morton

We analyze the winning coalitions that arise under Bloc voting when voters preferences are single-peaked. For small numbers of candidates and numbers of winners, we determine conditions under which candidates in winning coalitions are…

Computer Science and Game Theory · Computer Science 2026-02-20 Ariel Calver , Serena Pallan , Alice , Park , Jennifer Wilson

We introduce River, a novel Condorcet-consistent voting method that is based on pairwise majority margins and can be seen as a simplified variation of Tideman's Ranked Pairs method. River is simple to explain, simple to compute even 'by…

Computer Science and Game Theory · Computer Science 2025-04-22 Michelle Döring , Markus Brill , Jobst Heitzig