论文信息 - The Two-Sided Matching Problem: Origin, Development and Current Issues - 字舞流文

The Two-Sided Matching Problem: Origin, Development and Current Issues

David Gale | D. Gale

[1] Charles Eugene Blair,et al. Every Finite Distributive Lattice Is a Set of Stable Matchings , 1984, J. Comb. Theory A.

[2] Charles Blair,et al. The Lattice Structure of the Set of Stable Matchings with Multiple Partners , 1988, Math. Oper. Res..

[3] Alvin E. Roth,et al. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[4] Robert W. Irving,et al. The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..

[5] David A. Freedman,et al. Machiavelli and the Gale-Shapley Algorithm , 1981 .

[6] David Gale,et al. Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[7] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .

[8] A. Roth. The college admissions problem is not equivalent to the marriage problem , 1985 .

[9] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.