Show simple item record

dc.contributor.authorAshlagi, Itai
dc.contributor.authorBraverman, Mark
dc.contributor.authorHassidim, Avinatan
dc.date.accessioned2014-06-02T17:22:51Z
dc.date.available2014-06-02T17:22:51Z
dc.date.issued2011-06
dc.date.submitted2010-10
dc.identifier.isbn9781450302616
dc.identifier.issn1544-5372
dc.identifier.issn1544-5380
dc.identifier.urihttp://hdl.handle.net/1721.1/87606
dc.description.abstractIt is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for large random markets the algorithm will find a stable matching with high probability. In our model we allow the number of couples to grow at a near-linear rate. Furthermore, truth-telling is an approximated equilibrium in the game induced by the new matching algorithm. Our results are tight: for markets in which the number of couples grows at a linear rate, we show that with constant probability no stable matching exists.en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1993574.1993628en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceOther univ. web domainen_US
dc.titleMatching with couples revisiteden_US
dc.typeArticleen_US
dc.identifier.citationAshlagi, Itai, Mark Braverman, and Avinatan Hassidim. “Matching with Couples Revisited. [Extended Abstract]” Proceedings of the 12th ACM Conference on Electronic Commerce - EC ’11 (2011), June 5-9, 2011, San Jose, California, USA.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.mitauthorAshlagi, Itaien_US
dc.relation.journalProceedings of the 12th ACM conference on Electronic Commerce - EC '11en_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsAshlagi, Itai; Braverman, Mark; Hassidim, Avinatanen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-2124-738X
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record