English
Related papers

Related papers: Voting for Committees in Agreeable Societies

200 papers

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

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

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

Computer Science and Game Theory · Computer Science 2022-11-28 Kunal Relia

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

When voter preferences are known in an incomplete (partial) manner, winner determination is commonly treated as the identification of the necessary and possible winners; these are the candidates who win in all completions or at least one…

Computer Science and Game Theory · Computer Science 2020-02-24 Aviram Imber , Benny Kimelfeld

In a recently introduced model of successive committee elections (Bredereck et al., AAAI-20) for a given set of ordinal or approval preferences one aims to find a sequence of a given length of "best" same-size committees such that each…

Computer Science and Game Theory · Computer Science 2025-05-27 Pallavi Jain , Andrzej Kaczmarczyk

We consider Approval Voting systems where each voter decides on a subset to candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k minimizing the maximal Hamming distance from a vote. In…

Data Structures and Algorithms · Computer Science 2016-06-23 Jaroslaw Byrka , Krzysztof Sornat

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

We consider many-to-one matching problems, where one side corresponds to applicants who have preferences and the other side to houses who do not have preferences. We consider two different types of this market: one, where the applicants…

Computer Science and Game Theory · Computer Science 2024-03-04 Gergely Csáji

Assessing and comparing the security level of different voting systems is non-trivial as the technical means provided for and societal assumptions made about various systems differ significantly. However, trust assumptions concerning the…

Cryptography and Security · Computer Science 2023-09-20 Kristjan Krips , Nikita Snetkov , Jelizaveta Vakarjuk , Jan Willemson

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

Consideration was given to a model of social dynamics controlled by successive collective decisions based on the threshold majority procedures. The current system state is characterized by the vector of participants' capitals (utilities).…

Optimization and Control · Mathematics 2009-02-27 V. I. Borzenko , Z. M. Lezina , A. K. Loginov , Ya. Yu. Tsodikova , P. Yu. Chebotarev

We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We consider a family of Thiele rules, their greedy variants,…

Computer Science and Game Theory · Computer Science 2023-05-04 Łukasz Janeczko , Piotr Faliszewski

Emerging methods for participatory algorithm design have proposed collecting and aggregating individual stakeholder preferences to create algorithmic systems that account for those stakeholders' values. Using algorithmic student assignment…

Computers and Society · Computer Science 2020-07-15 Samantha Robertson , Niloufar Salehi

We study the problem of assigning jobs to applicants. Each applicant has a weight and provides a preference list ranking a subset of the jobs. A matching M is popular if there is no other matching M' such that the weight of the applicants…

Data Structures and Algorithms · Computer Science 2007-07-05 Julián Mestre

In many circumstances there is a trade off between the number of voters and the time they can be given before having to make a decision since both aspects are costly. An example is the hiring of a committee with a fixed salary budget: more…

Theoretical Economics · Economics 2024-04-16 Gustaf Arrhenius , Klas Markström

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

We study the formation of public opinion in a poll process where the current score is open to public. The voters are assumed to vote probabilistically for or against their own preference considering the group opinion collected up to then in…

Physics and Society · Physics 2018-05-23 Hyun Keun Lee , Yong Woon Kim

A cornerstone of social choice theory is Condorcet's paradox which says that in an election where $n$ voters rank $m$ candidates it is possible that, no matter which candidate is declared the winner, a majority of voters would have…

Computer Science and Game Theory · Computer Science 2025-04-23 Moses Charikar , Alexandra Lassota , Prasanna Ramakrishnan , Adrian Vetta , Kangning Wang

In participatory budgeting we are given a set of projects---each with a cost, an available budget, and a set of voters who in some form express their preferences over the projects. The goal is to select---based on voter preferences---a…

Multiagent Systems · Computer Science 2020-09-08 Piotr Skowron , Arkadii Slinko , Stanisław Szufa , Nimrod Talmon
‹ Prev 1 4 5 6 7 8 10 Next ›