English
Related papers

Related papers: Explanation Systems for Approval-Based Multiwinner…

200 papers

We study situations where a group of voters need to take a collective decision over a number of public issues, with the goal of getting a result that reflects the voters' opinions in a proportional manner. Our focus is on interconnected…

Computer Science and Game Theory · Computer Science 2025-09-25 Julian Chingoma , Umberto Grandi , Arianna Novaro

In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate $p$, and a budget. The goal is to ensure that $p$ wins by shifting $p$ higher in some voters' preference orders. However, each such…

Multiagent Systems · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Piotr Faliszewski , André Nichterlein , Rolf Niedermeier

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

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In multi-winner approval voting (AV), an agent submits a…

Computer Science and Game Theory · Computer Science 2020-12-08 Jaelle Scheuerman , Jason Harman , Nicholas Mattei , K. Brent Venable

Committee-selection problems arise in many contexts and applications, and there has been increasing interest within the social choice research community on identifying which properties are satisfied by different multi-winner voting rules.…

Artificial Intelligence · Computer Science 2025-08-11 Joshua Caiata , Ben Armstrong , Kate Larson

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

The legitimacy of bottom-up democratic processes for the distribution of public funds by policy-makers is challenging and complex. Participatory budgeting is such a process, where voting outcomes may not always be fair or inclusive.…

Multiagent Systems · Computer Science 2023-07-25 Srijoni Majumdar , Evangelos Pournaras

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…

Computer Science and Game Theory · Computer Science 2023-09-22 Martin Lackner , Piotr Skowron

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

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

We consider the problem of finding a compromise between the opinions of a group of individuals on a number of mutually independent, binary topics. In this paper, we quantify the loss in representativeness that results from requiring the…

Machine Learning · Computer Science 2023-10-30 Robin Fritsch , Roger Wattenhofer

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 consider the problem of subset selection where one is given multiple rankings of items and the goal is to select the highest ``quality'' subset. Score functions from the multiwinner voting literature have been used to aggregate rankings…

Computers and Society · Computer Science 2023-06-19 Niclas Boehmer , L. Elisa Celis , Lingxiao Huang , Anay Mehrotra , Nisheeth K. Vishnoi

Electing a committee of size k from m alternatives (k < m) is an interesting problem under the multi-winner voting rules. However, very few committee selection rules found in the literature consider the coalitional possibilities among the…

Theoretical Economics · Economics 2023-08-08 Ritu Dutta , Rajnish Kumnar , Surajit Borkotokey

We introduce a general problem about bribery in voting systems. In the $\mathcal{R}$-Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate wins the perturbed election under the voting rule…

Data Structures and Algorithms · Computer Science 2018-12-06 Dušan Knop , Martin Koutecký , Matthias Mnich

Ranking functions that are used in decision systems often produce disparate results for different populations because of bias in the underlying data. Addressing, and compensating for, these disparate outcomes is a critical problem for fair…

Machine Learning · Computer Science 2024-04-23 Abraham Gale , Amélie Marian

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 study a class of elections in which the input format is trichotomous and allows voters to elicit their negative feelings explicitly. In particular, we study multiwinner elections with a special proclivity to elect proportionally…

Computer Science and Game Theory · Computer Science 2021-01-14 Nimrod Talmon , Rutvik Page
‹ Prev 1 3 4 5 6 7 10 Next ›