Absorbing sets in roommate problems
We analyze absorbing sets as a solution for roommate problems with strict preferences. This solution provides the set of stable matchings when it is non-empty and some matchings with interesting properties otherwise. In particular, all matchings in an absorbing set have the greatest number of agents with no incentive to change partners. These “satisfied” agents are paired in the same stable manner. In the case of multiple absorbing sets we find that any two such sets differ only in how satisfied agents are matched with each other.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Klaus Bettina & Klijn Flip & Walzl Markus, 2008.
"Stochastic Stability for Roommate Markets,"
010, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Chung, Kim-Sau, 2000. "On the Existence of Stable Roommate Matchings," Games and Economic Behavior, Elsevier, vol. 33(2), pages 206-230, November.
- E. Inarra & C. Larrea & E. Molis, 2008. "Random paths to P-stability in the roommate problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 461-471, March.
- Diamantoudi, Effrosyni & Miyagawa, Eiichi & Xue, Licun, 2004. "Random paths to stability in the roommate problem," Games and Economic Behavior, Elsevier, vol. 48(1), pages 18-28, July.
- Ehlers, Lars, 2007.
"Von Neumann-Morgenstern stable sets in matching problems,"
Journal of Economic Theory,
Elsevier, vol. 134(1), pages 537-547, May.
- EHLERS, Lars, 2005. "Von Neumann-Morgenstern Stable Sets in Matching Problems," Cahiers de recherche 12-2005, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- EHLERS, Lars, 2005. "Von Neumann-Morgenstern Stable Sets in Matching Problems," Cahiers de recherche 2005-11, Universite de Montreal, Departement de sciences economiques.
- Péter Biró & Katarína Cechlárová & Tamás Fleiner, 2008. "The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 333-352, March.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- Kalai, Ehud & Schmeidler, David, 1977.
"An admissible set occurring in various bargaining situations,"
Journal of Economic Theory,
Elsevier, vol. 14(2), pages 402-411, April.
- E. Kalai & D. Schmeidler, 1975. "An Admissible Set Occurring in Various Bargaining Situations," Discussion Papers 191, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:81:y:2013:i:c:p:165-178. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.