Stable Matching with Proportionality Constraints

Published Online:https://doi.org/10.1287/opre.2019.1909

References

  • Abdulkadiroglŭ A, Sönmez T (2003) School choice: A mechanism design approach. Amer. Econom. Rev. 93(3):729–747.CrossrefGoogle Scholar
  • Ágoston KC, Biró P, Szántó R (2018) Stable project allocation under distributional constraints. Oper. Res. Perspect. 5:59–68.CrossrefGoogle Scholar
  • AygunO, TurhanB (2016) Dynamic reserves in matching markets: Theory and applications. Working paper, Bogazici University, Istanbul.Google Scholar
  • Biró P, Fleiner T, Irving RW, Manlove DF (2010) The college admissions problem with lower and common quotas. Theoret. Comput. Sci. 411(34):3136–3153.CrossrefGoogle Scholar
  • Budish E, Che Y-K, Kojima F, Milgrom P (2013) Designing random allocation mechanisms: Theory and applications. Amer. Econom. Rev. 103(2):585–623.CrossrefGoogle Scholar
  • Echenique F, Yenmez MB (2015) How to control controlled school choice. Amer. Econom. Rev. 105(8):2679–2694.CrossrefGoogle Scholar
  • Ehlers L, Hafalir IE, Yenmez MB, Yildirim MA (2014) School choice with controlled choice constraints: Hard bounds vs. soft bounds. J. Econom. Theory 153:648–683.CrossrefGoogle Scholar
  • Ellison G, Pathak PA (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
  • Erdil A, Kumano T (2012) Prioritizing diversity in school choice. Working paper, Washington University, St. Louis.Google Scholar
  • Fleiner T, Kamiyama N (2016) A matroid approach to stable matchings with lower quotas. Math. Oper. Res. 41(2):734–744.LinkGoogle Scholar
  • Fragiadakis D, Troyan P (2016) Improving matching under hard distributional constraints. Theoret. Econom. 12(2):863–908.Google Scholar
  • Gonczarowski YA, Kovalio L, Nisan N, Romm A (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
  • Hafalir IE, Yenmez MB, Yildirim MA (2013) Effective affirmative action in school choice. Theoret. Econom. 8(2):325–363.CrossrefGoogle Scholar
  • Huang C-C (2010) Classified stable matching. Charikar M, ed. Proc. 21st Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1235–1253.CrossrefGoogle Scholar
  • Kojima F (2012) School choice: Impossibilities for affirmative action. Games Econom. Behav. 75(2):685–693.CrossrefGoogle Scholar
  • Kojima F, Tamura A, Yokoo M (2018) Designing matching mechanisms under constraints: An approach from discrete convex analysis. J. Econom. Theory 176:803–833.CrossrefGoogle Scholar
  • Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (Wiley-Interscience, New York).CrossrefGoogle Scholar
  • Nguyen T, Vohra R (2018) Near-feasible stable matchings with couples. Amer. Econom. Rev. 108(11):3154–3169.CrossrefGoogle Scholar
  • Scarf HE (1967) The core of an n– person game. Econometrica 35(1):50–69.CrossrefGoogle Scholar
  • Tang D, Nguyen T, Subramanian V, Vohra R (2018) Computational testing of Scarf algorithm for near feasible stable matching with couples. Working paper, University of Michigan, Ann Arbor.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.