English
Related papers

Related papers: Core-Stable Committees under Restricted Domains

200 papers

Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setting where voters either approve or disapprove of each…

Computer Science and Game Theory · Computer Science 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

In an approval-based committee election, the task is to select a committee of up to $k$ candidates from a set of $m$ candidates based on the preferences of $n$ voters, each of whom approves a subset of the candidates. A central open…

Computer Science and Game Theory · Computer Science 2026-05-08 Patrick Becker , Matthias Greger , Dominik Peters

Motivated by civic problems such as participatory budgeting and multiwinner elections, we consider the problem of public good allocation: Given a set of indivisible projects (or candidates) of different sizes, and voters with different…

Computer Science and Game Theory · Computer Science 2021-10-26 Kamesh Munagala , Yiheng Shen , Kangning Wang , Zhiyi Wang

In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all…

Computer Science and Game Theory · Computer Science 2019-05-14 Yu Cheng , Zhihao Jiang , Kamesh Munagala , Kangning Wang

In social choice there often arises a conflict between the majority principle (the search for a candidate that is as good as possible for as many voters as possible), and the protection of minority rights (choosing a candidate that is not…

Computer Science and Game Theory · Computer Science 2023-04-06 Egor Ianovski , Aleksei Y. Kondratev

We consider the participatory budgeting problem where each of $n$ voters specifies additive utilities over $m$ candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most…

Computer Science and Game Theory · Computer Science 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang

In an approval-based committee election, the goal is to select a committee consisting of $k$ out of $m$ candidates, based on $n$ voters who each approve an arbitrary number of the candidates. The core of such an election consists of all…

Computer Science and Game Theory · Computer Science 2025-05-15 Dominik Peters

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

We study committee voting rules under ranked preferences, which map the voters' preference relations to a subset of the alternatives of predefined size. In this setting, the compatibility between proportional representation and committee…

Computer Science and Game Theory · Computer Science 2025-03-11 Haris Aziz , Patrick Lederer , Dominik Peters , Jannik Peters , Angus Ritossa

Many hard computational social choice problems are known to become tractable when voters' preferences belong to a restricted domain, such as those of single-peaked or single-crossing preferences. However, to date, all algorithmic results of…

Computer Science and Game Theory · Computer Science 2016-02-12 Edith Elkind , Martin Lackner

Social choice becomes easier on restricted preference domains such as single-peaked, single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the structure makes it easier to reason about preferences, and…

Computer Science and Game Theory · Computer Science 2025-03-25 Edith Elkind , Martin Lackner , Dominik Peters

We consider the multiwinner election problem where the goal is to choose a committee of $k$ candidates given the voters' utility functions. We allow arbitrary additional constraints on the chosen committee, and the utilities of voters to…

Computer Science and Game Theory · Computer Science 2023-05-05 Ivan-Aleksandar Mavrov , Kamesh Munagala , Yiheng Shen

In the committee selection problem, we are given $m$ candidates, and $n$ voters. Candidates can have different weights. A committee is a subset of candidates, and its weight is the sum of weights of its candidates. Each voter expresses an…

Computer Science and Game Theory · Computer Science 2020-04-28 Zhihao Jiang , Kamesh Munagala , Kangning Wang

We consider the problem of fairly allocating indivisible public goods. We model the public goods as elements with feasibility constraints on what subsets of elements can be chosen, and assume that agents have additive utilities across…

Computer Science and Game Theory · Computer Science 2018-05-10 Brandon Fain , Kamesh Munagala , Nisarg Shah

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Computer Science and Game Theory · Computer Science 2017-01-30 Haris Aziz , Edith Elkind , Piotr Faliszewski , Martin Lackner , Piotr Skowron

We study fairness in social choice settings under single-peaked preferences. Construction and characterization of social choice rules in the single-peaked domain has been extensively studied in prior works. In fact, in the single-peaked…

Computer Science and Game Theory · Computer Science 2022-07-19 Gogulapati Sreedurga , Soumyarup Sadhukhan , Souvik Roy , Yadati Narahari

In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating the preferences of community members to determine an…

Computer Science and Game Theory · Computer Science 2016-10-17 Brandon Fain , Ashish Goel , Kamesh Munagala

The core is a central concept in multi-winner social choice, ensuring that no coalition of voters can support an alternative outcome whose size or cost exceeds the group's share of the electorate. This idea originates from the Lindahl…

Computer Science and Game Theory · Computer Science 2026-03-05 Haoyu Song , Thanh Nguyen

In this paper, we study voting rules on the interval domain, where the alternatives are arranged according to an externally given strict total order and voters report intervals of this order to indicate the alternatives they support. For…

Theoretical Economics · Economics 2025-09-08 Patrick Lederer
‹ Prev 1 2 3 10 Next ›