<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>00964nam a22001457a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">521205</subfield>
    <subfield code="d">521205</subfield>
  </datafield>
  <controlfield tag="008">221226b           ||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Bloch, Francis and Olckers, Matthew </subfield>
    <subfield code="9">36414</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Friend-based ranking</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">American Economic Journal: Microeconomics </subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">14(2), May, 2022: p.176-214</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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. &#x2013; Reproduced </subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="a">American Economic Journal: Microeconomics </subfield>
  </datafield>
  <datafield tag="906" ind1=" " ind2=" ">
    <subfield code="a">RANKING</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">AR</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="9">395257</subfield>
    <subfield code="a">IIPA</subfield>
    <subfield code="b">IIPA</subfield>
    <subfield code="d">2022-12-26</subfield>
    <subfield code="h">14(2), May, 2022: p.176-214</subfield>
    <subfield code="p">AR127753</subfield>
    <subfield code="r">2022-12-26</subfield>
    <subfield code="y">AR</subfield>
  </datafield>
</record>
