English
Related papers

Related papers: Combining Voting Rules Together

200 papers

We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single-peaked resp. single-crossing preferences. We show that for…

Multiagent Systems · Computer Science 2023-08-01 Jiehua Chen , Christian Hatschka , Sofia Simola

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

Probability · Mathematics 2012-05-31 Joe Neeman

We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of…

Computer Science and Game Theory · Computer Science 2020-07-10 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier

An accumulator is a bet that presents a rather unique payout structure, in that it combines multiple bets into a wager that can generate a total payout given by the multiplication of the individual odds of its parts. These potentially…

Artificial Intelligence · Computer Science 2020-04-21 Nassim Dehouche

Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice…

Multiagent Systems · Computer Science 2025-09-12 Leonardo Matone , Ben Abramowitz , Ben Armstrong , Avinash Balakrishnan , Nicholas Mattei

We study the ability of different classes of voting rules to induce agents to report their preferences truthfully, if agents want to avoid regret. First, we show that regret-free truth-telling is equivalent to strategy-proofness among…

Theoretical Economics · Economics 2025-03-21 R. Pablo Arribillaga , Agustin G. Bonifacio , Marcelo Ariel Fernandez

We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optimizing the total (dis)satisfaction of the voters with their…

Artificial Intelligence · Computer Science 2013-12-17 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

The theory of belief functions manages uncertainty and also proposes a set of combination rules to aggregate opinions of several sources. Some combination rules mix evidential information where sources are independent; other rules are…

Artificial Intelligence · Computer Science 2015-03-18 Mouna Chebbah , Arnaud Martin , Boutheina Ben Yaghlane

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…

Computer Science and Game Theory · Computer Science 2017-03-16 Nika Haghtalab , Ritesh Noothigattu , Ariel D. Procaccia

We show a prototype of a system that uses multiwinner voting to suggest resources (such as movies) related to a given query set (such as a movie that one enjoys). Depending on the voting rule used, the system can either provide resources…

Computer Science and Game Theory · Computer Science 2022-02-09 Grzegorz Gawron , Piotr Faliszewski

Scoring rules aggregate individual rankings by assigning some points to each position in each ranking such that the total sum of points provides the overall ranking of the alternatives. They are widely used in sports competitions consisting…

Other Statistics · Statistics 2023-03-28 László Csató

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum,…

Probability · Mathematics 2025-04-25 Dorje C. Brody , Tomooki Yuasa

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…

Computational Complexity · Computer Science 2010-04-22 Gábor Erdélyi , Michael Fellows

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

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

Computer Science and Game Theory · Computer Science 2017-11-23 Robert Bredereck , Piotr Faliszewski , Ayumi Igarashi , Martin Lackner , Piotr Skowron

We study how electoral rules shape polarization dynamics when voters and candidates both adapt to repeated election outcomes. We introduce two geometric primitives for comparing rules under this feedback: the \emph{winner radius} $R_t =…

Computer Science and Game Theory · Computer Science 2026-04-23 Sumit Mukherjee

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