English
Related papers

Related papers: When Can Voting Help, Hurt, or Change Course? Exac…

200 papers

The traditional axiomatic approach to voting is motivated by the problem of reconciling differences in subjective preferences. In contrast, a dominant line of work in the theory of voting over the past 15 years has considered a different…

Discrete Mathematics · Computer Science 2015-12-19 Flavio Chierichetti , Jon Kleinberg

Repeated sampling is a standard way to spend test-time compute, but its benefit is controlled by the latent distribution of correctness across examples, not by one-call accuracy alone. We study the binary correctness layer of repeated LLM…

Machine Learning · Computer Science 2026-05-08 Yi Liu

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 revisit the recent breakthrough result of Gkatzelis et al. on (single-winner) metric voting, which showed that the optimal distortion of 3 can be achieved by a mechanism called Plurality Matching. The rule picks an arbitrary candidate…

Computer Science and Game Theory · Computer Science 2025-02-05 Fatih Erdem Kizilkaya , David Kempe

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

This paper introduces a novel binary stability property for voting rules-called binary self-selectivity-by which a society considering whether to replace its voting rule using itself in pairwise elections will choose not to do so. In…

Theoretical Economics · Economics 2025-08-27 Héctor Hermida-Rivera , Toygar T. Kerman

The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…

Statistical Mechanics · Physics 2023-11-08 Pascal Grange

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

In this article, we study the effect of vector-valued interventions in votes under a binary voter model, where each voter expresses their vote as a $0-1$ valued random variable to choose between two candidates. We assume that the outcome is…

Applications · Statistics 2022-10-17 Manit Paul , Rishideep Roy , Soudeep Deb

Limited Voting (LV) is an approval-based method for multi-winner elections where all ballots are required to have a same fixed size. While it appears to be used as voting method in corporate governance and has some political applications,…

Computer Science and Game Theory · Computer Science 2024-07-26 Maaike Venema-Los , Zoé Christoff , Davide Grossi

In this work we study the metric distortion problem in voting theory under a limited amount of ordinal information. Our primary contribution is threefold. First, we consider mechanisms which perform a sequence of pairwise comparisons…

Computer Science and Game Theory · Computer Science 2021-07-07 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

An assembly of $n$ voters needs to decide on $t$ independent binary issues. Each voter has opinions about the issues, given by a $t$-bit vector. Anscombe's paradox shows that a policy following the majority opinion in each issue may not…

Computer Science and Game Theory · Computer Science 2023-03-03 Andrei Constantinescu , Roger Wattenhofer

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…

Computer Science and Game Theory · Computer Science 2024-10-11 Xiaotie Deng , Biaoshuai Tao , Ying Wang

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

We study the effect of strategic behavior in iterative voting for multiple issues under uncertainty. We introduce a model synthesizing simultaneous multi-issue voting with Meir, Lev, and Rosenschein (2014)'s local dominance theory and…

Computer Science and Game Theory · Computer Science 2023-01-24 Joshua Kavner , Reshef Meir , Francesca Rossi , Lirong Xia
‹ Prev 1 2 3 10 Next ›