A Matroid Approach to Stable Matchings with Lower Quotas
Published Online:3 Feb 2016https://doi.org/10.1287/moor.2015.0751
References
- (2010) The college admissions problem with lower and common quotas. Theoret. Comput. Sci. 411(34–36):3136–3153.Crossref, Google Scholar
- (1988) The lattice structure of the set of stable matchings with multiple partners. Math. Oper. Res. 13(4):619–628.Link, Google Scholar
- (2014) School choice with controlled choice constraints: Hard bounds versus soft bounds. J. Econom. Theory 153:648–683.Crossref, Google Scholar
- (2000) Stable and Crossing Structures. PhD thesis, the Centrum voor Wiskunde en Informatica.Google Scholar
- (2001) A matroid generalization of the stable matching polytope. Aardal K, Gerards B, eds. Proc. 8th Conf. Integer Programming and Combinatorial Optim. Lecture Notes in Computer Science Vol. 2081 (Springer, Berlin), 105–114.Crossref, Google Scholar
- (2003) A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28(1):103–126.Link, Google Scholar
- (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.Crossref, Google Scholar
- (2014) Strategy-proof matching with regional minimum quotas. Lomuscio A, Scerri P, Bazzan A, Huhns M, eds. Proc. 13th Internat. Conf. Autonomous Agents and Multi-Agent Systems, AAMAS ’14 (IFAAMS, Richland, SC), 1225–1232.Google Scholar
- (1989) The Stable Marriage Problem: Structure and Algorithm (MIT Press, Cambridge, MA).Google Scholar
- (2016) The hospitals/residents problem with lower quotas. Algorithmica 74(1):440–465.Crossref, Google Scholar
- (2010) Classified stable matching. Charikar M, ed. Proc. 21st Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’10 (SIAM, Philadelphia), 1235–1253.Crossref, Google Scholar
- (2011) Matroid Theory, 2nd edn. (Oxford University Press, Oxford, UK).Crossref, Google Scholar
- (1990) Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis, Vol. 18, Economic Society Monographs (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
- (1992) Characterization of stable matchings as extreme points of a polytope. Math. Programming, Ser. A 54(1):57–67.Crossref, Google Scholar
- (1989) Linear programming brings marital bliss. Oper. Res. Lett. 8(3):147–153.Crossref, Google Scholar

