Markov-based ranking methods
Ranking methods are an essential tool to help make decisions. This dissertation document examines different aspects of the theory and application of pairwise comparison ranking methods, specifically those that use Markov chains. First, a new method is developed to solve a traditional recruiting problem, and is shown to improve the predictive power of its ranking. Next, modifications are made to an existing method that theoretically improves the reliability, while maintaining the rank integrity. Last, a framework is developed that defines a fair and comprehensive ranking method, and several popular methods are evaluated in their ability to adhere to the said framework.
Morin, Purdue University.
Off-Campus Purdue Users:
To access this dissertation, please log in to our