NP-hardness results for the aggregation of linear orders into median orders

Annals of Operations Research

Volumn 163, Issue 1, 2008, Pages 63-88

  Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Aggregation of preferences; Complexity; Median relations; Partially ordered relations

Indexed keywords

EID: 49249119302     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0353-y     Document Type: Article

References (46)

1. Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th annual ACM symposium on Theory of computing (STOC) (pp. 684-693).
2. N. Alon 2006 Ranking tournaments SIAM Journal on Discrete Mathematics 20 1 137 142 10.1137/050623905
3. Arditti, D. (1984). Un nouvel algorithme de recherche d'un ordre induit par des comparaisons par paires. In E. Diday et al. (Eds.), Data analysis and informatics III (pp. 323-343). Amsterdam: North-Holland.
4. J.-P. Barthélemy 1979 Caractérisations axiomatiques de la distance de la différence symétrique entre des relations binaires Mathématiques et Sciences Humaines 67 85 113
5. Barthélemy, J.-P., & Leclerc, B. (1995). The median procedure for partitions. In I. J. Cox, P. Hansen, & B. Julesz (Eds.), DIMACS series in discrete mathematics and theoretical computer science : Vol. 19. Partitioning data sets (pp. 3-34). Providence: Am. Math. Soc.
6. J.-P. Barthélemy B. Monjardet 1981 The median procedure in cluster analysis and social choice theory Mathematical Social Sciences 1 235 267
7. Barthélemy, J.-P., & Monjardet, B. (1988). The median procedure in data analysis: new results and open problems. In H. H. Bock (Ed.), Classification and related methods of data analysis. Amsterdam: North-Holland.
8. J.-P. Barthélemy B. Leclerc B. Monjardet 1986 On the use of ordered sets in problems of comparison and consensus of classifications Journal of Classification 3 187 224
9. Barthélemy, J.-P., Flament, C., & Monjardet, B. (1989). Ordered sets and social sciences. In I. Rival (Ed.), Ordered sets (pp. 721-758). Dordrecht: Reidel.
10. J.-P. Barthélemy O. Hudry G. Isaak F. S. Roberts B. Tesman 1995 The reversing number of a digraph Discrete Applied Mathematics 60 39 76
11. Barthélemy, J.-P., Cohen, G., & Lobstein, A. (1996). Algorithmic complexity and communication problems. London: UCL Press.
12. J. J. Bartholdi III C. A. Tovey M. A. Trick 1989 Voting schemes for which it can be difficult to tell who won the election Social Choice and Welfare 6 157 165
13. D. Black 1948 On the rationale of group decision-making Journal of Political Economy 56 23 34
14. K. P. Bogart 1973 Preference structures I: distance between transitive preference relations Journal of Mathematical Sociology 3 49 67
15. K. P. Bogart 1975 Preference structures II: distances between asymmetric relations SIAM Journal of Applied Mathematics 29 2 254 262
16. Caspard, N., Leclerc, B., & Monjardet, B. (2007). Ensembles ordonnés finis: concepts, résultats et usages. Berlin: Springer.
17. P. Charbit S. Thomasse A. Yeo 2007 The minimum feedback arc set problem is NP-hard for tournaments Combinatorics, Probability and Computing 16 1 1 4
18. I. Charon O. Hudry 2007 A survey on the linear ordering problem for weighted or unweighted tournaments 4OR 5 1 5 60
19. Conitzer, V. (2006). Computing Slater rankings using similarities among candidates. In Proceedings of the 21st national conference on artificial intelligence (AAAI-06) (pp. 613-619), Boston, USA.
20. J. S. de Cani 1969 Maximum likelihood paired comparison ranking by linear programming Biometrika 3 537 545
21. B. Debord 1987 Caractérisation des matrices de préférences nettes et méthodes d'agrégation associées Mathématiques et Sciences Humaines 97 5 17
22. Diestel, R. (2005). Graph theory (3rd edn.). Berlin: Springer.
23. Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the Web. Proceedings of the 10th international conference on World Wide Web (WWW10) (pp. 613-622).
24. Fishburn, P. C. (1985). Interval orders and interval graphs, a study of partially ordered sets. New York: Wiley.
25. M. R. Garey D. S. Johnson 1977 The rectilinear Steiner tree problem is NP-complete SIAM Journal on Applied Mathematics 32 826 834
26. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability, a guide to the theory of NP-completeness. New York: Freeman.
27. A. Guénoche B. Vandeputte-Riboud J.-B. Denis 1994 Selecting varieties using a series of trials and a combinatorial ordering method Agronomie 14 363 375
28. L. Hubert 1976 Seriation using asymmetric proximity measures British Journal of Mathematical & Statistical Psychology 29 32 52
29. Hudry, O. (1989). Recherche d'ordres médians: complexité, algorithmique et problèmes combinatoires. Thèse de l'ENST, Paris.
30. Hudry, O. (2004). Computation of median orders: complexity results. In Annales du LAMSADE: Vol. 3. Proceedings of the workshop on computer science and decision theory (pp. 179-214), DIMACS.
31. Hudry, O. (2008, to appear). Complexity of voting procedures. In R. Meyers (Ed.), Encyclopedia of complexity and systems science. Berlin: Springer.
32. Hudry, O., Leclerc, B., Monjardet, B., & Barthélemy, J.-P. (2006). Médianes métriques et laticielles. In D. Dubois, M. Pirlot, & D. Bouyssou (Eds.), Concepts et méthodes pour l'aide à la décision (pp. 271-316). Paris: Hermès (translation to appear).
33. Jünger, M. (1985). Polyhedral combinatorics and the acyclic subdigraph problem. Berlin: Heldermann.
34. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Tatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum.
35. M. Krivanek J. Moravek 1986 NP-hard problems in hierarchical-tree clustering Acta Informatica 23 311 323
36. B. Monjardet 1973 Tournois et ordres médians pour une opinion Mathématiques et Sciences Humaines 43 55 73
37. B. Monjardet 1978 Axiomatiques et propriétés des quasi-ordres Mathématiques et Sciences Humaines 63 51 82
38. B. Monjardet 1979 Relations à éloignement minimum de relations binaires, note bibliographique Mathématiques et Sciences Humaines 67 115 122
39. B. Monjardet 1990 Sur diverses formes de la "règle de Condorcet" d'agrégation des préférences Mathématiques, Informatique et Sciences Humaines 111 61 71
40. Orlin, J. B. (1981). Unpublished manuscript.
41. Reinelt, G. (1985). The linear ordering problem: algorithms and applications. Research and exposition in mathematics, Vol. 8. Berlin: Heldermann.
42. P. Slater 1961 Inconsistencies in a schedule of paired comparisons Biometrika 48 303 312
43. Tucker, A. W. (1960). On directed graphs and integer programs. In 1960 symposium on combinatorial problems, Princeton University, USA.
44. Wakabayashi, Y. (1986). Aggregation of binary relations: algorithmic and polyhedral investigations. PhD thesis, Augsbourg.
45. Y. Wakabayashi 1998 The complexity of computing medians of relations Resenhas 3 3 323 349
46. D. H. Younger 1963 Minimum feedback arc sets for a directed graph IEEE Transactions of the Group in Circuit Theory 10 2 238 245