Ranking Sports Teams and the Inverse Equal Paths Problem

The problem of rank aggregation has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to academic citations, to ranking web pages, and to descriptive decision theory. Rank aggregation is the mapping of inputs that rank subsets of a set of objects into a consistent ranking that represents in some meaningful way the various inputs. In the ranking of sports competitors, or academic citations or ranking of web pages the inputs are in the form of pairwise comparisons. We present here a new paradigm using an optimization framework that addresses major shortcomings in current models of aggregate ranking. Ranking methods are often criticized for being subjective and ignoring some factors or emphasizing others. In the ranking scheme here subjective considerations can be easily incorporated while their contributions to the overall ranking are made explicit. The inverse equal paths problem is introduced here, and is shown to be tightly linked to the problem of aggregate ranking “optimally”. This framework is useful in making an optimization framework available and by introducing specific performance measures for the quality of the aggregate ranking as per its deviations from the input rankings provided. Presented as inverse equal paths problem we devise for the aggregate ranking problem polynomial time combinatorial algorithms for convex penalty functions of the deviations; and show the NP-hardness of some forms of nonlinear penalty functions. Interestingly, the algorithmic setup of the problem is that of a network flow problem. We compare the equal paths scheme here to the eigenvector method, Google PageRank for ranking web sites, and the academic citation method for ranking academic papers.

[1]  Steve Chien,et al.  Link Evolution: Analysis and Algorithms , 2004, Internet Math..

[2]  Dorit S. Hochbaum,et al.  A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem , 2004, Algorithmica.

[3]  Raimo P. Hämäläinen,et al.  Analyzing AHP-matrices by regression , 2003, Eur. J. Oper. Res..

[4]  Bruce L. Golden,et al.  Linear programming models for estimating weights in the analytic hierarchy process , 2005, Comput. Oper. Res..

[5]  Dorit S. Hochbaum,et al.  An efficient algorithm for image segmentation, Markov random fields and related problems , 2001, JACM.

[6]  Dorit S. Hochbaum,et al.  Methodologies and Algorithms for Group-Rankings Decision , 2006, Manag. Sci..

[7]  Seok Ho Chang,et al.  Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations , 2005, Comput. Oper. Res..

[8]  H. A. David,et al.  The method of paired comparisons , 1966 .

[9]  T. L. Saaty A Scaling Method for Priorities in Hierarchical Structures , 1977 .

[10]  Moshe Kress,et al.  Note-Ordinal Ranking and Intensity of Preference: A Linear Programming Approach , 1986 .

[11]  Luis G. Vargas,et al.  Comparison of eigenvalue, logarithmic least squares and least squares methods in estimating ratios , 1984 .

[12]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[13]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[14]  M. Newman,et al.  A network-based ranking system for US college football , 2005, physics/0505169.

[15]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[16]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[17]  Chao Yang,et al.  A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..

[18]  Sergei Maslov,et al.  Finding scientific gems with Google's PageRank algorithm , 2006, J. Informetrics.

[19]  P. Moran On the method of paired comparisons. , 1947, Biometrika.

[20]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.

[21]  Jian-Bo Yang,et al.  A two-stage logarithmic goal programming method for generating weights from interval comparison matrices , 2005, Fuzzy Sets Syst..

[22]  Dorit S. Hochbaum,et al.  Solving the Convex Cost Integer Dual Network Flow Problem , 1999, Manag. Sci..

[23]  Mark Buchanan Top rank , 2006 .

[24]  M. Bohanec,et al.  The Analytic Hierarchy Process , 2004 .

[25]  James P. Keener,et al.  The Perron-Frobenius Theorem and the Ranking of Football Teams , 1993, SIAM Rev..

[26]  D. Burtony On the Use of an Inverse Shortest Paths Algorithm for Recovering Linearly Correlated Costs , 1997 .