| 000 | 00964nam a22001457a 4500 | ||
|---|---|---|---|
| 999 |
_c521205 _d521205 |
||
| 008 | 221226b ||||| |||| 00| 0 eng d | ||
| 100 |
_aBloch, Francis and Olckers, Matthew _936414 |
||
| 245 | _aFriend-based ranking | ||
| 260 | _aAmerican Economic Journal: Microeconomics | ||
| 300 | _a14(2), May, 2022: p.176-214 | ||
| 520 | _aWe 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. – Reproduced | ||
| 773 | _aAmerican Economic Journal: Microeconomics | ||
| 906 | _aRANKING | ||
| 942 | _cAR | ||