Ranking sports teams and the inverse equal paths problem

Authors:
Dorit S. Hochbaum
Affiliations:
Department of Industrial Engineering and Operations Research and, Walter A. Haas School of Business, University of California, Berkeley
Venue:
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Year:
2006

Citing 13
Cited 2

Ordinal ranking and intensity of preference: A linear programming approach

Management Science
Convex separable optimization is not much harder than linear optimization

Journal of the ACM (JACM)
On an instance of the inverse shortest paths problem

Mathematical Programming: Series A and B
The Perron-Frobenius theorem and the ranking of football teams

SIAM Review
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

Mathematical Programming: Series A and B
An efficient algorithm for image segmentation, Markov random fields and related problems

Journal of the ACM (JACM)
Inverse Optimization

Operations Research
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Solving the Convex Cost Integer Dual Network Flow Problem

Management Science
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

Algorithmica
Linear programming models for estimating weights in the analytic hierarchy process

Computers and Operations Research
Methodologies and Algorithms for Group-Rankings Decision

Management Science
A two-stage logarithmic goal programming method for generating weights from interval comparison matrices

Fuzzy Sets and Systems

Country credit-risk rating aggregation via the separation-deviation model

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
Rating Customers According to Their Promptness to Adopt New Products

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.