Researcher ORCID Identifier


Graduation Year


Document Type

Open Access Senior Thesis

Degree Name

Bachelor of Science



Reader 1

Jamie Haddock

Reader 2

Michael E. Orrison

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Rights Information

2023 Claire S Chang


Ranking from pairwise comparisons is a particularly rich subset of ranking problems. In this work, we focus on a family of ranking methods for pairwise comparisons which encompasses the well-known Massey, Colley, and Markov methods. We will accomplish two objectives to deepen our understanding of this family. First, we will consider its network diffusion interpretation. Second, we will analyze its sensitivity by studying the "maximal upset" where the direction of an arc between the highest and lowest ranked alternatives is flipped. Through these analyses, we will build intuition to answer the question "What are the characteristics of robust ranking methods?" to ensure fair rankings in a variety of applications, ranging from choosing political candidates to ranking web pages to comparing sports teams.