Piotr Faliszewski, Ph.D.

Affiliations: 
2009 University of Rochester, Rochester, NY 
Area:
Computer Science, Artificial Intelligence
Google:
"Piotr Faliszewski"

Parents

Sign in to add mentor
Lane A. Hemaspaandra grad student 2009 Rochester
 (Manipulation of elections: Algorithms and infeasibility results.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bredereck R, Faliszewski P, Niedermeier R, et al. (2020) Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting Theoretical Computer Science. 814: 86-105
Skowron P, Faliszewski P, Slinko AM. (2019) Axiomatic Characterization of Committee Scoring Rules Journal of Economic Theory. 180: 244-273
Gawron G, Faliszewski P. (2019) Robustness of Approval-Based Multiwinner Voting Rules Annales Des TéLéCommunications. 17-31
Skowron P, Faliszewski P. (2017) Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time Journal of Artificial Intelligence Research. 60: 687-716
Faliszewski P, Sawicki J, Schaefer R, et al. (2017) Multiwinner Voting in Genetic Algorithms Ieee Intelligent Systems. 32: 40-48
Faliszewski P, Smołka M, Schaefer R, et al. (2016) On the Computational Cost and Complexity of Stochastic Inverse Solvers Computer Science. 17: 225-264
Skowron P, Faliszewski P, Lang J. (2016) Finding a collective set of items Artificial Intelligence. 241: 191-216
Magiera K, Faliszewski P. (2016) How hard is control in single-crossing elections? Autonomous Agents and Multi-Agent Systems. 1-22
Put T, Faliszewski P. (2016) The complexity of voter control and shift bribery under parliament choosing rules Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9760: 29-50
Chen J, Faliszewski P, Niedermeier R, et al. (2015) Elections with few voters: Candidate control can be easy Proceedings of the National Conference On Artificial Intelligence. 3: 2045-2051
See more...