An algorithm to compute the full set of many-to-many stable matchings
No abstract is available for this item.
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.:
- Marilda Sotomayor, 1999. "The lattice structure of the set of stable outcomes of the multiple partners assignment game," International Journal of Game Theory, Springer, vol. 28(4), pages 567-583.
- Ahmet Alkan, 2001. "original papers : On preferences over subsets and the lattice structure of stable matchings," Review of Economic Design, Springer, vol. 6(1), pages 99-111.
- Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
- 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.
- Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:47:y:2004:i:2:p:187-210. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.