| Reference: | [1] A.Alkan,"Nonexistence of stable threesome matchings", Mathematical Social Sciences, 16:207-209,1988.
[2] L.E. Dubins and D. Freedman," Machiavelli and the Gale-Shapley algorithm", American Mathematical Monthly, 88 : 485-494, 1981.
[3] D. Gale and L.S. Shapley, "College admissions and the stability of marriage", American Mathematical M onthly,69:9-15,1962.
[4] D. Gusfield, "The structure of the stable room-mates problem: effcient representation and enumeration of all stable assignments" ,SIMA Journal on Computing ,17: 742-769,1988.
[5]D. Gusfield and R.W. Ivring, "The stable marriage problem: structure and algorithms" ,MIT press,Cambridge,1989.
[6] R.W. Irving," An efficient algorithm for the stable room-mates problem", Journal of Algorithms,6: 577-595,1985.
[7] D. McVitie and L.B. Wilson, "The stable marriage problem", Communications of the A. C.M.,14: 486-490,1971.
[8] A.E. Roth and M. Sotomayor, "Two sided matching: a study in game- theoretic modelling and analysis" ,Book to be published by Cambridge University Press,Econometric Series, 1991.
[9]M. Shubik," Game theory in the social sciences concepts and solution" ,MIT Press,Cambridge,1982.
[10] J.M. Tan," A necessary and sufficient condition for the existence of a complete stable matching", Journal of Algorithms,12:154-178,1991.
[11] T. Quint, "The core of an m-sided assignment game". Games and Economic Behavior,3:487-503,1991. |
