The roommate problem: is more stable than you think
Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and ta...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
München
CESifo
2014
|
Schriftenreihe: | CESifo working paper
4676 : Category 12, Empirical and theoretical methods |
Online-Zugang: | http://www.cesifo-group.de/ifoHome/publications/working-papers/CESifoWP/CESifoWPdetails?wp_id=19107330 Volltext |
Zusammenfassung: | Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and tastes (types). As a consequence, when the number of individuals of any given type is large enough there always exist "quasi-stable" matchings: a stable matching can be restored with minimal policy intervention. Our results build on an analogy with an associated bipartite problem; it follows that the tools crafted in empirical studies of the marriage problem can easily be adapted to the roommate problem. |
Beschreibung: | 30 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV041946744 | ||
003 | DE-604 | ||
005 | 20140829 | ||
007 | t | ||
008 | 140701s2014 |||| 00||| eng d | ||
035 | |a (OCoLC)890335693 | ||
035 | |a (DE-599)GBV78088728X | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-19 |a DE-521 | ||
084 | |a QB 910 |0 (DE-625)141231: |2 rvk | ||
100 | 1 | |a Chiappori, Pierre-André |d 1955- |e Verfasser |0 (DE-588)124033504 |4 aut | |
245 | 1 | 0 | |a The roommate problem |b is more stable than you think |c Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié |
264 | 1 | |a München |b CESifo |c 2014 | |
300 | |a 30 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a CESifo working paper |v 4676 : Category 12, Empirical and theoretical methods | |
520 | 1 | |a Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and tastes (types). As a consequence, when the number of individuals of any given type is large enough there always exist "quasi-stable" matchings: a stable matching can be restored with minimal policy intervention. Our results build on an analogy with an associated bipartite problem; it follows that the tools crafted in empirical studies of the marriage problem can easily be adapted to the roommate problem. | |
700 | 1 | |a Galichon, Alfred |e Verfasser |0 (DE-588)1045766704 |4 aut | |
700 | 1 | |a Salanié, Bernard |e Verfasser |0 (DE-588)124033520 |4 aut | |
830 | 0 | |a CESifo working paper |v 4676 : Category 12, Empirical and theoretical methods |w (DE-604)BV013978326 |9 4676 | |
856 | 4 | |u http://www.cesifo-group.de/ifoHome/publications/working-papers/CESifoWP/CESifoWPdetails?wp_id=19107330 | |
856 | 4 | 1 | |u http://www.cesifo-group.de/de/ifoHome/search/result.html?main.query=4676 |x Verlag |z kostenfrei |3 Volltext |
912 | |a ebook | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-027389804 |
Datensatz im Suchindex
_version_ | 1804152325718147072 |
---|---|
any_adam_object | |
author | Chiappori, Pierre-André 1955- Galichon, Alfred Salanié, Bernard |
author_GND | (DE-588)124033504 (DE-588)1045766704 (DE-588)124033520 |
author_facet | Chiappori, Pierre-André 1955- Galichon, Alfred Salanié, Bernard |
author_role | aut aut aut |
author_sort | Chiappori, Pierre-André 1955- |
author_variant | p a c pac a g ag b s bs |
building | Verbundindex |
bvnumber | BV041946744 |
classification_rvk | QB 910 |
collection | ebook |
ctrlnum | (OCoLC)890335693 (DE-599)GBV78088728X |
discipline | Wirtschaftswissenschaften |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02118nam a2200349 cb4500</leader><controlfield tag="001">BV041946744</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140829 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140701s2014 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)890335693</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV78088728X</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-521</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QB 910</subfield><subfield code="0">(DE-625)141231:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chiappori, Pierre-André</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124033504</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The roommate problem</subfield><subfield code="b">is more stable than you think</subfield><subfield code="c">Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">CESifo</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">30 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">CESifo working paper</subfield><subfield code="v">4676 : Category 12, Empirical and theoretical methods</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and tastes (types). As a consequence, when the number of individuals of any given type is large enough there always exist "quasi-stable" matchings: a stable matching can be restored with minimal policy intervention. Our results build on an analogy with an associated bipartite problem; it follows that the tools crafted in empirical studies of the marriage problem can easily be adapted to the roommate problem.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Galichon, Alfred</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1045766704</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Salanié, Bernard</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124033520</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">CESifo working paper</subfield><subfield code="v">4676 : Category 12, Empirical and theoretical methods</subfield><subfield code="w">(DE-604)BV013978326</subfield><subfield code="9">4676</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.cesifo-group.de/ifoHome/publications/working-papers/CESifoWP/CESifoWPdetails?wp_id=19107330</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://www.cesifo-group.de/de/ifoHome/search/result.html?main.query=4676</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027389804</subfield></datafield></record></collection> |
id | DE-604.BV041946744 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:08:55Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027389804 |
oclc_num | 890335693 |
open_access_boolean | 1 |
owner | DE-12 DE-19 DE-BY-UBM DE-521 |
owner_facet | DE-12 DE-19 DE-BY-UBM DE-521 |
physical | 30 S. |
psigel | ebook |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | CESifo |
record_format | marc |
series | CESifo working paper |
series2 | CESifo working paper |
spelling | Chiappori, Pierre-André 1955- Verfasser (DE-588)124033504 aut The roommate problem is more stable than you think Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié München CESifo 2014 30 S. txt rdacontent n rdamedia nc rdacarrier CESifo working paper 4676 : Category 12, Empirical and theoretical methods Stable matchings may fail to exist in the roommate matching problem, both when utility is transferable and when it is not. We show that when utility is transferable, the existence of a stable matching is restored when there is an even number of individuals of indistinguishable characteristics and tastes (types). As a consequence, when the number of individuals of any given type is large enough there always exist "quasi-stable" matchings: a stable matching can be restored with minimal policy intervention. Our results build on an analogy with an associated bipartite problem; it follows that the tools crafted in empirical studies of the marriage problem can easily be adapted to the roommate problem. Galichon, Alfred Verfasser (DE-588)1045766704 aut Salanié, Bernard Verfasser (DE-588)124033520 aut CESifo working paper 4676 : Category 12, Empirical and theoretical methods (DE-604)BV013978326 4676 http://www.cesifo-group.de/ifoHome/publications/working-papers/CESifoWP/CESifoWPdetails?wp_id=19107330 http://www.cesifo-group.de/de/ifoHome/search/result.html?main.query=4676 Verlag kostenfrei Volltext |
spellingShingle | Chiappori, Pierre-André 1955- Galichon, Alfred Salanié, Bernard The roommate problem is more stable than you think CESifo working paper |
title | The roommate problem is more stable than you think |
title_auth | The roommate problem is more stable than you think |
title_exact_search | The roommate problem is more stable than you think |
title_full | The roommate problem is more stable than you think Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié |
title_fullStr | The roommate problem is more stable than you think Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié |
title_full_unstemmed | The roommate problem is more stable than you think Pierre-André Chiappori ; Alfred Galichon ; Bernard Salanié |
title_short | The roommate problem |
title_sort | the roommate problem is more stable than you think |
title_sub | is more stable than you think |
url | http://www.cesifo-group.de/ifoHome/publications/working-papers/CESifoWP/CESifoWPdetails?wp_id=19107330 http://www.cesifo-group.de/de/ifoHome/search/result.html?main.query=4676 |
volume_link | (DE-604)BV013978326 |
work_keys_str_mv | AT chiapporipierreandre theroommateproblemismorestablethanyouthink AT galichonalfred theroommateproblemismorestablethanyouthink AT salaniebernard theroommateproblemismorestablethanyouthink |