Parameterized computational complexity of dodgson and young elections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5124 LNCS, Issue , 2008, Pages 402-413

  Betzler, Nadja ^a   Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; MATHEMATICAL TECHNIQUES; NUCLEAR PROPULSION; TECHNICAL PRESENTATIONS;

COMPLEXITY THEORIES; CONDORCET WINNERS; COST MODELS; EFFICIENT; ELECTION SYSTEMS; FIXED-PARAMETER ALGORITHMS; HARDNESS RESULTS; NP-COMPLETENESS; NUMBER OF SWITCHES; ONE HANDED; PARAMETER TRACTABILITIES; PARAMETERIZED; PARAMETERIZED COMPLEXITIES;

COMPUTATIONAL COMPLEXITY;

EID: 54249091265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_36     Document Type: Conference Paper

References (19)

1. Bartholdi III, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6, 157-165 (1989)
2. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny scores. In: Proc. of 4th AAIM, LNCS, vol. 5034, pp. 60-71. Springer, Heidelberg (2008)
3. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice (invited paper). In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51-69. Springer, Heidelberg (2007)
4. Christian, R., Fellows, M.R., Rosamond, F.A., Slinko, A.M.: On complexity of lobbying in multiple referenda. Review of Economic Design 11(3), 217-224 (2007)
5. Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM 54(3), 1-33 (2007)
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
7. Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: A richer understanding of the complexity of election systems. In: Ravi, S., Shukla, S. (eds.) Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz. Springer, Heidelberg (2008)
8. Fellows, M.R.: Personal communication (October 2007)
9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
10. Hemaspaandra, E., Hemaspaandra, L.A.: Dichotomy for voting systems. Journal of Computer and System Sciences 73(1), 73-83 (2007)
11. Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact analysis of Dodgson elections: Lewis Caroll's 1876 voting system is complete for parallel access to NP. Journal of the ACM 44(6), 806-825 (1997)
12. Homan, C.M., Hemaspaandra, L.A.: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Journal of Heuristics (2007)
13. McCabe-Dansted, J.C.: Approximability and computational feasibility of Dodgson's rule. Master's thesis, University of Auckland (2006)
14. McCabe-Dansted, J.C., Pritchard, G., Slinko, A.: Approximability of Dodgson's rule. Social Choice and Welfare (2007)
15. McLean, L., Urken, A.: Classics of Social Choice. University of Michigan Press, Ann Arbor, Michigan (1995)
16. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
17. Procaccia, A.D., Feldman, M., Rosenschein, J.S.: Approximability and inapprox-imability of Dodgson and Young elections. Technical Report Discussion paper 466, Center for the Study of Rationality, Hebrew University (October 2007)
18. R.othe, J., Spakowski, H., Vogel, J.: Exact complexity of the winner problem for Young elections. Theory of Computing Systems 36, 375-386 (2003)
19. Young, H.P.: Extending Condorcet's rule. Journal of Economic Theory 16, 335-353 (1977)