English
Related papers

Related papers: Semi-Random Impossibilities of Condorcet Criterion

200 papers

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

Computer Science and Game Theory · Computer Science 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

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

Divided Government is nowadays a common feature of the U.S. political system. The voters can cast partisan ballots for two political powers the executive (Presidential elections) and the legislative (the Congress election). Some recent…

General Physics · Physics 2014-05-08 Polina Khrennikova

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

By relaxing the dominating set in three ways (e.g., from "each member beats every non-member" to "each member beats or ties every non-member, with an additional requirement that at least one member beat every non-member"), we propose a new…

Theoretical Economics · Economics 2024-03-26 Fujun Hou

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

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

We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles…

Artificial Intelligence · Computer Science 2018-01-03 Marco Zaffalon , Enrique Miranda

Consider the following social choice problem. Suppose we have a set of $n$ voters and $m$ candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as…

Computer Science and Game Theory · Computer Science 2021-11-09 Moses Charikar , Prasanna Ramakrishnan

May's Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May's crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that…

Theoretical Economics · Economics 2020-09-01 Laurent Bartholdi , Wade Hann-Caruthers , Maya Josyula , Omer Tamuz , Leeat Yariv

This study proposes a new efficiency requirement, a minimal almost weak Pareto principle, which says that x is socially better than y whenever the only one individual never prefers y to x, and all the others prefers x to y. Then, I show…

Theoretical Economics · Economics 2025-01-20 Norihito Sakamoto

We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optimizing the total (dis)satisfaction of the voters with their…

Artificial Intelligence · Computer Science 2013-12-17 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

Social Choice theory generalizes voting on one proposal to ranking multiple proposals. Yet, while a vote on a single proposal has the status quo (Reality) as a default, Reality has been forsaken during this generalization. Here, we propose…

Computers and Society · Computer Science 2019-05-17 Ehud Shapiro , Nimrod Talmon

A new game-theoretic approach for combining multiple classifiers is proposed. A short introduction in Game Theory and coalitions illustrate the way any collective decision scheme can be viewed as a competitive game of coalitions that are…

Computer Science and Game Theory · Computer Science 2015-02-10 Harris V. Georgiou

We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…

Data Structures and Algorithms · Computer Science 2015-01-14 Miklos Ajtai , Vitaly Feldman , Avinatan Hassidim , Jelani Nelson

An important aspect of AI design and ethics is to create systems that reflect aggregate preferences of the society. To this end, the techniques of social choice theory are often utilized. We propose a new social choice function motivated by…

Multiagent Systems · Computer Science 2021-03-02 Gergei Bana , Wojciech Jamroga , David Naccache , Peter Y. A. Ryan

We consider synchronous iterative voting, where voters are given the opportunity to strategically choose their ballots depending on the outcome deduced from the previous collective choices.We propose two settings for synchronous iterative…

Computer Science and Game Theory · Computer Science 2022-02-11 Benoît Kloeckner

We generalize Condorcet's jury theorem (CJT) to socially connected populations in which agents revise discrete choices on a network in the presence of zealots. Free agents receive privately informative signals about the correct alternative…

Physics and Society · Physics 2025-10-21 Dan Braha , Marcus A. M. de Aguiar
‹ Prev 1 3 4 5 6 7 10 Next ›