Friend-Based Ranking in Practice
Francis Bloch, Matthew Olckers

TL;DR
This paper explores a strategy-proof mechanism for targeting individuals based on friend rankings, addressing practical implementation issues and errors in the rankings.
Contribution
It introduces a novel mechanism that leverages friend-based rankings for targeting, with analysis of its practical robustness and error handling.
Findings
Mechanism is strategy-proof for individuals.
Practical implementation considerations are discussed.
Error resilience in rankings is analyzed.
Abstract
A planner aims to target individuals who exceed a threshold in a characteristic, such as wealth or ability. The individuals can rank their friends according to the characteristic. We study a strategy-proof mechanism for the planner to use the rankings for targeting. We discuss how the mechanism works in practice, when the rankings may contain errors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
