English
Related papers

Related papers: Tradeoffs in Hierarchical Voting Systems

200 papers

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

Computer Science and Game Theory · Computer Science 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

We study the voting game where agents' preferences are endogenously decided by the information they receive, and they can collaborate in a group. We show that strategic voting behaviors have a positive impact on leading to the ``correct''…

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

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

Committee-selection problems arise in many contexts and applications, and there has been increasing interest within the social choice research community on identifying which properties are satisfied by different multi-winner voting rules.…

Artificial Intelligence · Computer Science 2025-08-11 Joshua Caiata , Ben Armstrong , Kate Larson

We study a mathematical model of voting contest with $m$ voters and $n$ candidates, with each voter ranking the candidates in order of preference, without ties. A Condorcet winner is a candidate who gets more than $m/2$ votes in pairwise…

Combinatorics · Mathematics 2025-11-05 Boris Pittel

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

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

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

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

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote…

Computer Science and Game Theory · Computer Science 2017-10-27 László Csató

A Condorcet voting scheme chooses a winning candidate as one who defeats all others in pairwise majority rule. We provide a review which includes the rigorous mathematical treatment for calculating the limiting probability of a Condorcet…

Statistics Theory · Mathematics 2007-06-13 M. S. Krishnamoorthy , M. Raghavachari

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

Computer Science and Game Theory · Computer Science 2023-07-07 Friedemann Kemm

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

Consider an odd-sized jury, which determines a majority verdict between two equiprobable states of Nature. If each juror independently receives a binary signal identifying the correct state with identical probability $p$, then the…

Probability · Mathematics 2019-11-28 Steve Alpern , Bo Chen , Adam J. Ostaszewski

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have…

Computer Science and Game Theory · Computer Science 2024-01-23 Soroush Ebadian , Anson Kahng , Dominik Peters , Nisarg Shah

We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the closest proxy. The goal is to find a set of proxies that is…

Computer Science and Game Theory · Computer Science 2020-12-15 Elliot Anshelevich , Zack Fitzsimmons , Rohit Vaish , Lirong Xia

The paper studies information markets concerning single events from an epistemic social choice perspective. Within the classical Condorcet error model for collective binary decisions, we establish equivalence results between elections and…

Computer Science and Game Theory · Computer Science 2024-07-15 Stéphane Airiau , Nicholas Kees Dupuis , Davide Grossi
‹ Prev 1 3 4 5 6 7 10 Next ›