Testing substitutability of weak preferences
暂无分享,去创建一个
[1] Robert W. Irving. An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.
[2] Tayfun Sönmez,et al. Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts , 2012 .
[3] Alvin E. Roth,et al. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .
[4] Nicole Immorlica,et al. Testing substitutability , 2012, Games Econ. Behav..
[5] Orhan Aygün,et al. The Importance of Irrelevance of Rejected Contracts in Matching under Weakened Substitutes Conditions , 2012 .
[6] Coralio Ballester,et al. NP-completeness in hedonic games , 2004, Games Econ. Behav..
[7] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[8] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[9] Eytan Ronn,et al. NP-Complete Stable Matching Problems , 1990, J. Algorithms.
[10] David Manlove,et al. Hard variants of stable marriage , 2002, Theor. Comput. Sci..
[11] A. Roth. Stability and Polarization of Interests in Job Matching , 1984 .
[12] Alvin E. Roth. Deferred acceptance algorithms: history, theory, practice, and open questions , 2008, Int. J. Game Theory.
[13] Marilda Sotomayor. Three remarks on the many-to-many stable matching problem , 1999 .