A survey on the complexity of tournament solutions

Mathematical Social Sciences

Volumn 57, Issue 3, 2009, Pages 292-303

  Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Complexity; Majority tournament; Tournament solutions; Voting theory

Indexed keywords

EID: 61549125061     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mathsocsci.2008.12.002     Document Type: Review

References (46)

1. Aaronson, S., Kuperberg, G., 2008. Complexity Zoo. http://qwiki.stanford.edu/wiki/Complexity_Zoo
2. Alon N. Ranking tournaments. SIAM Journal on Discrete Mathematics 20 (2006) 137-142
3. Banks J. Sophisticated voting outcomes and agenda control. Social Choice and Welfare 2 (1985) 295-306
4. Barthélemy J.-P., Cohen G., and Lobstein A. Algorithmic Complexity and Communication Problems (1996), UCL Press, London
5. Barthélemy J.-P., and Monjardet B. The median procedure in cluster analysis and social choice theory. Mathematical Social Sciences 1 (1981) 235-267
6. Berge C. Graphs (1985), North-Holland, Amsterdam
7. Bradley R.A., and Terry M.E. Rank analysis of incomplete block designs I: The method of paired comparisons. Biometrika 39 (1952) 324-345
8. Brandt F., and Fischer F. Computational aspects of covering in dominance graphs. In: Holte R.C., and Howe A. (Eds). Proceedings of the 22nd Conference on Artificial Intelligence (AAAI) (2007), AAAI Press 694-699
9. Brandt F., and Fischer F. Computing the minimal covering set. Mathematical Social Sciences 56 2 (2008) 254-268
10. Brandt, F., Fischer, F., Harrenstein, P., 2006. The computational complexity of choice sets, In: Proceedings of the Conference Computational Social Choice 2006, U. Endriss and J. Lang (Eds.), Universiteit van Amsterdam, Amsterdam, The Netherlands, pp. 63-76
11. Brandt, F., Fischer, F., Harrenstein, P., 2008. Recognizing members of the tournament equilibrium set is NP-hard. http://arxiv.org/abs/0711.2961
12. Caritat, M.J.A.N., de Condorcet, Marquis, 1785. Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Paris
13. Charbit P., Thomasse S., and Yeo A. The minimum feedback arc set problem is NP-hard for tournaments, Combinatorics. Probability and Computing 16 1 (2007) 1-4
14. Charon I., and Hudry O. A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5 1 (2007) 5-60
15. Conitzer, V., 2005. Computing Slater Rankings Using Similarities Among Candidates, IBM research report RC23748 (W0510-105)
16. Copeland, A.H., 1951. A reasonable social welfare function, Seminar on applications of mathematics to social sciences, University of Michigan
17. Cormen T., Leiserson C., and Rivest R. Introduction to Algorithms (1990), MIT Press, Cambridge, Massachusetts
18. Durrett R. Probability: Theory and Examples (1991), Duxbury, Belmont
19. Dutta B. Covering sets and a new Condorcet choice correspondence. Journal of Economic Theory 44 (1988) 63-80
20. Fishburn P. Condorcet social choice functions. SIAM Journal of Applied Mathematics 33 (1977) 469-489
21. Ford L.R. Solution of a ranking problem from binary comparisons. The American Mathematical Monthly 64 (1957) 28-33
22. Frobenius G. Über Matrizen aus nicht negativen Elementen. Sitzungsber Preuss Akad Wiss 23 (1912) 456-477
23. Garey M.R., and Johnson D.S. Computers and Intractability, a Guide to the Theory of NP-Completeness (1979), Freeman, New York
24. Grivko I.L., and Levchenkov V.S. Intrinsic properties of the self-consistent choice rule. Automation and Remote Control 55 (1994) 689-697
25. Hemaspaandra L. Complexity classes. In: Rosen K.H. (Ed). Handbook of Discrete and Combinatorial Mathematics (2000), CRC Press, Boca Raton 1085-1090
26. Hudry O. A note on Banks winners in tournaments are difficult to recognize by G.J. Woeginger. Social Choice and Welfare 23 (2004) 1-2
27. Hudry, O., On the complexity of Slater's problems (submitted for publication)
28. Johnson D.S. A catalog of complexity classes. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Vol. A: Algorithms and Complexity (1990), Elsevier, Amsterdam 67-161
29. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Tatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
30. Kendall M.G. Further contributions to the theory of paired comparisons. Biometrics 11 (1955) 43-62
31. Khachiyan L. A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20 (1979) 191-194
32. Laslier, J.-F., 1993. Solutions de tournois, Habilitation à diriger les recherches en science économique, université de Cergy-Pontoise
33. Laslier J.-F. Tournament Solutions and Majority Voting (1997), Springer, Berlin, Heidelberg, New York
34. Levchenkov, V.S., 1992. Social choice theory: A new sight, Preprint of the Institute for System Analysis, Moscow
35. McKey, B., 2006. http://cs.anu.edu.au/~bdm/data/digraphs.html
36. Miller N. A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting. American Journal of Political Science 24 1 (1980) 68-96
37. Moon J.W. Topics on Tournaments (1968), Rinehart and Winston, Holt
38. Reid K.B. Tournaments. In: Gross J.L., and Yellen J. (Eds). Handbook of Graph Theory (2004), CRC Press, Boca Raton 156-184
39. Reid K.B., and Beineke L.W. Tournaments. In: Beineke L.W., and Wilson R.J. (Eds). Selected Topics in Graph Theory (1978), Academic Press 169-204
40. Schwartz T. Cyclic tournaments and cooperative majority voting: A solution. Social Choice and Welfare 7 (1990) 19-29
41. Shepsle K., and Weingast B. Uncovered sets and sophisticated voting outcomes with implications for agenda institutions. American Journal of Political Sciences 28 (1984) 49-74
42. Sipser, M., 1996. Introduction to the Theory of Computation, Course Technology
43. Slater P. Inconsistencies in a schedule of paired comparisons. Biometrika 48 (1961) 303-312
44. Wei, T., 1952. The algebraic foundations of ranking theory, Ph.D. Thesis, Cambridge University
45. Woeginger G.J. Banks winners in tournaments are difficult to recognize. Social Choice and Welfare 20 3 (2003) 523-528
46. Zermelo E. Die Berechnung der Turnier-Ergebnisse als ein maximal Problem der Warscheinlichkeistsrechnung. Mathematische Zeitung 29 (1929) 436-460