English
Related papers

Related papers: Monotonicity axioms in approval-based multi-winner…

200 papers

Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine…

Computer Science and Game Theory · Computer Science 2014-06-03 Haris Aziz

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á

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

Computer Science and Game Theory · Computer Science 2015-02-17 Palash Dey , Y. Narahari

The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules. Here we give a structured list of most rules that have been proposed and…

Artificial Intelligence · Computer Science 2016-12-07 Jerôme Lang , Gabriella Pigozzi , Marija Slavkovik , Leendert van der Torre , Srdjan Vesic

Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setting where voters either approve or disapprove of each…

Computer Science and Game Theory · Computer Science 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

Epistemic voting interprets votes as noisy signals about a ground truth. We consider contexts where the truth consists of a set of objective winners, knowing a lower and upper bound on its cardinality. A prototypical problem for this…

Artificial Intelligence · Computer Science 2022-01-19 Tahar Allouche , Jérôme Lang , Florian Yger

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that…

Computer Science and Game Theory · Computer Science 2024-08-21 Valentin Zech , Niclas Boehmer , Edith Elkind , Nicholas Teh

We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners (committee). We propose a natural axiom for this setting,…

Multiagent Systems · Computer Science 2016-09-13 Haris Aziz , Markus Brill , Vincent Conitzer , Edith Elkind , Rupert Freeman , Toby Walsh

We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can veto the candidates they do not prefer. For a given voting…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Alexander S. Nesterov

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

Computer Science and Game Theory · Computer Science 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

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

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

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 a variant of the voter model with multiple opinions; individuals can imitate each other and also change their opinion randomly in mutation events. We focus on the case of a population with all-to-all interaction. A noise-driven…

Physics and Society · Physics 2019-08-14 Francisco Herrerías-Azcué , Tobias Galla

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

Optimization and Control · Mathematics 2016-11-03 Sergey Shvydun

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have…

Probability · Mathematics 2021-01-28 Abraham Gutierrez , Sebastian Müller , Stjepan Šebek

Epistemic social choice aims at unveiling a hidden ground truth given votes, which are interpreted as noisy signals about it. We consider here a simple setting where votes consist of approval ballots: each voter approves a set of…

Computer Science and Game Theory · Computer Science 2021-12-09 Tahar Allouche , Jérôme Lang , Florian Yger

We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that…

Computer Science and Game Theory · Computer Science 2021-04-21 Markus Brill , Jean-François Laslier , Piotr Skowron

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler