![]() | ![]() |
| 2012 | ||
|---|---|---|
| 58 | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) | |
| 2011 | ||
| 57 | Ildikó Schlotter, Piotr Faliszewski, Edith Elkind: Campaign Management under Approval-Driven Voting Rules. AAAI 2011 | |
| 56 | Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, Nicholas R. Jennings: Constrained Coalition Formation. AAAI 2011 | |
| 55 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 | |
| 54 | Yoram Bachrach, Edith Elkind, Piotr Faliszewski: Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 | |
| 53 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 | |
| 52 | Michael Zuckerman, Piotr Faliszewski, Vincent Conitzer, Jeffrey S. Rosenschein: An NTU Cooperative Game Theoretic View of Manipulating Elections. WINE 2011: 363-374 | |
| 51 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates CoRR abs/1105.5032: (2011) | |
| 50 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone Structures in Voters' Preferences CoRR abs/1110.3939: (2011) | |
| 49 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2): 89-107 (2011) | |
| 48 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. J. Artif. Intell. Res. (JAIR) 40: 305-351 (2011) | |
| 47 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. (JAIR) 42: 529-573 (2011) | |
| 2010 | ||
| 46 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections. AAAI 2010 | |
| 45 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Good Rationalizations of Voting Rules. AAAI 2010 | |
| 44 | Yoram Bachrach, Nadja Betzler, Piotr Faliszewski: Probabilistic Possible Winner Determination. AAAI 2010 | |
| 43 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Manipulation of copeland elections. AAMAS 2010: 367-374 | |
| 42 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On the role of distances in defining voting rules. AAMAS 2010: 375-382 | |
| 41 | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. WINE 2010: 473-482 | |
| 40 | Piotr Faliszewski, Ariel D. Procaccia: AI's War on Manipulation: Are We Winning? AI Magazine 31(4): 53-64 (2010) | |
| 39 | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management CoRR abs/1004.0334: (2010) | |
| 38 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections CoRR abs/1007.1800: (2010) | |
| 37 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type CoRR abs/1009.0300: (2010) | |
| 36 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) | |
| 35 | Piotr Faliszewski, Mitsunori Ogihara: On the Autoreducibility of Functions. Theory Comput. Syst. 46(2): 222-245 (2010) | |
| 2009 | ||
| 34 | Piotr Faliszewski, Edith Elkind, Michael Wooldridge: Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 | |
| 33 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133 | |
| 32 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery. SAGT 2009: 299-310 | |
| 31 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On distance rationalizability of some voting rules. TARK 2009: 108-117 | |
| 30 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009: 118-127 | |
| 29 | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Swap Bribery CoRR abs/0905.3885: (2009) | |
| 28 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control CoRR abs/0909.3257: (2009) | |
| 27 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. (JAIR) 35: 275-341 (2009) | |
| 26 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? J. Artif. Intell. Res. (JAIR) 35: 485-532 (2009) | |
| 25 | Piotr Faliszewski, Lane A. Hemaspaandra: The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009) | |
| 2008 | ||
| 24 | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220 | |
| 23 | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49 | |
| 22 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 | |
| 21 | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. AAIM 2008: 177-187 | |
| 20 | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990 | |
| 19 | Piotr Faliszewski: Nonuniform bribery. AAMAS (3) 2008: 1569-1572 | |
| 18 | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison CoRR abs/0801.4585: (2008) | |
| 17 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control CoRR abs/0809.4484: (2008) | |
| 16 | Piotr Faliszewski, Lane A. Hemaspaandra: The consequences of eliminating NP solutions. Computer Science Review 2(1): 40-54 (2008) | |
| 2007 | ||
| 15 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 | |
| 14 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control CoRR abs/0711.4759: (2007) | |
| 13 | Piotr Faliszewski: Nonuniform Bribery CoRR abs/0711.4924: (2007) | |
| 12 | Piotr Faliszewski: Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages. SIGACT News 38(2): 20-22 (2007) | |
| 2006 | ||
| 11 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006: 641-646 | |
| 10 | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 | |
| 9 | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions CoRR abs/cs/0606009: (2006) | |
| 8 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081: (2006) | |
| 7 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: A Richer Understanding of the Complexity of Election Systems CoRR abs/cs/0609112: (2006) | |
| 6 | Piotr Faliszewski, Lane A. Hemaspaandra: Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006) | |
| 2005 | ||
| 5 | Piotr Faliszewski, Mitsunori Ogihara: Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315 | |
| 4 | Piotr Faliszewski, Lane A. Hemaspaandra: Open Questions in the Theory of Semifeasible Computation CoRR abs/cs/0506082: (2005) | |
| 3 | Piotr Faliszewski, Janusz Jarosz: Properties of uniformly hard languages. Inf. Process. Lett. 95(1): 329-332 (2005) | |
| 2 | Piotr Faliszewski, Lane A. Hemaspaandra: Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. Int. J. Found. Comput. Sci. 16(5): 913-928 (2005) | |
| 2004 | ||
| 1 | Piotr Faliszewski: Exponential time reductions and sparse languages in NEXP Electronic Colloquium on Computational Complexity (ECCC)(064): (2004) | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page