Introduction

My research focus is on the following fields: computational social choice; preference aggregation; complexity of elections; algorithms and complexity. I am particularly interested in ideas, concepts, and research spanning and linking all these areas. I also enjoy structural complexity theory work and I pursue this direction of study as well.

Publications

My work:

2008

  • On the Complexity of Power-Index Comparison, P. Faliszewski, L. Hemaspaadnra, Theoretical Computer Science, accepted.
  • Approximability of Manipulating Elections, E. Brelsford, P. Faliszewski, E. Hemaspaadnra, I. Schnoor, and H. Schnoor, AAAI-08, to appear.
  • Manipulating Quota in Weighted Voting Games, M. Zuckerman, P. Faliszewski, Y. Bachrach, E. Elkind, AAAI-08, to appear.
  • The Consequences of Eliminating NP Solutions, P. Faliszewski, L. Hemaspaandra, Computer Science Review, Vol. 2,1, pp. 40--54, 2008.
  • On the Autoreducibility of Functions, P. Faliszewski, M. Ogihara, Theory of Computing Systems, accepted.
  • The Complexity of Power-Index Comparison, P. Faliszewski, L. Hemaspaandra, AAIM-08.
  • Copeland Voting Fully Resists Constructive Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe, AAIM-08.
  • The Complexity of Power-Index Comparison, P. Faliszewski, L. Hemaspaandra, URCS TR-929.
  • Copeland Voting: Ties Matter, P. Faliszewski, E. Hemaspaandra, and H. Schnoor, AAMAS-08.
  • Nonunform Bribery, P. Faliszewski, AAMAS-08.

2007

  • Copeland Voting: Ties Matter, P. Faliszewski, E. Hemaspaandra, and H. Schnoor, URCS TR-926.
  • Copeland Voting Fully Resists Constructive Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe, URCS TR-923. (Full version will subsume TR-913 and TR-923.)
  • Nonunform Bribery, P. Faliszewski, URCS TR-922.
  • Llull and Copeland Voting Broadly Resist Bribery and Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe, AAAI-2007.
  • Llull and Copeland Voting Broadly Resist Bribery and Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe, URCS TR-913. (Full version of the AAAI-07 text is in progress.)
  • On the Autoreducibility of Functions, P. Faliszewski, M. Ogihara, URCS TR-912.

2006

  • The Consequences of Eliminating NP Solutions, P. Faliszewski and L.A. Hemaspaandra, URCS TR-898.
  • The Complexity of Bribery in Elections, P. Faliszewski, E. Hemaspaandra, and L.A. Hemaspaandra, AAAI, AAAI Press, 2006. (See URCS TR-895 for full version. See COMSOC'06 workshop version.)
  • How Hard Is Bribery in Elections?, P. Faliszewski, E. Hemaspaandra, and L.A. Hemaspaandra, URCS TR-895.
  • A Richer Understanding of the Complexity of Election Systems, P. Faliszewski, E. Hemaspaandra, L.A. Hemaspaandra, and J. Rothe, URCS TR-903.
  • Open Questions in the Theory of Semifeasible Computation P. Faliszewski and L.A. Hemaspaandra, SIGACT News, Vol. 37, 2006. Also, URCS TR-872.

2005

  • Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties, P. Faliszewski and L.A. Hemaspaandra, International Journal of Foundations of Computer Science, 16(5), pp. 913--928, 2005. Also, URCS TR-872.
  • Properties of Uniformly Hard Languages, P. Faliszewski and J. Jarosz, Information Processing Letters, Vol. 95/1, pp 329--332, 2005. link
  • Separating the Notions of Self- and Autoreducibility, P. Faliszewski and M. Ogihara, In proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), pp. 308--315, August/September 2005. Also, URCS TR-874.

2004

  • Exponential time reductions and sparse languages in NEXP, ECCC report 64, 2004