Integer Programming Based Stable and Efficiency Algorithm for Two-sided Matching with Indifferences
暂无分享,去创建一个
[1] J. V. Vate. Linear programming brings marital bliss , 1989 .
[2] Robert W. Irving. Stable Marriage and Indifference , 1994, Discret. Appl. Math..
[3] L. B. Wilson,et al. The stable marriage problem , 1971, Commun. ACM.
[4] A. Roth. The National Residency Matching Program as a labor market. , 1996, Journal of the American Medical Association (JAMA).
[5] D. Schmeidler. The Nucleolus of a Characteristic Function Game , 1969 .
[6] Naoyuki Kamiyama,et al. A New Approach to the Pareto Stable Matching Problem , 2012, Math. Oper. Res..
[7] Alvin E. Roth,et al. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .
[8] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[9] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .
[10] Christian Haas,et al. Preference-Based Resource Allocation: Using Heuristics to Solve Two-Sided Matching Problems with Indifferences , 2013, GECON.
[11] Kazuhiro Kuwabara,et al. An Integer Programming Approach for Two-Sided Matching with Indifferences , 2014, ICCCI.
[12] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.