Stable project allocation under distributional constraints

Operations Research Perspectives - Tập 5 - Trang 59-68 - 2018
Kolos Csaba Ágoston1, Péter Biró2,3, Richárd Szántó4
1Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Fövám tér 13-15, Budapest H-1093, Hungary
2Institute of Economics, Research Centre for Economic and Regional Studies, Hungarian Academy of Sciences, Budaörsi út 45, Budapest H-1112, Hungary
3Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Hungary
4Department of Decision Sciences, Corvinus University of Budapest, Fövám tér 13-15, Budapest H-1093, Hungary

Tài liệu tham khảo

Abdulkadiroğlu, 2005, College admissions with affirmative action, Int J Game Theory, 33, 535, 10.1007/s00182-005-0215-7 Abdulkadiroğlu, 2007 Abdulkadiroğlu, 2005, The New York City high school match, Am Econ Rev, Papers Proc, 95, 364, 10.1257/000282805774670167 Abdulkadiroğlu, 2005, The Boston public school match, Am Econ Rev, Papers Proc, 95, 368, 10.1257/000282805774669637 Ágoston, 2017, Modelling preference ties and equal treatment policy, 516 Ágoston, 2016, Integer programming methods for special college admissions problems, J Comb Optim, 32, 1371, 10.1007/s10878-016-0085-x Arulselvan, 2018, Matchings with lower quotas: algorithms and complexity, Algorithmica, 80, 185, 10.1007/s00453-016-0252-6 Aygün, 2013 Aygün, 2016 Baïou, 2000, The stable admissions polytope, Math Program, 87, 427, 10.1007/s101070050004 Biró, 2017, Applications of matching models under preferences, 345 Biró, P. (2014a). Matching practices for secondary schools – Hungary. Matching-in-practice.eu, Accessed on 23 August. Biró, P. (2014b). University admission practices - hungary. Matching-in-practice.eu, Accessed on 23 August. Biró, 2011, Stable matching with couples – an empirical study, ACM J Exp Algorithmics, 16, 10.1145/1963190.1970372 Biró, 2014, The hospitals / residents problem with couples: complexity and integer programming models, 10 Blum, 1997, Vacancy chains and equilibration in senior-level labor markets, ACM J Exp Algorithmics, 76, 362 Bo, 2016, Fair implementation of diversity in school choice, Games Econ Behav, 97, 54, 10.1016/j.geb.2016.03.003 McBride, 2016, Almost stable” matchings in the hospitals / residents problem with couples, Constraints, 22, 50 Cao, 2010, Optimizing the marriage market: an application of the linear assignment model, Eur J Oper Res, 202, 547, 10.1016/j.ejor.2009.06.009 Diebold, 2017, Matching with indifferences: a comparison of algorithms in the context of course allocation, Eur J Oper Res, 260, 268, 10.1016/j.ejor.2016.12.011 Drummond, 2015, SAT Is an effective and complete method for solving stable matching problems with couples Echenique, 2015, How to control controlled school choice, Am Econ Rev, 105, 2679, 10.1257/aer.20130929 Ehlers, 2014, School choice with controlled choice constraints: hard bounds versus soft bounds, J Econ Theory, 153, 648, 10.1016/j.jet.2014.03.004 Firat, 2016, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Eur J Oper Res, 251, 676, 10.1016/j.ejor.2015.11.039 Fleiner, 2016, A matroid approach to stable matchings with lower quotas, Math Oper Res, 41, 734, 10.1287/moor.2015.0751 Gale, 1962, College admissions and the stability of marriage, Am Math Mon, 69, 9, 10.1080/00029890.1962.11989827 Goto, 2017, Designing matching mechanisms under general distributional constraints, Am Econ J, 9, 226 Huang, 2010, Classified stable matching, 1235 Irving, 2008, Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems, J Comb Optim, 16, 279, 10.1007/s10878-007-9133-x Kamada, 2014, Efficient matching under distributional constraints: theory and applications, Am Econ Rev, 105, 67, 10.1257/aer.20101552 Kamada, 2017, Stability concepts in matching under distributional constraints, J Econ Theory, 168, 107, 10.1016/j.jet.2016.12.006 Kamada, 2017, Recent developments in matching with constraints, Am Econ Rev, 107, 200, 10.1257/aer.p20171047 Kojima, 2012, School choice: impossibilities for affirmative action, Games Econ Behav, 75, 685, 10.1016/j.geb.2012.03.003 Kwanashie, 2014, An integer programming approach to the hospitals / residents problem with ties, 263 Manlove, 2013 Manlove, 2002, Hard variants of stable marriage, Theor Comput Sci, 276, 261, 10.1016/S0304-3975(01)00206-7 Nguyen, 2017, Stable matching with proportionality constraints, 675 Pentico, 2007, Assignment problems: a golden anniversary survey, Eur J Oper Res, 176, 774, 10.1016/j.ejor.2005.09.014 Ronn, 1990, NP-complete stable matching problems, J Algo, 11, 285, 10.1016/0196-6774(90)90007-2 Roth, 1984, The evolution of the labor market for medical interns and residents: a case study in game theory, J Polit Econ, 6, 991, 10.1086/261272 Roth, 1986, On the allocation of residents to rural hospitals: a general property of two-sided matching markets, Ecnometrica, 54, 425, 10.2307/1913160 Roth, 1999, The redesign of the matching market for american physicians: some engineering aspects of economic design, Am Econ Rev, 89, 748, 10.1257/aer.89.4.748 Roth, 1990 Yokoi, 2016, A generalized polymatroid approach to stable matchings with lower quotas, Math Oper Res, 42, 238, 10.1287/moor.2016.0802 Yokoi, Y. (2017). Envy-free matchings with lower quotas. arXiv:1704.04888. Wu, Q., & Roth, A. E. (2016). The lattice of envy-free matchings. mimeo.