Multivariate complexity analysis of swap bribery

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

Volumn 6478 LNCS, Issue , 2010, Pages 107-122

  Dorn, Britta ^a   Schlotter, Ildikó ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY ANALYSIS; FIXED-PARAMETER TRACTABILITY; HARDNESS RESULT; NP-HARDNESS; PARAMETERIZED; POLYNOMIAL-TIME; PREFERENCE RANKING; PROBLEM MODELING; VOTING SYSTEMS;

COST FUNCTIONS; HARDNESS; MULTIVARIANT ANALYSIS; PARAMETERIZATION; POLYNOMIAL APPROXIMATION; VOTING MACHINES;

COMPUTATIONAL COMPLEXITY;

EID: 78650890362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17493-3_12     Document Type: Conference Paper

References (20)

1. Betzler, N.: On problem kernels for possible winner determination under the kapproval protocol. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 114-125. Springer, Heidelberg (2010)
2. Betzler, N., Dorn, B.: Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. J. Comput. Syst. Sci. 76, 812-836 (2010)
3. Betzler, N., Hemmann, S., Niedermeier, R.: A multivariate complexity analysis of determining possible winners given incomplete votes. In: Proc. of IJCAI 2009, pp. 53-58 (2009)
4. Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425-5442 (2009)
5. Brams, S.J., Fishburn, P.C.: Voting procedures. In: Handbook of Social Choice and Welfare, vol. 1, pp. 173-236. Elsevier, Amsterdam (2002)
6. Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. Review of Economic Design 11(3), 217-224 (2007)
7. Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), 1-33 (2007)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) Algorithmic Game Theory. LNCS, vol. 5814, pp. 299-310. Springer, Heidelberg (2009)
10. Faliszewski, P.: Nonuniform bribery. In: Proc. of AAMAS 2008, pp. 1569-1572 (2008)
11. Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of bribery in elections. In: Proc. of AAAI 2006, pp. 641-646 (2006)
12. Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. (JAIR) 35, 275-341 (2009)
13. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53-61 (2009)
14. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
15. Hemaspaandra, E., Hemaspaandra, L.A.: Dichotomy for voting systems. J. Comput. Syst. Sci. 73(1), 73-83 (2007)
16. Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proc. of IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling (2005)
17. Lenstra, H.: Integer programming with a fixed number of variables. Math. of OR 8, 538-548 (1983)
18. Liu, H., Feng, H., Zhu, D., Luan, J.: Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci. 410(27-29), 2746-2753 (2009)
19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
20. Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. of STACS 2010, pp. 17-32 (2010)