1 paper
Benjamin Jarman, Lara Kassab, Deanna Needell +1
In this paper, we consider large-scale ranking problems where one is given a set of (possibly non-redundant) pairwise comparisons and the underlying ranking explained by those comp…