- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i18 |      | Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko: Achieving Fully Proportional Representation is Easy in Practice. CoRR abs/1301.6400 (2013) |
| 2012 | ||
| j16 | | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) |
| j15 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-consistent rules via distances of hamming type. Social Choice and Welfare 39(4): 891-905 (2012) |
| c31 | | |
| c30 | | Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe: Campaigns for lazy voters: truncated ballots. AAMAS 2012: 577-584 |
| c29 | | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323 |
| c28 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone structures in voters' preferences. ACM Conference on Electronic Commerce 2012: 496-513 |
| i17 | | Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko: Proportional Representation as Resource Allocation: Approximability Results. CoRR abs/1208.1661 (2012) |
| 2011 | ||
| j14 | | 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) |
| j13 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. J. Artif. Intell. Res. (JAIR) 40: 305-351 (2011) |
| j12 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. (JAIR) 42: 529-573 (2011) |
| c27 | | Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, Nicholas R. Jennings: Constrained Coalition Formation. AAAI 2011 |
| c26 | | Ildikó Schlotter, Piotr Faliszewski, Edith Elkind: Campaign Management under Approval-Driven Voting Rules. AAAI 2011 |
| c25 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 |
| c24 | | Yoram Bachrach, Edith Elkind, Piotr Faliszewski: Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 |
| c23 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 |
| c22 | | Michael Zuckerman, Piotr Faliszewski, Vincent Conitzer, Jeffrey S. Rosenschein: An NTU Cooperative Game Theoretic View of Manipulating Elections. WINE 2011: 363-374 |
| i16 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. CoRR abs/1105.5032 (2011) |
| i15 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011) |
| 2010 | ||
| j11 | | Piotr Faliszewski, Ariel D. Procaccia: AI's War on Manipulation: Are We Winning? AI Magazine 31(4): 53-64 (2010) |
| j10 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) |
| j9 | | Piotr Faliszewski, Mitsunori Ogihara: On the Autoreducibility of Functions. Theory Comput. Syst. 46(2): 222-245 (2010) |
| c21 | | Yoram Bachrach, Nadja Betzler, Piotr Faliszewski: Probabilistic Possible Winner Determination. AAAI 2010 |
| c20 | | |
| c19 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Good Rationalizations of Voting Rules. AAAI 2010 |
| c18 | | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Manipulation of copeland elections. AAMAS 2010: 367-374 |
| c17 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On the role of distances in defining voting rules. AAMAS 2010: 375-382 |
| c16 | | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. WINE 2010: 473-482 |
| i14 | | Edith Elkind, Piotr Faliszewski: Approximation Algorithms for Campaign Management. CoRR abs/1004.0334 (2010) |
| i13 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. CoRR abs/1007.1800 (2010) |
| i12 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. CoRR abs/1009.0300 (2010) |
| 2009 | ||
| j8 | | 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) |
| j7 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? J. Artif. Intell. Res. (JAIR) 35: 485-532 (2009) |
| j6 | | Piotr Faliszewski, Lane A. Hemaspaandra: The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009) |
| c15 | | Piotr Faliszewski, Edith Elkind, Michael Wooldridge: Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 |
| c14 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: Multimode Control Attacks on Elections. IJCAI 2009: 128-133 |
| c13 | | |
| c12 | | Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko: On distance rationalizability of some voting rules. TARK 2009: 108-117 |
| c11 | | 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 |
| i11 | | |
| i10 | | 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) |
| 2008 | ||
| j5 | | Piotr Faliszewski, Lane A. Hemaspaandra: The consequences of eliminating NP solutions. Computer Science Review 2(1): 40-54 (2008) |
| c10 | | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor: Approximability of Manipulating Elections. AAAI 2008: 44-49 |
| c9 | | Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind: Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220 |
| c8 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 |
| c7 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. AAIM 2008: 177-187 |
| c6 | | Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor: Copeland voting: ties matter. AAMAS (2) 2008: 983-990 |
| c5 | | |
| i9 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Complexity of Power-Index Comparison. CoRR abs/0801.4585 (2008) |
| i8 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Computationally Resist Bribery and Control. CoRR abs/0809.4484 (2008) |
| 2007 | ||
| j4 | | 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) |
| c4 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 |
| i7 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007) |
| i6 | | |
| 2006 | ||
| j3 | | Piotr Faliszewski, Lane A. Hemaspaandra: Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006) |
| c3 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: The Complexity of Bribery in Elections. AAAI 2006: 641-646 |
| c2 |  | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 |
| i5 | | Piotr Faliszewski, Lane A. Hemaspaandra: The Consequences of Eliminating NP Solutions. CoRR abs/cs/0606009 (2006) |
| i4 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra: How Hard Is Bribery in Elections? CoRR abs/cs/0608081 (2006) |
| i3 | | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: A Richer Understanding of the Complexity of Election Systems. CoRR abs/cs/0609112 (2006) |
| 2005 | ||
| j2 | | 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) |
| j1 | | Piotr Faliszewski, Janusz Jarosz: Properties of uniformly hard languages. Inf. Process. Lett. 95(1): 329-332 (2005) |
| c1 | | Piotr Faliszewski, Mitsunori Ogihara: Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315 |
| i2 | | Piotr Faliszewski, Lane A. Hemaspaandra: Open Questions in the Theory of Semifeasible Computation. CoRR abs/cs/0506082 (2005) |
| 2004 | ||
| i1 | | Piotr Faliszewski: Exponential time reductions and sparse languages in NEXP. Electronic Colloquium on Computational Complexity (ECCC)(064) (2004) |
| 1 | Yoram Bachrach | |
| 2 | Dorothea Baumeister | |
| 3 | Nadja Betzler | |
| 4 | Eric Brelsford | |
| 5 | Vincent Conitzer | |
| 6 | Edith Elkind | |
| 7 | Edith Hemaspaandra (Edith Spaan) | |
| 8 | Lane A. Hemaspaandra (Lane A. Hemachandra) | |
| 9 | Janusz Jarosz | |
| 10 | Nicholas R. Jennings (Nick R. Jennings) | |
| 11 | Jérôme Lang | |
| 12 | Tomasz P. Michalak | |
| 13 | Mitsunori Ogihara (Mitsunori Ogiwara) | |
| 14 | Ariel D. Procaccia | |
| 15 | Talal Rahwan | |
| 16 | Jeffrey S. Rosenschein | |
| 17 | Jörg Rothe | |
| 18 | Ildikó Schlotter | |
| 19 | Henning Schnoor | |
| 20 | Ilka Schnoor | |
| 21 | Piotr Skowron | |
| 22 | Arkadii M. Slinko | |
| 23 | Jacek Sroka | |
| 24 | Krzysztof Wojtas | |
| 25 | Michael Wooldridge (Michael J. Wooldridge) | |
| 26 | Michael Zuckerman |
Data released under the ODC-BY 1.0 license — See also our legal information page