On a lemma of Scarf

Journal of Combinatorial Theory. Series B

Volumn 87, Issue 1, 2003, Pages 72-80

  Aharoni, Ron ^a   Fleiner, Tamás ^b,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037289254     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00028-X     Document Type: Review

References (12)

1. R. Aharoni, T. Fleiner, On a lemma of Scarf, EGRES Technical Report TR-2001-15, http://www.cs.elte.hu/egres, 2000 October.
2. R. Aharoni, R. Holzman, Fractional kernels in digraphs, J. Combin. Theory Ser. B 73 (1) (1998) 1-6.
3. T. Fleiner, A fixed-point approach to stable matchings and some applications, to appear in Math. Oper. Res.
4. T. Fleiner, Stable and crossing structures, August, 2000, Ph.D. Dissertation, http://www.renyi.hu/~fleiner.
5. D. Gale, L.S. Shapley, College admissions and stability of marriage, Amer. Math. Monthly 69 (1) (1962) 9-15.
6. R.W. Irving, An efficient algorithm for the "stable roommates" problem, J. Algorithms 6 (4) (1985) 577-595.
7. L. Lovász, Matroids and Sperner's lemma, European J. Combin. 1 (1) (1980) 65-66.
8. M.L. Balinski, Integer programming: methods, uses, computation, Management Sci. 12 (1965) 253-313.
9. L.S. Shapley, On balanced games without side payments, in: T.C. Hu, S.M. Robinson (Eds.), Mathematical Programming, Academic Press, NY, 1973, pp. 261-290.
10. B. Sands, N. Sauer, R. Woodrow, On monochromatic paths in edge-coloured digraphs, J. Combin. Theory Ser. B 33 (3) (1982) 271-275.
11. H.E. Scarf, The core of an N person game, Econometrica 35 (1967) 50-69.
12. J.J.M. Tan, A necessary and sufficient condition for the existence of a complete stable matching, J. Algorithms 12 (1) (1991) 154-178.