English
Related papers

Related papers: Properties of Egalitarian Sequences of Committees:…

200 papers

We study the election of sequences of committees, where in each of $\tau$ levels (e.g. modeling points in time) a committee consisting of $k$ candidates from a common set of $m$ candidates is selected. For each level, each of $n$ agents…

Computational Complexity · Computer Science 2023-06-27 Eva Michelle Deltl , Till Fluschnik , Robert Bredereck

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 consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

We consider the egalitarian welfare aspects of random assignment mechanisms when agents have unrestricted cardinal utilities over the objects. We give bounds on how well different random assignment mechanisms approximate the optimal…

Computer Science and Game Theory · Computer Science 2015-07-27 Haris Aziz , Jiashu Chen , Aris Filos-Ratsikas , Simon Mackenzie , Nicholas Mattei

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

Computer Science and Game Theory · Computer Science 2023-12-14 Markus Brill , Jannik Peters

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

Over the last few years, researchers have put significant effort into understanding of the notion of proportional representation in committee election. In particular, recently they have proposed the notion of proportionality degree. We…

Computer Science and Game Theory · Computer Science 2022-07-11 Łukasz Janeczko , Piotr Faliszewski

In this paper, we experimentally compare major approval-based multiwinner voting rules. To this end, we define a measure of similarity between two equal-sized committees subject to a given election. Using synthetic elections coming from…

Computer Science and Game Theory · Computer Science 2024-01-23 Piotr Faliszewski , Martin Lackner , Krzysztof Sornat , Stanisław Szufa

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

We consider the following problem in which a given number of items has to be chosen from a predefined set. Each item is described by a vector of attributes and for each attribute there is a desired distribution that the selected set should…

Artificial Intelligence · Computer Science 2021-03-29 Jerome Lang , Piotr Skowron

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

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2)…

Artificial Intelligence · Computer Science 2018-04-02 Haris Aziz

Committee scoring rules form a rich class of aggregators of voters' preferences for the purpose of selecting subsets of objects with desired properties, e.g., a shortlist of candidates for an interview, a representative collective body such…

Computer Science and Game Theory · Computer Science 2016-11-03 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

We present a new model that describes the process of electing a group of representatives (e.g., a parliament) for a group of voters. In this model, called the voting committee model, the elected group of representatives runs a number of…

Multiagent Systems · Computer Science 2016-11-22 Piotr Skowron

We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. To select the best possible committee, instead of voting for a candidate, a voter is allowed to approve…

Computer Science and Game Theory · Computer Science 2020-08-17 Venkateswara Rao Kagita , Arun K Pujari , Vineet Padmanabhan , Vikas Kumar

Egalitarian considerations play a central role in many areas of social choice theory. Applications of egalitarian principles range from ensuring everyone gets an equal share of a cake when deciding how to divide it, to guaranteeing balance…

Artificial Intelligence · Computer Science 2021-03-10 Sirin Botan , Ronald de Haan , Marija Slavkovik , Zoi Terzopoulou

We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a committee with maximal diversity given a scoring function (e.g. of…

Computer Science and Game Theory · Computer Science 2026-02-13 Paula Böhm , Robert Bredereck , Till Fluschnik

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that…

Computer Science and Game Theory · Computer Science 2016-04-07 Sylvain Bouveret , Michel Lemaître

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

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
‹ Prev 1 2 3 10 Next ›