P
Piotr Faliszewski
Researcher at AGH University of Science and Technology
Publications - 215
Citations - 7486
Piotr Faliszewski is an academic researcher from AGH University of Science and Technology. The author has contributed to research in topics: Voting & Condorcet method. The author has an hindex of 46, co-authored 198 publications receiving 6737 citations. Previous affiliations of Piotr Faliszewski include Humboldt University of Berlin & University of Rochester.
Papers
More filters
Proceedings ArticleDOI
On swap-distance geometry of voting rules
TL;DR: This paper views a voting rule as a (multi-)coloring of the election graph - the graph whose vertices are elections over a given set of candidates, and two Vertices are adjacent if they can be obtained from each other by swapping adjacent candidates in one of the votes.
Journal ArticleDOI
The complexity of priced control in elections
Tomasz Miasko,Piotr Faliszewski +1 more
TL;DR: It is shown that for four prominent voting rules (plurality, approval, Condorcet, and Copeland) introducing prices does not increase the complexity of control by adding/deleting candidates/voters.
Journal ArticleDOI
Elections with Few Voters: Candidate Control Can Be Easy
TL;DR: Considering several fundamental voting rules, the results show that the parameterized complexity of candidate control, with the number of voters as the parameter, is much more varied than in the setting with many voters.
Book ChapterDOI
Noncooperative Game Theory
TL;DR: By playing a game the authors here mean, in general, an interaction under preassigned rules, amongst several players each interested in maximizing their gains and acting strategically to this end.
Posted Content
Achieving Fully Proportional Representation is Easy in Practice
TL;DR: In this paper, the authors provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules, conducted both on real-life preferenceaggregation data and on synthetic data, show that even very simple and fast algorithms can in many cases find near-perfect solutions.