English
Related papers

Related papers: Voting for Committees in Agreeable Societies

200 papers

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

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

Let $v(n)$ be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on $n$ candidates. Let $k=\lfloor \log_2 n\rfloor$. We show that $v(n)\le n-k$ if $n$ and…

Combinatorics · Mathematics 2012-06-06 M. A. Fiol

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

Given the stated preferences of several people over a number of proposals regarding public policy initiatives, some of those proposals might be judged to be more ``divisive'' than others. When designing online participatory platforms to…

Computer Science and Game Theory · Computer Science 2026-01-01 Ulle Endriss

A "repeat voting" procedure is proposed, whereby voting is carried out in two identical rounds. Every voter can vote in each round, the results of the first round are made public before the second round, and the final result is determined…

Theoretical Economics · Economics 2022-11-30 Sergiu Hart

The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…

Probability · Mathematics 2020-06-02 John Fernley , Marcel Ortgiese

We analyze the structure of the disagreement among a population of voters over a set of alternatives. Surveys typically ask either for pairwise comparisons, simple and intuitive for participants, or full rankings over alternatives,…

Artificial Intelligence · Computer Science 2026-05-20 Mohamed Ouaguenouni , Felipe Garrido-Lucero , Umberto Grandi , César Hidalgo , Magdalena Tydrichova

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

In this short note, we describe an approval-based committee selection rule that admits a polynomial-time algorithm and satisfies the Extended Justified Representation (EJR) axiom. This rule is based on approximately maximizing the PAV…

Computer Science and Game Theory · Computer Science 2017-04-04 Piotr Skowron , Martin Lackner , Edith Elkind , Luis Sánchez-Fernández

The outcomes of democratic elections rest on individuals' decision-making that is driven by their varying preferences and beliefs. Individuals may prefer consensus to gridlock, or gridlock to consensus, and information may be fractured via…

Physics and Society · Physics 2024-10-29 Jonathan Engle , Bryce Morsky

We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to…

Computer Science and Game Theory · Computer Science 2018-11-14 Till Fluschnik , Piotr Skowron , Mervin Triphaus , Kai Wilker

We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied $\mathbb{Q}S_n$-modules. By using only a handful of simple combinatorial objects (e.g., tabloids) and…

Representation Theory · Mathematics 2007-12-19 Zajj Daugherty , Alexander K. Eustis , Gregory Minton , Michael E. Orrison

In many real-world applications of committee elections, the candidates are associated with certain attributes and the chosen committee is required to satisfy some constraints posed on the candidate attributes. For instance, when dress…

Computational Complexity · Computer Science 2024-05-09 Aizhong Zhou , Fengbo Wang , Jiong Guo

Academic research in recommender systems has been greatly focusing on the accuracy-related measures of recommendations. Even when non-accuracy measures such as popularity bias, diversity, and novelty are studied, it is often solely from the…

Information Retrieval · Computer Science 2020-07-03 Himan Abdollahpouri , Masoud Mansoury

The study of fairness in multiwinner elections focuses on settings where candidates have attributes. However, voters may also be divided into predefined populations under one or more attributes (e.g., "California" and "Illinois" populations…

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

The input of the popular roommates problem consists of a graph $G = (V, E)$ and for each vertex $v\in V$, strict preferences over the neighbors of $v$. Matching $M$ is more popular than $M'$ if the number of vertices preferring $M$ to $M'$…

Discrete Mathematics · Computer Science 2021-07-15 Erika Bérczi-Kovács , Ágnes Cseh , Kata Kosztolányi , Attila Mályusz

We study an outcome of a vote in a population of voters exposed to an externally applied bias in favour of one of two potential candidates. The population consists of ordinary individuals, that are in majority and tend to align their…

Statistical Mechanics · Physics 2017-03-31 V. S. Dotsenko , C. Mejía-Monasterio , G. Oshanin

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

Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum number of correspondingly agents/houses that can be matched to…

Data Structures and Algorithms · Computer Science 2011-01-04 Katarzyna Paluch