NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (41)

cs.GT2018

Committee Scoring Rules: Axiomatic Characterization and Hierarchy

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +1

cs.GT2007

Copeland Voting Fully Resists Constructive Control

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1

cs.GT2007

Nonuniform Bribery

Piotr Faliszewski

cs.GT2013

Fully Proportional Representation as Resource Allocation: Approximability Results

Piotr Skowron, Piotr Faliszewski, Arkadii Slinko

cs.AI2017

Elections with Few Voters: Candidate Control Can Be Easy

Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier +1

cs.GT2014

Cloning in Elections: Finding the Possible Winners

Edith Elkind, Piotr Faliszewski, Arkadii Slinko

cs.GT2016

Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +1

cs.GT2017

The Complexity of Multiwinner Voting Rules with Variable Number of Winners

Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon

cs.GT2016

Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation

Piotr Skowron, Piotr Faliszewski, Jerome Lang

cs.GT2016

Axiomatic Characterization of Committee Scoring Rules

Piotr Skowron, Piotr Faliszewski, Arkadii Slinko

cs.MA2013

Achieving Fully Proportional Representation is Easy in Practice

Piotr Skowron, Piotr Faliszewski, Arkadii Slinko

cs.GT2011

Clone Structures in Voters' Preferences

Edith Elkind, Piotr Faliszewski, Arkadii Slinko

cs.GT2010

Multimode Control Attacks on Elections

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

cs.AI2013

Achieving Fully Proportional Representation: Approximability Results

Piotr Skowron, Piotr Faliszewski, Arkadii Slinko

cs.GT2015

Campaign Management under Approval-Driven Voting Rules

Ildikó Schlotter, Piotr Faliszewski, Edith Elkind

cs.GT2017

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality

Haris Aziz, Edith Elkind, Piotr Faliszewski +2

cs.GT2015

Properties of Multiwinner Voting Rules

Edith Elkind, Piotr Faliszewski, Piotr Skowron +1

cs.AI2018

A Framework for Approval-based Budgeting Methods

Piotr Faliszewski, Nimrod Talmon

cs.CC2008

The Complexity of Power-Index Comparison

Piotr Faliszewski, Lane A. Hemaspaandra

cs.DS2017

Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +2

cs.GT2008

How Hard Is Bribery in Elections?

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

cs.GT2019

What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain

Edith Elkind, Piotr Faliszewski, Jean-Francois Laslier +3

cs.MA2016

Prices Matter for the Parameterized Complexity of Shift Bribery

Robert Bredereck, Jiehua Chen, Piotr Faliszewski +2

cs.GT2014

Possible Winners in Noisy Elections

Krzysztof Wojtas, Krzysztof Magiera, Tomasz MiÄ sko +1

cs.GT2008

Llull and Copeland Voting Computationally Resist Bribery and Control

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1

cs.AI2018

Complexity of Shift Bribery in Committee Elections

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier +1

cs.DS2013

Approximating the MaxCover Problem with Bounded Frequencies in FPT Time

Piotr Skowron, Piotr Faliszewski

cs.GT2013

Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting

Piotr Faliszewski, Yannick Reisch, Jörg Rothe +1

cs.GT2006

A Richer Understanding of the Complexity of Election Systems

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1

cs.GT2010

Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type

Edith Elkind, Piotr Faliszewski, Arkadii Slinko

cs.CC2005

Open Questions in the Theory of Semifeasible Computation

Piotr Faliszewski, Lane A. Hemaspaandra

cs.MA2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

Robert Bredereck, Jiehua Chen, Piotr Faliszewski +3

cs.GT2010

Approximation Algorithms for Campaign Management

Edith Elkind, Piotr Faliszewski

cs.GT2019

Robustness Among Multiwinner Voting Rules

Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk +3

cs.GT2013

The Complexity of Fully Proportional Representation for Single-Crossing Electorates

Piotr Skowron, Lan Yu, Piotr Faliszewski +1

cs.CC2006

The Consequences of Eliminating NP Solutions

Piotr Faliszewski, Lane A. Hemaspaandra

cs.GT2017

Multiwinner Elections with Diversity Constraints

Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi +2

cs.GT2012

The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

cs.GT2016

Modeling Representation of Minorities Under Multiwinner Voting Rules

Piotr Faliszewski, Jean-Francois Laslier, Robert Schaefer +3

cs.MA2014

Combinatorial Voter Control in Elections

Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2

cs.GT2013

Weighted Electoral Control

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra