| How hard is bribery in elections P Faliszewski, E Hemaspaandra, L Hemaspaandra Journal of Artificial Intelligence Research 35 (1), 485-532, 2009 | 341* | 2009 |
| Llull and Copeland voting computationally resist bribery and constructive control P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Journal of Artificial Intelligence Research 35 (1), 275-341, 2009 | 316* | 2009 |
| Properties of multiwinner voting rules E Elkind, P Faliszewski, P Skowron, A Slinko Social Choice and Welfare 48, 599-632, 2017 | 314 | 2017 |
| Multiwinner voting: A new challenge for social choice theory P Faliszewski, P Skowron, A Slinko, N Talmon Trends in computational social choice 74 (2017), 27-47, 2017 | 297 | 2017 |
| AI’s war on manipulation: Are we winning P Faliszewski, AD Procaccia AI Magazine 31 (4), 53-64, 2010 | 232 | 2010 |
| Finding a collective set of items: From proportional multirepresentation to group recommendation P Skowron, P Faliszewski, J Lang Artificial Intelligence 241, 191-216, 2016 | 220 | 2016 |
| Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010 | 218 | 2010 |
| Control and Bribery in Voting. P Faliszewski, J Rothe, H Moulin Handbook of computational social choice, 146-168, 2016 | 212 | 2016 |
| The shield that never was: Societies with single-peaked preferences are more open to manipulation and control P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Information and Computation 209 (2), 89-107, 2011 | 178 | 2011 |
| Achieving fully proportional representation: Approximability results P Skowron, P Faliszewski, A Slinko Artificial Intelligence 222, 67-103, 2015 | 160* | 2015 |
| Swap bribery E Elkind, P Faliszewski, A Slinko Algorithmic Game Theory, 299-310, 2009 | 157 | 2009 |
| Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40 (1), 305-351, 2011 | 151 | 2011 |
| A richer understanding of the complexity of election systems P Faliszewski, E Hemaspaandra, L Hemaspaandra, J Rothe Fundamental Problems in Computing: Essays in Honor of Professor Daniel J …, 2009 | 136 | 2009 |
| Copeland voting: Ties matter P Faliszewski, E Hemaspaandra, H Schnoor Proceedings of the 7th international joint conference on Autonomous agents …, 2008 | 127 | 2008 |
| The complexity of manipulative attacks in nearly single-peaked electorates P Faliszewski, E Hemaspaandra, LA Hemaspaandra Arxiv preprint arXiv:1105.5032, 2011 | 120 | 2011 |
| Campaigns for lazy voters: truncated ballots. D Baumeister, P Faliszewski, J Lang, J Rothe AAMAS, 577-584, 2012 | 118 | 2012 |
| The complexity of fully proportional representation for single-crossing electorates P Skowron, L Yu, P Faliszewski, E Elkind Theoretical Computer Science 569, 43-57, 2015 | 104 | 2015 |
| A framework for approval-based budgeting methods N Talmon, P Faliszewski Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2181-2188, 2019 | 96 | 2019 |
| Manipulating the quota in weighted voting games M Zuckerman, P Faliszewski, Y Bachrach, E Elkind Artificial Intelligence 180, 1-19, 2012 | 96 | 2012 |
| Committee scoring rules: Axiomatic characterization and hierarchy P Faliszewski, P Skowron, A Slinko, N Talmon ACM Transactions on Economics and Computation (TEAC) 7 (1), 1-39, 2019 | 93* | 2019 |
Piotr SkowronUniversity of Warsawmimuw.edu.pl의 이메일 확인됨
