English
Related papers

Related papers: COWPEA (Candidates Optimally Weighted in Proportio…

200 papers

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

We study the problem of coalitional manipulation---where $k$ manipulators try to manipulate an election on $m$ candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted…

Data Structures and Algorithms · Computer Science 2017-08-17 Orgad Keller , Avinatan Hassidim , Noam Hazon

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

We study a generic framework that provides a unified view on two important classes of problems: (i) extensions of the k-median problem where clients are interested in having multiple facilities in their vicinity (e.g., due to the fact that,…

Data Structures and Algorithms · Computer Science 2018-03-13 Jarosław Byrka , Piotr Skowron , Krzysztof Sornat

While proportionality is frequently named as a desirable property of voting rules, its interpretation in multiwinner voting differs significantly from that in apportionment. We aim to bridge these two distinct notions of proportionality by…

Computer Science and Game Theory · Computer Science 2026-02-11 Daria Boratyn , Dariusz Stolicki

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

Several multi-winner systems that use approval voting have been developed but they each suffer from various problems. Six of these methods are discussed in this paper. They are Satisfaction Approval Voting, Minimax Approval Voting,…

Computer Science and Game Theory · Computer Science 2016-03-17 Toby Pereira

A Ranked candidate voting method based on Phragmen's procedure is described that can be used to produce a top-down proportional candidate list. The method complies with the Droop proportionality criterion satisfied by Single Transferable…

Theoretical Economics · Economics 2026-04-14 Ross Hyman

Plurality and approval voting are two well-known voting systems with different strengths and weaknesses. In this paper we consider a new voting system we call beta(k) which allows voters to select a single first-choice candidate and approve…

Theoretical Economics · Economics 2020-06-02 Peter Butler , Jerry Lin

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

Computer Science and Game Theory · Computer Science 2019-01-23 Grzegorz Pierczyński , Piotr Skowron

Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…

Computer Science and Game Theory · Computer Science 2020-12-11 Haris Aziz , Barton E. Lee

We present the new Orthogonal Polynomials Approximation Algorithm (OPAA), a parallelizable algorithm that estimates probability distributions using functional analytic approach: first, it finds a smooth functional estimate of the…

Machine Learning · Computer Science 2024-01-23 Lilian W. Bialokozowicz

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…

Data Structures and Algorithms · Computer Science 2024-01-22 Lisa Hellerstein , Naifeng Liu , Kevin Schewior

Chance imbalance in baseline characteristics is common in randomized clinical trials. Regression adjustment such as the analysis of covariance (ANCOVA) is often used to account for imbalance and increase precision of the treatment effect…

Methodology · Statistics 2020-08-14 Shuxi Zeng , Fan Li , Rui Wang , Fan Li

This paper studies the allocation of voting weights in a committee representing groups of different sizes. We introduce a partial ordering of weight allocations based on stochastic comparison of social welfare. We show that when the number…

Theoretical Economics · Economics 2024-03-07 Kazuya Kikuchi

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

Computer Science and Game Theory · Computer Science 2023-07-19 Hari Sarang Nathan

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…

Computer Science and Game Theory · Computer Science 2025-02-06 Ildikó Schlotter , Katarína Cechlárová

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters
‹ Prev 1 2 3 10 Next ›