On the complexity of Slater's problems

European Journal of Operational Research

Volumn 203, Issue 1, 2010, Pages 216-221

  Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Complexity; Majority tournament; Slater solution; Tournament solutions

Indexed keywords

COMPLEXITY; DIRECTED GRAPHS; LINEAR ORDER; MAJORITY TOURNAMENT; MINIMUM DISTANCE; SLATER SOLUTION; TOURNAMENT SOLUTIONS;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 70350573607     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.07.034     Document Type: Article

References (26)

1. S. Aaronson, G. Kuperberg, Complexity Zoo. .
2. Alon N. Ranking tournaments. SIAM Journal on Discrete Mathematics 20 1 (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., and Monjardet B. The median procedure in cluster analysis and social choice theory. Mathematical Social Sciences 1 (1981) 235-267
5. Barthélemy J.-P., Cohen G., and Lobstein A. Algorithmic Complexity and Communication Problems (1996), UCL Press, London
6. Berge C. Graphs (1985), North-Holland Publishing Co., Amsterdam
7. Charbit P., Thomassé S., and Yeo A. The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing 16 1 (2007) 1-4
8. Charon I., and Hudry O. Slater orders and Hamiltonian paths of tournaments. Electronic Notes in Discrete Mathematics 5 (2000) 60-63
9. I. Charon, O. Hudry, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Annals of Operations Research, in press.
10. Charon I., Hudry O., and Woirgard F. Ordres médians et ordres de Slater des tournois. Mathématiques, Informatique et Sciences humaines 133 (1996) 23-56
11. M.J.A.N. Condorcet, Caritat (marquis de), Essai sur l'application de l'analyseà la probabilité des décisions rendues à la pluralité des voix, Paris, 1785.
12. V. Conitzer, Computing Slater rankings using similarities among candidates, in: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), Boston, MA, USA, 2006, pp. 613-619.
13. Garey M.R., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness (1979), Freeman, New York
14. Guilbaud G.Th. Les théories de l'intérêt général et le problème logique de l'agrégation. Économie appliquée 5 4 (1952) 501-584 and Éléments de la théorie des jeux, Dunod, Paris, 1968
15. Hemaspaandra L. Complexity classes. In: Rosen K.H. (Ed). Handbook of Discrete and Combinatorial Mathematics (2000), CRC Press, Boca Raton 1085-1090
16. O. Hudry, A note on "Banks winners in tournaments are difficult to recognize", by G.J. Woeginger, Social Choice and Welfare, vol. 23, 2004, pp. 113-114.
17. Hudry O. A survey on the complexity of tournament solutions. Mathematical Social Sciences 57 (2009) 292-303
18. 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
19. 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
20. Laslier J.-F. Tournament Solutions and Majority Voting (1997), Springer, Berlin, Heidelberg, New York
21. Moon J.W. Topics on Tournaments (1968), Holt, Rinehart and Winston, New York
22. Reid K.B. Tournaments. In: Gross J.L., and Yellen J. (Eds). Handbook of Graph Theory (2004), CRC Press, Boca Raton 156-184
23. 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, Berlin 169-204
24. Slater P. Inconsistencies in a schedule of paired comparisons. Biometrika 48 (1961) 303-312
25. Woeginger G.J. Banks winners in tournaments are difficult to recognize. Social Choice and Welfare 20 3 (2003) 523-528
26. F. Woirgard, Recherche et dénombrement des ordres médians des tournois, PhD Thesis, ENST, Paris, 1997.