<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605475431</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100352.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00199-014-0820-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00199-014-0820-4</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Morrill</subfield>
   <subfield code="D">Thayer</subfield>
   <subfield code="u">North Carolina State University, Raleigh, NC, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Two simple variations of top trading cycles</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Thayer Morrill]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Top Trading Cycles is widely regarded as the preferred method of assigning students to schools when the designer values efficiency over fairness. However, Top Trading Cycles has an undesirable feature when objects may be assigned to more than one agent as is the case in the school choice problem. If agent $$i$$ i 's most preferred object $$a$$ a has a capacity of $$q_a$$ q a , and $$i$$ i has one of the $$q_a$$ q a highest priorities at $$a$$ a , then Top Trading Cycles will always assign $$i$$ i to $$a$$ a . However, until $$i$$ i has the highest priority at $$a$$ a , Top Trading Cycles allows $$i$$ i to trade her priority at other objects in order to receive $$a$$ a . Such a trade is not necessary for $$i$$ i 's assignment and may cause a distortion in the fairness of the assignment. We introduce two simple variations of Top Trading Cycles in order to mitigate this problem. The first, Clinch and Trade, reduces the number of unnecessary trades but is bossy and depends on the order in which cycles are processed. The second, First Clinch and Trade, is nonbossy and independent of the order in which cycles are processed but allows more unnecessary trades than is required to be strategyproof and efficient. Both rules are strategyproof.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Top trading cycles</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">School choice</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Assignment</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Economic Theory</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">60/1(2015-09-01), 123-140</subfield>
   <subfield code="x">0938-2259</subfield>
   <subfield code="q">60:1&lt;123</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">60</subfield>
   <subfield code="o">199</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00199-014-0820-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00199-014-0820-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Morrill</subfield>
   <subfield code="D">Thayer</subfield>
   <subfield code="u">North Carolina State University, Raleigh, NC, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Economic Theory</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">60/1(2015-09-01), 123-140</subfield>
   <subfield code="x">0938-2259</subfield>
   <subfield code="q">60:1&lt;123</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">60</subfield>
   <subfield code="o">199</subfield>
  </datafield>
 </record>
</collection>
