Partially Identified Rankings from Pairwise Interactions

Federico Crippa and Danil Fedchenko

Papers from arXiv.org

Abstract: 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 trade-off between the tournament graph and the interaction function: in parametric models, such as the Bradley-Terry-Luce, rankings are point identified even with sparse graphs, whereas nonparametric models require dense graphs. Second, moving beyond point identification, we characterize the identified set in the nonparametric model under any tournament structure and represent it through moment inequalities. Finally, we propose a likelihood-based statistic to test whether a ranking belongs to the identified set. We study two testing procedures: one is finite-sample valid but computationally intensive; the other is easy to implement and valid asymptotically. We illustrate our results using Brazilian employer-employee data to study how workers rank firms when moving across jobs.

Date: 2024-10, Revised 2025-09
New Economics Papers: this item is included in nep-ecm
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2410.18272 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2410.18272

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().