关注
Piotr Faliszewski
标题
引用次数
引用次数
年份
How hard is bribery in elections
P Faliszewski, E Hemaspaandra, L Hemaspaandra
Journal of Artificial Intelligence Research 35 (1), 485-532, 2009
311*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
291*2009
Properties of multiwinner voting rules
E Elkind, P Faliszewski, P Skowron, A Slinko
Social Choice and Welfare 48 (3), 599-632, 2017
2432017
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
2242017
AI’s war on manipulation: Are we winning
P Faliszewski, AD Procaccia
AI Magazine 31 (4), 53-64, 2010
2162010
Using complexity to protect elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Communications of the ACM 53 (11), 74-82, 2010
2022010
Finding a collective set of items: From proportional multirepresentation to group recommendation
P Skowron, P Faliszewski, J Lang
Artificial Intelligence 241, 191-216, 2016
1842016
Control and Bribery in Voting.
P Faliszewski, J Rothe
Handbook of computational social choice, 146-168, 2016
1702016
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
1632011
Achieving fully proportional representation: Approximability results
P Skowron, P Faliszewski, A Slinko
Artificial Intelligence 222, 67-103, 2015
143*2015
Multimode control attacks on elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 40 (1), 305-351, 2011
1422011
Swap bribery
E Elkind, P Faliszewski, A Slinko
Algorithmic Game Theory, 299-310, 2009
1402009
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
1322009
Copeland voting: Ties matter
P Faliszewski, E Hemaspaandra, H Schnoor
Proceedings of the 7th international joint conference on Autonomous agents …, 2008
1252008
The complexity of manipulative attacks in nearly single-peaked electorates
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Arxiv preprint arXiv:1105.5032, 2011
1092011
Campaigns for lazy voters: Truncated ballots
D Baumeister, P Faliszewski, J Lang, J Rothe
1002012
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
962015
Manipulating the quota in weighted voting games
M Zuckerman, P Faliszewski, Y Bachrach, E Elkind
Artificial Intelligence 180, 1-19, 2012
84*2012
Constrained coalition formation
T Rahwan, TP Michalak, E Elkind, P Faliszewski, J Sroka, M Wooldridge, ...
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
822011
Cloning in elections: Finding the possible winners
E Elkind, P Faliszewski, A Slinko
Journal of Artificial Intelligence Research 42 (1), 529-573, 2011
81*2011
系统目前无法执行此操作,请稍后再试。
文章 1–20