Social Choice and Voting

Here are some references for Social Choice and Voting and Parameterized Complexity

  • Survey Article: Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. Nadja Betzler, Robert Bredereck, Jiehua Chen and Rolf Niedermeier. In The Multivariate Algorithmic Revolution and Beyond, Lecture Notes in Computer Science, Volume 7370, 318-363, Springer, 2012. Spingerlink
  • Survey Article: Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems from Computational Social Choice. — Mathematical Programming Glossary Supplement—Claudia Lindner and Jorg Rothe, Institut fur Informatik, Heinrich-Heine-Universitat Dusseldorf, Germany. October 17, 2008. Lindner and Rothe.
  • Parameterized Computational Complexity of Dodgson and Young Elections. Nadja Betzler, Jiong Guo and Rolf Niedermeier. Lecture Notes in Computer Science, Springer Volume 5124/2008, in Proceedings SWAT 2008, 402-413. Springerlink.
  • Copeland Voting Fully Resists Constructive Control. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: AAIM 2008: 165-176 Springerlink.
  • Fixed-parameter algorithms for Kemeny scores. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., F. Rosamond. In: Proc. of 4th AAIM. Springer LNCS, vol. 5034, (2008) pp. 60–71.
  • On complexity of lobbying in multiple referenda. Christian, R., Fellows, M.R., Rosamond, F.A., A. M. Slinko. Review of Economic Design 11(3), 217–224 (2007). Springerlink.
  • Approximability and computational feasibility of Dodgson’s rule. J. C. McCabe-Dansted. Master’s thesis, University of Auckland (2006)
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License