Approximation algorithms for campaign management

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

Volumn 6484 LNCS, Issue , 2010, Pages 473-482

  Elkind, Edith ^a   Faliszewski, Piotr ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCIAL SETTINGS; ELECTORAL CAMPAIGN; ELECTORAL SYSTEMS; LARGE CLASS; MANAGEMENT SCENARIOS; MAXIMIN; PREFERENCE RANKING; SCORING RULES; CAMPAIGN MANAGEMENTS;

INTERNET; WINE; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATION ALGORITHMS;

EID: 78650855129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17572-5_40     Document Type: Conference Paper

References (13)

1. Bartholdi III, J., Tovey, C., Trick, M.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6(2), 157-165 (1989)
2. Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 124-136. Springer, Heidelberg (2009)
3. Caragiannis, I., Covey, J., Feldman, M., Homan, C., Kaklamanis, C., Karanikolas, N., Procaccia, A., Rosenschein, J.: On the approximability of Dodgson and Young elections. In: Proceedings of SODA 2009, pp. 1058-1067 (January 2009)
4. Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. In: Proceedings of the 5th International Symposium on Parameterized and Exact Computation (to appear, 2010)
5. Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. Tech. Rep. arXiv:1004.0334 [cs.GT] (March 2010)
6. 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)
7. Faliszewski, P.: Nonuniform bribery (short paper). In: Proceedings of AAMAS 2008, pp. 1569-1572 (2008)
8. Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? Journal of Artificial Intelligence Research 35, 485-532 (2009)
9. Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research 35, 275-341 (2009)
10. Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. Journal of the ACM 44(6), 806-825 (1997) (Pubitemid 127628552)
11. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and subconstant error-probability PCP characterization of NP. In: Proceedings of STOC 1997, pp. 475-484. ACM Press, New York (1997)
12. Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of AAAI 2008, pp. 196-201 (July 2008)
13. Xia, L., Conitzer, V., Procaccia, A.: A scheduling approach to coalitional manipulation. In: Proceedings of EC 2010, pp. 275-284 (June 2010)