no code implementations • 14 Feb 2022 • Virginie Do, Matthieu Hervouin, Jérôme Lang, Piotr Skowron
Assume $k$ candidates need to be selected.
no code implementations • 4 Aug 2021 • Grzegorz Pierczyński, Piotr Skowron
We show that for a number of restricted domains including voter-interval, candidate-interval, single-peaked, and single-crossing preferences the core is non-empty and can be found in polynomial time.
no code implementations • 19 Apr 2021 • Piotr Faliszewski, Piotr Skowron, Nimrod Talmon
We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i. e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval from a vote, or moving an approval within a vote from one candidate to the other.
1 code implementation • 3 Jul 2020 • Martin Lackner, Piotr Skowron
The goal of this book is to present fundamental concepts and results for ABC voting and to discuss the recent advances in computational social choice.
Computer Science and Game Theory
1 code implementation • 26 Nov 2019 • Dominik Peters, Piotr Skowron
By proposing two new proportionality axioms (laminar proportionality and priceability) satisfied by Phragm\'en but not Thiele, we show that the two rules achieve two distinct forms of proportional representation.
Computer Science and Game Theory Theoretical Economics
2 code implementations • 4 Jan 2018 • Martin Lackner, Piotr Skowron
To choose a suitable multiwinner voting rule is a hard and ambiguous task.
no code implementations • 5 Dec 2016 • Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind
In this paper we extend the principle of proportional representation to rankings.
no code implementations • 26 Nov 2016 • Markus Brill, Jean-François Laslier, Piotr Skowron
We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment.
no code implementations • 11 Sep 2015 • Jerome Lang, Piotr Skowron
We consider the following problem in which a given number of items has to be chosen from a predefined set.
no code implementations • 13 Feb 2014 • Piotr Skowron, Piotr Faliszewski, Jerome Lang
We consider the following problem: There is a set of items (e. g., movies) and a group of agents (e. g., passengers on a plane); each agent has some intrinsic utility for each of the items.
no code implementations • 14 Dec 2013 • Piotr Skowron, Piotr Faliszewski, Arkadii Slinko
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 representatives.