Axiomatic aggregation of incomplete rankings

References

• Bansal, M. S. and Fernández-Baca, D. (2009) Computing distances between partial rankings. Information Processing Letters, 109(4), 238–241.
   Web of Science ®Google Scholar
• Bartholdi, J., Tovey, C.A. and Trick, M.A. (1989) Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6, 157–165.
   Web of Science ®Google Scholar
• Bogart, K.P. (1973) Preferences structures I: distances between transitive preference relations. Journal of Mathematical Sociology, 3, 49–67.
   Web of Science ®Google Scholar
• Bogart, K.P. (1975) Preference structures II: distances between asymmetric relations. SIAM Journal on Applied Mathematics, 29(2), 254–262.
   Web of Science ®Google Scholar
• Cochran, W.G. and Cox, G.M. (1957) Experimental Design, Wiley, New York, NY.
   Google Scholar
• Cook, W.D. (2006) Distance-based and ad hoc consensus models in ordinal preference ranking. European Journal of Operations Research, 172, 369–385.
   Web of Science ®Google Scholar
• Cook, W.D., Golany, B., Kress, M., Penn, M. and Raviv, T. (2005) Optimal allocation of proposals to reviewers to facilitate effective ranking.Management Science, 51, 655–661.
   Web of Science ®Google Scholar
• Cook, W.D., Golany, B., Penn, M. and Raviv, T. (2007) Creating a consensus ranking of proposals from reviewers’ partial ordinal rankings. Computers and Operations Research, 34, 954–965.
   Web of Science ®Google Scholar
• Cook, W.D. and Kress, M. (1985) Ordinal ranking with intensity of preference. Management Science, 31, 26–32.
   Web of Science ®Google Scholar
• Cook, W.D., Kress, M. and Seiford, L.M. (1986) Information and preference in partial orders: a bimatrix representation. Psychometrika, 51, 197–207.
   Web of Science ®Google Scholar
• Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2001) Introduction to Algorithms, second edition, The MIT Press, Cambridge, MA.
   Google Scholar
• Critchlow, D. (1985) Metric Methods for Analyzing Partially Ranked Data, Springer-Verlag, Berlin, Germany.
   Google Scholar
• De Borda, J.C. (1781) Mémoire sur les élections au scrutin, in Historie de l'Academie Royale des Sciences.
   Google Scholar
• Dwork, C., Kumar, R., Naor, M. and Sivakumar, D. (2001) Rank aggregation methods for the web, in Proceedings of the 10th International Conference on the World Wide Web, ACM, New York, NY, pp. 613–622.
   Google Scholar
• Even, G., Naor, J., Schieber, B. and Sudan, M. (1995) Approximating minimum feedback sets and multi-cuts in directed graphs, in Proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, Springer-Verlag, Berlin, pp. 14–48.
   Google Scholar
• Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D. and Vee, E. (2006) Comparing partial rankings. SIAM Journal on Discrete Mathematics, 20(3), 628–648.
   Web of Science ®Google Scholar
• Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, NY.
   Google Scholar
• Gibbons, J. (1971) Nonparametric Statistical Inference, McGraw-Hill, New York, NY.
   Google Scholar
• Goddard, S.T. (1983) Ranking in tournaments and group decisionmaking. Management Science, 29(12), 1384–1392.
   Web of Science ®Google Scholar
• González-Pachón, J. and Romero, C. (1999) Distance-based consensus methods: a goal programming approach. Omega, 27(3), 341–347.
   Web of Science ®Google Scholar
• González-Pachón, J. and Romero, C. (2001) Aggregation of partial ordinal rankings: an interval goal programming approach. Computers & Operations Research, 28(8), 827–834.
   Web of Science ®Google Scholar
• Hochbaum, D.S. and Levin, A. (2006) The k-allocation problem and its variants, in Proceedings of the 4th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 4368, Springer-Verlag Berlin Heidelberg, Germany, pp. 253–264.
   Google Scholar
• Kemeny, J.G. and Snell, L.J. (1962) Preference ranking: an axiomatic approach, in Mathematical Models in Social Science, MIT Press, Boston, MA, pp. 9–23.
   Google Scholar
• Levin, J. and Nalebuff, B. (1995) An introduction to vote-counting schemes. The Journal of Economic Perspectives, 9(1), 3–26.
   Web of Science ®Google Scholar
• Moreno-Centeno, E. and Karp, R.M. (2013) The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment. Operations Research, 61(2), 453–468.
   Web of Science ®Google Scholar
• Stengel, D.N (2013) Aggregating incomplete individual ratings in group resource allocation decisions. Group Decision and Negotiation, 22(2), 235–258.
   Web of Science ®Google Scholar
• Yates, F. (1936) Incomplete randomized blocks. Annals of Eugenics, 7, 121–140.
   Google Scholar