On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time

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

Volumn 4639 LNCS, Issue , 2007, Pages 300-311

  Erdélyi, Gábor ^a   Hemaspaandra, Lane A ^b   Rothe, Jörg ^a   Spakowski, Holger ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

LOGARITHMIC APPROXIMATION RATIO; OPTIMAL WEIGHTED LOBBYING; POLYNOMIAL TIME;

PROBLEM SOLVING;

EID: 38149052100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_26     Document Type: Conference Paper

References (18)

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. Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. In: Endriss, U., Lang, J. (eds.) First International Workshop on Computational Social Choice (COMSOC 2006), pp. 87-96 (workshop notes). Universiteit van Amsterdam (December 2006)
3. Conitzer, V., Sandholm, T.: Nonexistence of voting rules that are usually hard to manipulate. In: Proceedings of the 21st National Conference on Artificial Intelligence. AAAI Press, Stanford, California, USA (2006)
4. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
5. Dodgson, C.: A method of taking votes on more than two issues. Pamphlet printed by the Clarendon Press, Oxford (1876)
6. Erdélyi, G., Hemaspaandra, L., Rothe, J., Spakowski, H.: On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time. Technical Report TR-914, Department of Computer Science, University of Rochester, Rochester, NY (March 2007)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. EATCS Texts in Theoretical Computer Science. Springer, Heidelberg (2006)
8. Fishburn, P.: Condorcet social choice functions. SIAM Journal on Applied Mathematics 33(3), 469-489 (1977)
9. Goldreich, O.: Note on Levin's theory of average-case complexity. Technical Report TR97-058, Electronic Colloquium on Computational Complexity (November 1997)
10. Homan, C., Hemaspaandra, L.: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 528-539. Springer, Heidelberg (2006)
11. 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)
12. Impagliazzo, R.: A personal view of average-case complexity. In: Proceedings of the 10th Structure in Complexity Theory Conference, pp. 134-147. IEEE Computer Society Press, Los Alamitos (1995)
13. Levin, L.: Average case complete problems. SIAM Journal on Computing 15(1), 285-286 (1986)
14. McCabe-Dansted, J., Pritchard, G., Slinko, A.: Approximability of Dodgson's rule. In: Endriss, U., Lang, J. (eds.) First International Workshop on Computational Social Choice (COMSOC 2006), pp. 331-344 (workshop notes). Universiteit van Amsterdam (December 2006)
15. Procaccia, A., Rosenschein, J.: Junta distributions and the average-case complexity of manipulating elections. Journal of Artificial Intelligence Research 28, 157-181 (2007)
16. Rothe, J., Spakowski, H., Vogel, J.: Exact complexity of the winner problem for Young elections. Theory of Computing Systems 36(4), 375-386 (2003)
17. Trevisan, L.: Lecture notes on computational complexity (Lecture 12) (2002), www.cs.berkeley.edu/~luca/notes/complexitynotes02.pdf
18. Wang, J.: Average-case computational complexity theory. In: Hemaspaandra, L., Selman, A. (eds.) Complexity Theory Retrospective II, pp. 295-328. Springer, Heidelberg (1997)