English
Related papers

Related papers: Approximately Dominating Sets in Elections

200 papers

Elections involving a very large voter population often lead to outcomes that surprise many. This is particularly important for the elections in which results affect the economy of a sizable population. A better prediction of the true…

Computer Science and Game Theory · Computer Science 2018-01-31 Palash Dey , Pravesh K. Kothari , Swaprava Nath

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

We consider the manipulability of tournament rules, in which $n$ teams play a round robin tournament and a winner is (possibly randomly) selected based on the outcome of all $\binom{n}{2}$ matches. Prior work defines a tournament rule to be…

Computer Science and Game Theory · Computer Science 2019-11-19 Ariel Schvartzman , S. Matthew Weinberg , Eitan Zlatin , Albert Zuo

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\binom{n}{2}$ pairwise matches…

Computer Science and Game Theory · Computer Science 2016-06-01 Jon Schneider , Ariel Schvartzman , S. Matthew Weinberg

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 study a modification of the so-called Parrondo's paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own…

Physics and Society · Physics 2014-10-03 L. Dinis , J. M. R. Parrondo

The outcome of an election depends not only on which candidate is more popular, but also on how many of their voters actually turn out to vote. Here we consider a simple model in which voters abstain from voting if they think their vote…

Physics and Society · Physics 2021-12-01 Ekaterina Landgren , Jonas L. Juul , Steven H. Strogatz

The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of…

Combinatorics · Mathematics 2012-11-05 Jennifer Iglesias , Nathaniel Ince , Po-Shen Loh

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

Ranked-choice voting anomalies such as monotonicity paradoxes have been extensively studied through creating hypothetical examples and generating elections under various models of voter behavior. However, very few real-world examples of…

General Economics · Economics 2024-11-20 Adam Graham-Squire , David McCune

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

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 develop a framework that leverages the smoothed complexity analysis by Spielman and Teng to circumvent paradoxes and impossibility theorems in social choice, motivated by modern applications of social choice powered by AI and ML. For…

Computer Science and Game Theory · Computer Science 2021-01-11 Lirong Xia

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

The Condorcet Jury Theorem or the Miracle of Aggregation are frequently invoked to ensure the competence of some aggregate decision-making processes. In this article we explore an estimation of the prior probability of the thesis predicted…

Theoretical Economics · Economics 2022-06-22 Álvaro Romaniega

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

Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…

Probability · Mathematics 2022-06-01 Emilio De Santis , Fabio Spizzichino

We study the committee selection problem in the canonical impartial culture model with a large number of voters and an even larger candidate set. Here, each voter independently reports a uniformly random preference order over the…

Computer Science and Game Theory · Computer Science 2026-02-05 Yifan Lin , Shenyu Qin , Kangning Wang , Lirong Xia

In this paper we analyse some of the classical paradoxes in Social Choice Theory (namely, the Condorcet paradox, the discursive dilemma, the Ostrogorski paradox and the multiple election paradox) using a general framework for the study of…

Multiagent Systems · Computer Science 2014-06-12 Umberto Grandi