# Friend-Based Ranking

arXiv: https://arxiv.org/abs/1807.05093 · HTML: https://mlsanity.com/paper/1807.05093/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jul 2018.

## Built on by (most cited first, 1 of 1)

- [Manipulation and Peer Mechanisms: A Survey](https://mlsanity.com/paper/2210.01984/) (2022)

## Abstract (arXiv)

We analyze the design of a mechanism to extract a ranking of individuals according to a unidimensional characteristic, such as ability or need. Individuals, connected on a social network, only have local information about the ranking. We show that a planner can construct an ex post incentive compatible and efficient mechanism if and only if every pair of friends has a friend in common. We characterize the windmill network as the sparsest social network for which the planner can always construct a complete ranking.