Piotr Faliszewski

  • AGH University of Science and Technology
  • Wydzial Elektrotechniki, Automatyki, Informatyki i Elektroniki
  • Katedra Informatyki
  • Office: 319 (C-2)
  • Phone: (+48) 12 617-3689
  • Email: a permutation of {@agh., faliszew, pl, edu.}.

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.

Service

I serve on the editorial board of the journal Computer Science.

I serve as a program committee cochair for COMSOC-2012 and senior program committee member for AAMAS-2012, amd program committee member for ECAI-2012, AAAI-2012. In the past I served as a program committee member for AAAI-2011, AAMAS-2011, WSCAI-2011, CoopMAS-2011, COMSOC-2010, AAAI-2010, AAMAS-2010, and CoopMAS-2010.

Students

  1. mgr inz. Krzysztof Wojtas (MSc defense Dec. 7th 2011)
  2. Tomasz Miąsko
  3. Tomasz Perek

Publications

See also my CV, my DBLP record, and my Google Citations.

Survey Papers

  1. Using Complexity to Protect Elections, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, Communications of the ACM, Vol. 53/11, pp. 74--82, November 2010.
    [CACM]

  2. AI's War on Manipulation: Are We Winning?, P. Faliszewski, A. Procaccia, AI Magazine, Vol. 31/4, pp. 53--64, December 2010.
    [AI Mag] [TR]

  3. A Richer Understanding of the Complexity of Election Systems, P. Faliszewski, E. Hemaspaandra, L.A. Hemaspaandra, and J. Rothe, in Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz , eds. S. Ravi and S. Shukla, pp. 375--406, Springer, 2009. Also available as URCS TR-903
    [springer] [arXiv]

Research Papers

  1. Campaigns for Lazy Voters: Truncated Ballots, D. Baumeister, P. Faliszewski, J. Lang, J. Rothe, AAMAS-2012, accepted.
    [AAMAS]

  2. Manipulating the Quota in Weighted Voting Games, M. Zuckerman, P. Faliszewski, Y. Bachrach, E. Elkind, Artificial Intelligence, Vol. 180--181, pp. 1--19, April 2012. Also presented at AAAI-08.
    [AIJ] [AAAI-08]

  3. Cloning in Elections: Finding the Possible Winners, E. Elkind, P. Faliszewski, A. Slinko, Journal of Artificial Intellligence Research, Vol. 42, pp. 529--573, 2011. Also presented at AAAI-2010, at the 10th International Meeting of the Society for Social Choice and Welfare in Moscow, and at COMSOC-2010 with title "Cloning in Elections".
    [JAIR] [AAAI-10] [COMSOC-10]

  4. [NEW] Clone Structures in Voters' Preferences E. Elkind, P. Faliszewski, A. Slinko, manuscript.
    [TR]

  5. An NTU Cooperative Game Theoretic View of Manipulating Elections , M. Zuckerman, P. Faliszewski, V. Conitzer, J. Rosenschein, WINE-2011.
    [WINE]

  6. Possible Winners in Noisy Elections, K. Wojtas, P. Faliszewski, IJCAI Workshop on Social Choice and Artificial Intelligence (WSCAI-2011).
    [WSCAI]

  7. Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type, E. Elkind, P. Faliszewski, A. Slinko, Social Choice & Welfare, accepted. Also available as Technical Report.
    [SCW] [arXiv]

  8. The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, TARK-2011. Also available as URCS-TR-968.
    [TARK] [arXiv]

  9. Campaign Management under Approval-Driven Voting Rules, I. Schlotter, E. Elkind, P. Faliszewski, AAAI-2011.
    [AAAI]

  10. Constrained Coalition Formation, T. Rahwan, T. Michalak, E. Elkind, P. Faliszewski, J. Sroka, M. Wooldridge, N. Jennings, AAAI-2011.
    [AAAI]

  11. Coalitional Voting Manipulation: A Game-Theoretic Perspective Y. Bachrach, E. Elkind, P. Faliszewski, IJCAI-2011. Also presented at CoopMAS 2011 workshop (colocated with AAMAS 2011).
    [IJCAI] [CoopMAS]

  12. Homogeneity and Monotonicity of Distance-Rationalizable Voting Rules, E. Elkind, P. Faliszewski, A. Slinko, AAMAS-2011. Full version of the paper is available as a here.
    [AAMAS] [TR]

  13. The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, J. Rothe, Information and Computation, Vol. 209/2, pp. 89--107, February 2011. Also available as a technical report, arXiv:0909.3257 and URCS TR-950. Preliminary version presented at TARK-09.
    [I&C] [TARK-09] [arXiv]

  14. Multimode Control Attacks on Elections, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, Journal of AI Research, Vol. 40, pp. 305--351, 2011. Also available as URCS TR-960 and as arXiv Technical Report arXiv:1007.1800. Preliminary versions presented at IJCAI-09.
    [JAIR] [IJCAI-09] [arXiv]

  15. On the Autoreducibility of Functions, P. Faliszewski, M. Ogihara, Theory of Computing Systems, Vol. 46(2), pp. 222--245, 2010. Also available as URCS TR-912. Preliminary version presented at MFCS-05 (Separating the Notions of Self- and Autoreducibility, see also URCS TR-874).
    [ToCS] [MFCS-05] [TR]

  16. Approximation Algorithms for Campaign Management, E. Elkind, P. Faliszewski, WINE-2010. Full version of the paper is available as a Technical Report.
    [WINE] [arXiv]

  17. Distance Rationalization of Voting Rules, E. Elkind, P. Faliszewski, A. Slinko, To be presented at COMSOC-2010. A workshop paper combining the results of "On Distance Rationalizability of Some Voting Rules", "On the Role of Distances in Defining Voting Rules", and "Good Rationalizations of Voting Rules".
    [COMSOC-10]

  18. Good Rationalizations of Voting Rules, E. Elkind, P. Faliszewski, A. Slinko, AAAI-2010.
    [AAAI-10]

  19. Probabilistic Possible Winner Determination, Y. Bachrach, N. Betzler, P. Faliszewski, AAAI-2010.
    [AAAI-10]

  20. Manipulation of Copeland Elections, P. Faliszewski, E. Hemaspaandra, H. Schnoor, AAMAS-2010.
    [AAMAS-10]

  21. On the Role of Distances in Defining Voting Rules, E. Elkind, P. Faliszewski, A. Slinko, AAMAS-2010.
    [AAMAS-10]

  22. Swap Bribery, E. Elkind, P. Faliszewski, A. Slinko, SAGT-09, 2009. Full version available as a technical report.
    [SAGT-09] [arXiv]

  23. On Distance Rationalizability of Some Voting Rules, E. Elkind, P. Faliszewski, A. Slinko, TARK-09.
    [TARK-09]

  24. Boolean Combinations of Weighted Voting Games, P. Faliszewski, E. Elkind, M. Wooldridge, AAMAS-09.
    [AAMAS-09]

  25. Llull and Copeland Voting Computationally Resist Bribery and Constructive Control, P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, J. Rothe, Journal of AI Research, Vol. 35, pp. 275-341, 2009. Full version of the paper is available as URCS TR-933. Results from this paper were presented in part at AAAI-07 (Llull and Copeland Voting Broadly Resist Bribery and Control, see also URCS TR-913) and at AAIM-08 (Copeland Voting Fully Resists Constructive Control, see also URCS TR-923)
    [JAIR] [AAIM-08] [AAAI-07] [arXiv]

  26. How Hard Is Bribery in Elections?, P. Faliszewski, L. Hemaspaandra, E. Hemaspaandra, Journal of AI Research, Vol. 35, pp. 485-532, 2009. Also available as URCS TR-895. Preliminary versions presented at AAAI-06 (The Complexity of Bribery in Elections) and COMSOC'06.
    [JAIR] [AAAI-06] [arXiv]

  27. The Complexity of Power-Index Comparison, P. Faliszewski, L. Hemaspaandra, Theoretical Computer Science, Vol. 410(1), pp. 101--107, 2009. Also available as URCS TR-929. Preliminary version presented at AAIM-08.
    [TCS] [AAIM-08] [arXiv]

  28. Manipulation of Elections: Algorithms and Infeasibility Results, P. Faliszewski, Ph.D. thesis, University of Rochester, Rochester, NY 14627. Also available as URCS-TR 941.
    [TR]

  29. Approximability of Manipulating Elections, E. Brelsford, P. Faliszewski, E. Hemaspaadnra, I. Schnoor, and H. Schnoor, AAAI-08. Also presented at COMSOC-08.
    [AAAI-08] [COMSOC-08]

  30. The Consequences of Eliminating NP Solutions, P. Faliszewski, L. Hemaspaandra, Computer Science Review, Vol. 2(1), pp. 40--54, 2008. Also available as URCS TR-898
    [CSR] [arXiv]

  31. Copeland Voting: Ties Matter, P. Faliszewski, E. Hemaspaandra, and H. Schnoor, AAMAS-08. Also available as URCS TR-926
    [AAMAS-08] [TR]

  32. Nonunform Bribery, P. Faliszewski, AAMAS-08. Also available as URCS TR-922.
    [AAMAS-08]

  33. Open Questions in the Theory of Semifeasible Computation, P. Faliszewski and L.A. Hemaspaandra, SIGACT News, Vol. 37, 2006. Also available as URCS TR-872.
    [SIGACT News] [arXiv]

  34. 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 available as URCS TR-872.
    [IJFCS] [TR]

  35. Properties of Uniformly Hard Languages, P. Faliszewski and J. Jarosz, Information Processing Letters, Vol. 95/1, pp 329--332, 2005.
    [IPL]

  36. Exponential time reductions and sparse languages in NEXP, ECCC report 64, 2004.
    [ECCC]