☰

Piotr Faliszewski, Ph.D. - Publications

Affiliations: 
2009 University of Rochester, Rochester, NY 
Area:
Computer Science, Artificial Intelligence
Tree Info Similar researchers PubMed Report error

45 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Bredereck R, Faliszewski P, Niedermeier R, Skowron P, Talmon N. Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting Theoretical Computer Science. 814: 86-105. DOI: 10.1016/J.Tcs.2020.01.017  0.41
2019 Skowron P, Faliszewski P, Slinko AM. Axiomatic Characterization of Committee Scoring Rules Journal of Economic Theory. 180: 244-273. DOI: 10.1016/J.Jet.2018.12.011  0.311
2019 Gawron G, Faliszewski P. Robustness of Approval-Based Multiwinner Voting Rules Annales Des TéLéCommunications. 17-31. DOI: 10.1007/978-3-030-31489-7_2  0.378
2017 Skowron P, Faliszewski P. Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time Journal of Artificial Intelligence Research. 60: 687-716. DOI: 10.1613/Jair.5628  0.407
2017 Faliszewski P, Sawicki J, Schaefer R, Smolka M. Multiwinner Voting in Genetic Algorithms Ieee Intelligent Systems. 32: 40-48. DOI: 10.1109/Mis.2017.5  0.347
2016 Faliszewski P, Smołka M, Schaefer R, Paszyński M. On the Computational Cost and Complexity of Stochastic Inverse Solvers Computer Science. 17: 225-264. DOI: 10.7494/Csci.2016.17.2.225  0.404
2016 Skowron P, Faliszewski P, Lang J. Finding a collective set of items Artificial Intelligence. 241: 191-216. DOI: 10.1016/J.Artint.2016.09.003  0.34
2016 Magiera K, Faliszewski P. How hard is control in single-crossing elections? Autonomous Agents and Multi-Agent Systems. 1-22. DOI: 10.1007/S10458-016-9339-3  0.44
2016 Put T, Faliszewski P. 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. DOI: 10.1007/978-3-662-52886-0_3  0.382
2015 Chen J, Faliszewski P, Niedermeier R, Talmon N. Elections with few voters: Candidate control can be easy Proceedings of the National Conference On Artificial Intelligence. 3: 2045-2051. DOI: 10.1613/Jair.5515  0.364
2015 Bredereck R, Faliszewski P, Niedermeier R, Talmon N. Large-scale election campaigns: Combinatorial shift bribery Proceedings of the International Joint Conference On Autonomous Agents and Multiagent Systems, Aamas. 1: 67-75. DOI: 10.1613/Jair.4927  0.441
2015 Skowron P, Faliszewski P, Slinko A. Achieving fully proportional representation: Approximability results Artificial Intelligence. 222: 67-103. DOI: 10.1016/J.Artint.2015.01.003  0.373
2015 Miasko T, Faliszewski P. The complexity of priced control in elections Annals of Mathematics and Artificial Intelligence. DOI: 10.1007/S10472-015-9478-2  0.43
2015 Elkind E, Faliszewski P, Slinko A. Distance rationalization of voting rules Social Choice and Welfare. 45: 345-377. DOI: 10.1007/S00355-015-0892-5  0.351
2015 Elkind E, Faliszewski P, Lackner M, Obraztsova S. The complexity of recognizing incomplete single-crossing preferences Proceedings of the National Conference On Artificial Intelligence. 2: 865-871.  0.326
2015 Skowron P, Faliszewski P. Fully proportional representation with approval ballots: Approximating the MaxCover problem with bounded frequencies in FPT time Proceedings of the National Conference On Artificial Intelligence. 3: 2124-2130.  0.306
2014 Bredereck R, Chen J, Faliszewski P, Guo J, Niedermeier R, Woeginger GJ. Parameterized algorithmics for computational social choice: Nine research challenges Tsinghua Science and Technology. 19: 358-373. DOI: 10.1109/Tst.2014.6867518  0.397
2014 Chen J, Faliszewski P, Niedermeier R, Talmon N. Combinatorial voter control in elections Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8635: 153-164. DOI: 10.1016/J.Tcs.2015.04.023  0.406
2014 Bredereck R, Chen J, Faliszewski P, Nichterlein A, Niedermeier R. Prices matter for the parameterized complexity of shift bribery Proceedings of the National Conference On Artificial Intelligence. 2: 1398-1404. DOI: 10.1016/J.Ic.2016.08.003  0.389
2014 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. The complexity of manipulative attacks in nearly single-peaked electorates Artificial Intelligence. 207: 69-99. DOI: 10.1016/J.Artint.2013.11.004  0.65
2014 Faliszewski P, Reisch Y, Rothe J, Schend L. Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting 13th International Conference On Autonomous Agents and Multiagent Systems, Aamas 2014. 2: 1357-1358. DOI: 10.1007/s10458-014-9277-x  0.32
2013 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. Weighted electoral control 12th International Conference On Autonomous Agents and Multiagent Systems 2013, Aamas 2013. 1: 367-374. DOI: 10.1613/Jair.4621  0.618
2013 Skowron P, Yu L, Faliszewski P, Elkind E. The complexity of fully proportional representation for single-crossing electorates Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8146: 1-12. DOI: 10.1016/J.Tcs.2014.12.012  0.427
2012 Zuckerman M, Faliszewski P, Bachrach Y, Elkind E. Manipulating the quota in weighted voting games Artificial Intelligence. 180: 1-19. DOI: 10.1016/J.Artint.2011.12.003  0.368
2012 Elkind E, Faliszewski P, Slinko A. Rationalizations of Condorcet-consistent rules via distances of hamming type Social Choice and Welfare. 39: 891-905. DOI: 10.1007/S00355-011-0555-0  0.336
2012 Baumeister D, Faliszewski P, Lang J, Rothe J. Campaigns for lazy voters: Truncated ballots 11th International Conference On Autonomous Agents and Multiagent Systems 2012, Aamas 2012: Innovative Applications Track. 1: 128-135.  0.369
2012 Wojtas K, Faliszewski P. Possible winners in noisy elections Proceedings of the National Conference On Artificial Intelligence. 2: 1499-1505.  0.334
2010 Faliszewski P, Procaccia AD. AI's war on manipulation: Are we winning? Ai Magazine. 31: 53-64. DOI: 10.1609/Aimag.V31I4.2314  0.349
2010 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. Using complexity to protect elections Communications of the Acm. 53: 74-82. DOI: 10.1145/1839676.1839696  0.616
2010 Bachrach Y, Betzler N, Faliszewski P. Probabilistic POSSIBLE WINNER determination Proceedings of the National Conference On Artificial Intelligence. 2: 697-702.  0.362
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. Multimode control attacks on elections Ijcai International Joint Conference On Artificial Intelligence. 128-133. DOI: 10.1613/Jair.3136  0.616
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. Multimode control attacks on elections Ijcai International Joint Conference On Artificial Intelligence. 128-133. DOI: 10.1613/jair.3136  0.586
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J. Llull and copeland voting computationally resist bribery and constructive control Journal of Artificial Intelligence Research. 35: 275-341. DOI: 10.1613/Jair.2697  0.602
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. How hard is bribery in elections Journal of Artificial Intelligence Research. 35: 485-532. DOI: 10.1613/Jair.2676  0.643
2009 Faliszewski P, Hemaspaandra L. Note: The complexity of power-index comparison Theoretical Computer Science. 410: 101-107. DOI: 10.1016/J.Tcs.2008.09.034  0.568
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J. The shield that never was: Societies with single-peaked preferences are more open to manipulation and control Proceedings of the 12th Conference On Theoretical Aspects of Rationality and Knowledge, Tark '09. 118-127. DOI: 10.1016/J.Ic.2010.09.001  0.637
2009 Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J. A richer understanding of the complexity of election systems Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz. 375-406. DOI: 10.1007/978-1-4020-9688-4_14  0.567
2008 Faliszewski P, Hemaspaandra LA. The consequences of eliminating NP solutions Computer Science Review. 2: 40-54. DOI: 10.1016/J.Cosrev.2008.02.001  0.572
2008 Faliszewski P, Hemaspaandra LA. The complexity of power-index comparison Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5034: 177-187. DOI: 10.1007/978-3-540-68880-8_18  0.55
2008 Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J. Copeland voting fully resists constructive control Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5034: 165-176. DOI: 10.1007/978-3-540-68880-8_17  0.489
2008 Faliszewski P. Nonuniform bribery Proceedings of the International Joint Conference On Autonomous Agents and Multiagent Systems, Aamas. 3: 1529-1532.  0.331
2007 Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J. Llull and Copeland voting broadly resist bribery and control Proceedings of the National Conference On Artificial Intelligence. 1: 724-730.  0.579
2006 Faliszewski P, Hemaspaandra L. Open questions in the theory of semifeasible computation Sigact News. 37: 47-65. DOI: 10.1145/1122480.1122495  0.523
2006 Faliszewski P, Hemaspaandra E, Hemaspaandra LA. The complexity of bribery in elections Proceedings of the National Conference On Artificial Intelligence. 1: 641-646.  0.62
2005 Faliszewski P, Hemaspaandra LA. Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties International Journal of Foundations of Computer Science. 16: 913-928. DOI: 10.1142/S0129054105003376  0.607
Show low-probability matches.