<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01705nab a2200229 i 4500</leader>
  <controlfield tag="001">acta32913</controlfield>
  <controlfield tag="005">20260306085924.0</controlfield>
  <controlfield tag="008">161017s2013    hu      o     000   eng d</controlfield>
  <datafield tag="022" ind1=" " ind2=" ">
   <subfield code="a">0001-6969</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">SZTE Egyetemi Kiadványok Repozitórium</subfield>
   <subfield code="b">hun</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Komornik Vilmos</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Conditional stable matchings</subfield>
   <subfield code="h">[elektronikus dokumentum] /</subfield>
   <subfield code="c"> Komornik Vilmos</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
   <subfield code="a">Bolyai Institute, University of Szeged</subfield>
   <subfield code="b">Szeged</subfield>
   <subfield code="c">2013</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">715-731</subfield>
  </datafield>
  <datafield tag="490" ind1="0" ind2=" ">
   <subfield code="a">Acta scientiarum mathematicarum</subfield>
   <subfield code="v">79 No. 3-4</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In matching theory of contracts the substitutes condition plays an essential role to ensure the existence of stable matchings. We study manyto-many matchings where groups of individuals, of size possibly greater than two, are matched to a set of institutions. Real-world examples include orphan brothers accepting an adoptive family conditional on all of them being included; hiring contracts that may only be chosen together; or a situation where a firm accepts to hire several workers only if they accept to work on different days (part-time jobs). We demonstrate by several examples that such extra conditions may alter the natural choice maps so that stable matchings cannot be obtained by applying the standard theorems. We overcome this difficulty by introducing a new construction of choice maps. We prove that they yield stable matchings if the construction respects an &quot;anti-trust&quot; rule on the supply side of the market.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
   <subfield code="a">Természettudományok</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
   <subfield code="a">Matematika</subfield>
  </datafield>
  <datafield tag="695" ind1=" " ind2=" ">
   <subfield code="a">Matematika</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2="1">
   <subfield code="a">Viauroux Christelle K.</subfield>
   <subfield code="e">aut</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">http://acta.bibl.u-szeged.hu/32913/1/math_079_numb_003_004_715-731.pdf</subfield>
   <subfield code="z">Dokumentum-elérés </subfield>
  </datafield>
 </record>
</collection>
