<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Friend-based ranking</title>
  </titleInfo>
  <name type="personal">
    <namePart>Bloch, Francis and Olckers, Matthew</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="text">American Economic Journal: Microeconomics</placeTerm>
    </place>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>14(2), May, 2022: p.176-214</extent>
  </physicalDescription>
  <abstract>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. – Reproduced </abstract>
  <relatedItem type="host">
    <name>
      <namePart>American Economic Journal: Microeconomics </namePart>
    </name>
  </relatedItem>
  <recordInfo>
    <recordCreationDate encoding="marc">221226</recordCreationDate>
  </recordInfo>
</mods>
