P
Piotr Skowron
Researcher at University of Warsaw
Publications - 128
Citations - 3145
Piotr Skowron is an academic researcher from University of Warsaw. The author has contributed to research in topics: Voting & Approval voting. The author has an hindex of 28, co-authored 123 publications receiving 2498 citations. Previous affiliations of Piotr Skowron include Technical University of Berlin & University of Oxford.
Papers
More filters
Proceedings ArticleDOI
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant.
TL;DR: This work explores continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules, which represent two extremes of the multiwinner world.
Proceedings ArticleDOI
Achieving fully proportional representation is easy in practice
TL;DR: Experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules show that even very simple and fast algorithms can in many cases find near-perfect solutions.
Proceedings ArticleDOI
Stable Marriage with Multi-Modal Preferences
TL;DR: In this paper, a generalized version of the Stable marriage problem based on multi-modal preference lists is studied, where each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way.
Posted Content
Proportionality Degree of Multiwinner Rules.
TL;DR: This work investigates a number of election rules and investigates whether the committees that they return represent the voters proportionally, and measures the tradeoff between proportionality and utilitarian efficiency for a broad subclass of committee election rules.
Proceedings Article
Fully proportional representation with approval ballots: approximating the maxcover problem with bounded frequencies in FPT time
Piotr Skowron,Piotr Faliszewski +1 more
TL;DR: In this article, the authors considered the problem of winner determination under Chamberlin-Courant's multiwinner voting rule with approval utilities and showed an exponential-time/FPT approximation algorithm that achieves arbitrarily good approximation ratios and running times much better than known exact algorithms.