Partially Identified Rankings from Pairwise Interactions
由成对互动得到的部分识别排序
This paper considers the problem of ranking objects based on their latent merits using data from pairwise interactions. We allow for incomplete observation of these interactions and study what can be inferred about rankings in such settings. First, we show that identification of the ranking depends on a tradeoff between the tournament graph and the link function: in parametric models, such as the Bradley-Terry-Luce, rankings are point identified even with sparse graphs,…