Affinely representable lattices, stable matchings, and choice functions
暂无分享,去创建一个
[1] A. Roth. Stability and Polarization of Interests in Job Matching , 1984 .
[2] M. Aizerman,et al. General theory of best variants choice: Some aspects , 1981 .
[3] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .
[4] Kentaro Tomoeda,et al. Finding a Stable Matching under Type-specific Minimum Quotas , 2018, J. Econ. Theory.
[5] Alvin E. Roth,et al. Stable Matchings, Optimal Assignments, and Linear Programming , 1993, Math. Oper. Res..
[6] F. Kojima,et al. Efficient Matching under Distributional Constraints: Theory and Applications , 2015 .
[7] J. V. Vate. Linear programming brings marital bliss , 1989 .
[8] Tamás Fleiner,et al. Egerváry Research Group on Combinatorial Optimization on the Stable B-matching Polytope on the Stable B-matching Polytope , 2022 .
[9] Kemal Yildiz,et al. On Capacity-Filling and Substitutable Choice Rules , 2018, Math. Oper. Res..
[10] A. Roth. On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets , 1986 .
[11] Robert W. Irving,et al. An efficient algorithm for the “optimal” stable marriage , 1987, JACM.
[12] Robert W. Irving,et al. The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..
[13] Paul R. Milgrom,et al. Matching with Contracts , 2005 .
[14] Jordi Massó,et al. An algorithm to compute the full set of many-to-many stable matchings , 2004, Math. Soc. Sci..
[15] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[16] William H. Lane,et al. Stable Marriage Problem , 2001 .
[17] Ahmet Alkan,et al. On preferences over subsets and the lattice structure of stable matchings , 2001 .
[18] Charles Blair,et al. The Lattice Structure of the Set of Stable Matchings with Multiple Partners , 1988, Math. Oper. Res..
[19] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .
[20] G. Birkhoff. Rings of sets , 1937 .
[21] Ahmet Alkan,et al. A class of multipartner matching markets with a strong lattice structure , 2002 .
[22] L. B. Wilson,et al. The stable marriage problem , 1971, Commun. ACM.
[23] Aseem Agrawal,et al. Polynomial time algorithm for an optimal stable assignment with multiple partners , 2007, Theor. Comput. Sci..
[24] Tayfun Sönmez,et al. Matching with Contracts: Comment , 2013 .
[25] Michel Balinski,et al. The stable admissions polytope , 2000, Math. Program..
[26] Rakesh V. Vohra,et al. Stable Matching with Proportionality Constraints , 2019, Oper. Res..
[27] Atila Abdulkadiroglu,et al. School Choice: A Mechanism Design Approach , 2003 .
[28] Christopher P. Chambers,et al. Choice and Matching , 2013 .
[29] Uriel G. Rothblum,et al. Characterization of stable matchings as extreme points of a polytope , 1992, Math. Program..
[30] David Manlove,et al. Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.
[31] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[32] Richard P. Stanley,et al. Two poset polytopes , 1986, Discret. Comput. Geom..
[33] Alfonso Cevallos,et al. On 2-Level Polytopes Arising in Combinatorial Settings , 2017, SIAM J. Discret. Math..
[34] Michel Balinski,et al. Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) , 2000, Discret. Appl. Math..
[35] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[36] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[37] L. S. Shapley,et al. College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..
[38] F. Echenique,et al. How to Control Controlled School Choice , 2014 .