English
Related papers

Related papers: A House Monotone, Coherent, and Droop Proportional…

200 papers

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

Computer Science and Game Theory · Computer Science 2025-12-05 Jannik Peters

To aggregate rankings into a social ranking, one can use scoring systems such as Plurality, Veto, and Borda. We distinguish three types of methods: ranking by score, ranking by repeatedly choosing a winner that we delete and rank at the…

Computer Science and Game Theory · Computer Science 2022-09-20 Niclas Boehmer , Robert Bredereck , Dominik Peters

We propose the maximin support method, a novel extension of the D'Hondt apportionment method to approval-based multiwinner elections. The maximin support method is based on maximizing the support of the least supported elected candidate. It…

Computer Science and Game Theory · Computer Science 2018-09-07 Luis Sánchez-Fernández , Norberto Fernández , Jesús A. Fisteus , Markus Brill

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

We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

Computer Science and Game Theory · Computer Science 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

Consider the decision-making setting where agents elect a panel by expressing both positive and negative preferences. Prominently, in constitutional AI, citizens democratically select a slate of ethical preferences on which a foundation…

Computer Science and Game Theory · Computer Science 2025-03-05 Sonja Kraiczy , Georgios Papasotiropoulos , Grzegorz Pierczyński , Piotr Skowron

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á

Majority voting is considered an effective method to enhance chain-of-thought reasoning, as it selects the answer with the highest "self-consistency" among different reasoning paths (Wang et al., 2023). However, previous chain-of-thought…

Computation and Language · Computer Science 2025-05-19 Weiqin Wang , Yile Wang , Hui Huang

Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voters to rank all candidates. We suggest to fix a rank k, to ask…

Computer Science and Game Theory · Computer Science 2020-02-17 Manel Ayadi , Nahla Ben amor , Jérôme Lang

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

Computer Science and Game Theory · Computer Science 2025-08-04 Matthew M. Casey , Edith Elkind

Many democratic political parties hold primary elections, which nicely reflects their democratic nature and promote, among other things, the democratic value of inclusiveness. However, the methods currently used for holding such primary…

Multiagent Systems · Computer Science 2022-01-20 Ariel Rosenfeld , Ehud Shapiro , Nimrod Talmon

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

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 conjecture that Borda count is the ranked choice voting method that best preserves the outcome of an election with randomly corrupted votes, among all fair voting methods with small influences satisfying the Condorcet Loser Criterion.…

Computer Science and Game Theory · Computer Science 2022-09-23 Steven Heilman

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

We evaluate the tendency for different voting methods to promote political compromise and reduce tensions in a society by using computer simulations to determine which voters candidates are incentivized to appeal to. We find that Instant…

General Economics · Economics 2024-04-04 Marcus Ogren
‹ Prev 1 2 3 10 Next ›