Stable fractional matchings
暂无分享,去创建一个
[1] David Manlove,et al. Hard variants of stable marriage , 2002, Theor. Comput. Sci..
[2] Ulle Endriss,et al. Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms , 2020, AAAI.
[3] Patrick Prosser,et al. SAT Encodings of the Stable Marriage Problem with Ties and Incomplete Lists , 2002 .
[4] Fahiem Bacchus,et al. Strategy-Proofness in the Stable Matching Problem with Couples , 2016, AAMAS.
[5] Noga Alon,et al. Redesigning the Israeli Medical Internship Match , 2018, TEAC.
[6] David Manlove,et al. Stable Marriage with Ties and Bounded Length Preference Lists , 2006, ACiD.
[7] Robert W. Irving. An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.
[8] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .
[9] Elliot Anshelevich,et al. Anarchy, stability, and utopia: creating better matchings , 2009, Autonomous Agents and Multi-Agent Systems.
[10] David Manlove,et al. Mathematical models for stable matching problems with ties and incomplete lists , 2018, Eur. J. Oper. Res..
[11] Zhuoshu Li,et al. Incorporating Compatible Pairs in Kidney Exchange: A Dynamic Weighted Matching Model , 2019, EC.
[12] Xing Wang,et al. Stable Matching for Dynamic Ride-Sharing Systems , 2014, Transp. Sci..
[13] Toby Walsh,et al. Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences , 2013, Algorithms.
[14] Ryo Yoshinaka. Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete , 2005, RTA.
[15] Chung-Piaw Teo,et al. The Geometry of Fractional Stable Matchings and Its Applications , 1998, Math. Oper. Res..
[16] Siddharth Barman,et al. Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem , 2014, SIAM J. Comput..
[17] David Manlove,et al. A Constraint Programming Approach to the Stable Marriage Problem , 2001, CP.
[18] David Manlove,et al. “Almost-stable” matchings in the Hospitals / Residents problem with Couples , 2016, Constraints.
[19] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[20] Robert W. Irving,et al. An efficient algorithm for the “optimal” stable marriage , 1987, JACM.
[21] Federico Echenique,et al. Ordinal and cardinal solution concepts for two-sided matching , 2017, Games Econ. Behav..
[22] Makoto Yokoo,et al. Strategyproof matching with regional minimum and maximum quotas , 2016, Artif. Intell..
[23] Xiao-Dong Hu,et al. The Maximum-Weight Stable Matching Problem: Duality and Efficiency , 2012, SIAM J. Discret. Math..
[24] Alistair J. Wilson,et al. Clearinghouses for two-sided matching: An experimental study , 2016 .
[25] Parag A. Pathak,et al. The New York City High School Match , 2005 .
[26] Fahiem Bacchus,et al. SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples , 2015, IJCAI.
[27] Elliot Anshelevich,et al. Matching, cardinal utility, and social welfare , 2010, SECO.
[28] David Manlove,et al. A Constraint Programming Approach to the Hospitals / Residents Problem , 2007, CPAIOR.
[29] Dan Gusfield,et al. Three Fast Algorithms for Four Problems in Stable Marriage , 1987, SIAM J. Comput..
[30] Scott Duke Kominers,et al. Multilateral matching , 2015, J. Econ. Theory.
[31] Makoto Yokoo,et al. Strategy-proof school choice mechanisms with minimum quotas and initial endowments , 2017, Artif. Intell..
[32] Bettina Klaus,et al. Random matching under priorities: stability and no envy concepts , 2017, Soc. Choice Welf..
[33] Alvin E. Roth,et al. Stable Matchings, Optimal Assignments, and Linear Programming , 1993, Math. Oper. Res..
[34] J. V. Vate. Linear programming brings marital bliss , 1989 .
[35] Kolos Csaba Ágoston,et al. Integer programming methods for special college admissions problems , 2016, J. Comb. Optim..
[36] David Manlove,et al. Preference Elicitation in Matching Markets via Interviews: A Study of Offline Benchmarks (Extended Abstract) , 2016, AAMAS.
[37] Akiko Kato,et al. Complexity of the sex-equal stable marriage problem , 1993 .
[38] Paul G. Spirakis,et al. The Computational Complexity of Weighted Greedy Matching , 2017, AAAI.
[39] Tomás Feder,et al. A New Fixed Point Approach for Stable Networks and Stable Marriages , 1992, J. Comput. Syst. Sci..
[40] David Manlove,et al. Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.
[41] Battal Dogan,et al. Efficiency and Stability of Probabilistic Assignments in Marriage Problems , 2015, Games Econ. Behav..
[42] Craig Boutilier,et al. Elicitation and Approximately Stable Matching with Partial Preferences , 2013, IJCAI.
[43] Rakesh V. Vohra,et al. Stable matchings and linear programming , 2012 .
[44] Tamás Fleiner,et al. Fractional solutions for capacitated NTU-games, with applications to stable matchings , 2016, Discret. Optim..
[45] Uriel G. Rothblum,et al. Characterization of stable matchings as extreme points of a polytope , 1992, Math. Program..
[46] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[47] M. Ostrovsky,et al. Stability and Competitive Equilibrium in Trading Networks , 2013, Journal of Political Economy.
[48] H. Moulin,et al. Random Matching under Dichotomous Preferences , 2004 .
[49] Jens Gudmundsson,et al. Compromises and Rewards: stable and non-manipulable probabilistic matching , 2018, International Journal of Game Theory.
[50] A. Roth,et al. The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.
[51] Tamás Fleiner,et al. On a lemma of Scarf , 2003, J. Comb. Theory, Ser. B.