English
Related papers

Related papers: Justified Representation in Approval-Based Committ…

200 papers

We study the {PAC} learnability of multiwinner voting, focusing on the class of approval-based committee scoring (ABCS) rules. These are voting rules applied on profiles with approval ballots, where each voter approves some of the…

Computer Science and Game Theory · Computer Science 2023-08-02 Ioannis Caragiannis , Karl Fehrs

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be…

Computer Science and Game Theory · Computer Science 2015-01-12 Haris Aziz , Toby Walsh

We present a new model that describes the process of electing a group of representatives (e.g., a parliament) for a group of voters. In this model, called the voting committee model, the elected group of representatives runs a number of…

Multiagent Systems · Computer Science 2016-11-22 Piotr Skowron

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

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

Platforms for online civic participation rely heavily on methods for condensing thousands of comments into a relevant handful, based on whether participants agree or disagree with them. These methods should guarantee fair representation of…

Computer Science and Game Theory · Computer Science 2023-12-25 Daniel Halpern , Gregory Kehne , Ariel D. Procaccia , Jamie Tucker-Foltz , Manuel Wüthrich

It is common that a jury must grade a set of candidates in a cardinal scale such as {1,2,3,4,5} or an ordinal scale such as {Great, Good, Average, Bad }. When the number of candidates is very large such as hotels (BOOKING), restaurants…

Computer Science and Game Theory · Computer Science 2023-02-24 Rida Laraki , Estelle Varloot

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

We study two influential voting rules proposed in the 1890s by Phragm\'en and Thiele, which elect a committee or parliament of k candidates which proportionally represents the voters. Voters provide their preferences by approving an…

Computer Science and Game Theory · Computer Science 2022-11-01 Dominik Peters , Piotr Skowron

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval…

Computer Science and Game Theory · Computer Science 2021-04-20 Piotr Faliszewski , Piotr Skowron , Nimrod Talmon

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using approval voting, this could be an ideological left-right…

Computer Science and Game Theory · Computer Science 2024-05-08 Théo Delemazure , Chris Dong , Dominik Peters , Magdaléna Tydrichová

We study sincere-strategy preference-based approval voting (SP-AV), a system proposed by Brams and Sanver [Electoral Studies, 25(2):287-305, 2006], and here adjusted so as to coerce admissibility of the votes (rather than excluding…

Computer Science and Game Theory · Computer Science 2009-06-12 Gabor Erdelyi , Markus Nowak , Joerg Rothe

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…

Computer Science and Game Theory · Computer Science 2024-08-02 Ganesh Ghalme , Reshef Meir

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…

Computer Science and Game Theory · Computer Science 2014-07-14 Haris Aziz , Serge Gaspers , Joachim Gudmundsson , Simon Mackenzie , Nicholas Mattei , Toby Walsh

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 approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…

Combinatorics · Mathematics 2021-08-30 Kristen Mazur , Mutiara Sondjaja , Matthew Wright , Carolyn Yarnall

We introduce the reputational voter model (RVM) to account for the time-varying abilities of individuals to influence their neighbors. To understand of the RVM, we first discuss the fitness voter model (FVM), in which each voter has a fixed…

Physics and Society · Physics 2019-06-25 D. Bhat , S. Redner

We provide the first large-scale data collection of real-world approval-based committee elections. These elections have been conducted on the Polkadot blockchain as part of their Nominated Proof-of-Stake mechanism and contain around one…

Computer Science and Game Theory · Computer Science 2023-12-20 Niclas Boehmer , Markus Brill , Alfonso Cevallos , Jonas Gehrlein , Luis Sánchez-Fernández , Ulrike Schmidt-Kraepelin

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis
‹ Prev 1 3 4 5 6 7 10 Next ›