Stable Matching with Proportionality Constraints
Published Online:3 Sep 2019https://doi.org/10.1287/opre.2019.1909
References
- (2003) School choice: A mechanism design approach. Amer. Econom. Rev. 93(3):729–747.Crossref, Google Scholar
- (2018) Stable project allocation under distributional constraints. Oper. Res. Perspect. 5:59–68.Crossref, Google Scholar
- (2016) Dynamic reserves in matching markets: Theory and applications. Working paper, Bogazici University, Istanbul.Google Scholar
- (2010) The college admissions problem with lower and common quotas. Theoret. Comput. Sci. 411(34):3136–3153.Crossref, Google Scholar
- (2013) Designing random allocation mechanisms: Theory and applications. Amer. Econom. Rev. 103(2):585–623.Crossref, Google Scholar
- (2015) How to control controlled school choice. Amer. Econom. Rev. 105(8):2679–2694.Crossref, Google Scholar
- (2014) School choice with controlled choice constraints: Hard bounds vs. soft bounds. J. Econom. Theory 153:648–683.Crossref, Google Scholar
- (2016) The efficiency of race-neutral alternatives to race-based affirmative action: Evidence from Chicago’s exam schools. NBER Working Paper 22589, National Bureau of Economic Research, Cambridge, MA.Google Scholar
- (2012) Prioritizing diversity in school choice. Working paper, Washington University, St. Louis.Google Scholar
- (2016) A matroid approach to stable matchings with lower quotas. Math. Oper. Res. 41(2):734–744.Link, Google Scholar
- (2016) Improving matching under hard distributional constraints. Theoret. Econom. 12(2):863–908.Google Scholar
- (2019) Matching for the Israeli mechinot gap year: Handling rich diversity requirements. Proc. 2019 ACM Conf. Econom. Comput. (ACM, New York), 321–321.Google Scholar
- (2013) Effective affirmative action in school choice. Theoret. Econom. 8(2):325–363.Crossref, Google Scholar
- (2010) Classified stable matching. Charikar M, ed. Proc. 21st Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1235–1253.Crossref, Google Scholar
- (2012) School choice: Impossibilities for affirmative action. Games Econom. Behav. 75(2):685–693.Crossref, Google Scholar
- (2018) Designing matching mechanisms under constraints: An approach from discrete convex analysis. J. Econom. Theory 176:803–833.Crossref, Google Scholar
- (1988) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Crossref, Google Scholar
- (2018) Near-feasible stable matchings with couples. Amer. Econom. Rev. 108(11):3154–3169.Crossref, Google Scholar
- (1967) The core of an n– person game. Econometrica 35(1):50–69.Crossref, Google Scholar
- (2018) Computational testing of Scarf algorithm for near feasible stable matching with couples. Working paper, University of Michigan, Ann Arbor.Google Scholar

