A fixed-point approach to stable matchings and some applications

Mathematics of Operations Research

Volumn 28, Issue 1, 2003, Pages 103-126

  Fleiner, Tamás ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Fixed point theorem; Lattice polyhedron; Stable marriage problem; Stable matching

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

CONTOR-BERNSTEIN THEOREM; FIXED POINT APPROACH; PYM LINKING THEOREM; STABLE MATCHINGS;

GRAPH THEORY;

EID: 0038638952     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.28.1.103.14256     Document Type: Article

References (38)

1. Adachi, Hiroyuki. 2000. On a characterization of stable matchings. Econom. Lett. 68(1) 43-49.
2. Aharoni, Ron, Tamás Fleiner. 2001. On a lemma of scarf. Technical report, EGRES report TR-2001-15. http://www.cs.elte.hu/egres.
3. Alkan, Ahmet. 2000. A class of multipartner matching models with a strong lattice structure. Econom. Theory. Forthcoming.
4. Birkhoff, Garrett. 1948. Lattice Theory. American Mathematical Society, New York.
5. Blair, Charles. 1988. The lattice structure of the set of stable matchings with multiple partners. Math. Oper. Res. 13(4) 619-628.
6. Brualdi, R. A., J. S. Pym. 1971. A general linking theorem in directed graphs. Studies in Pure Mathematics (Presented to Richard Rado). Academic Press, London, U.K., 17-29.
7. Conforti, M., R. Hassin, R. Ravi. 1999. Reconstructing flow paths. Forthcoming.
8. Crawford, Vincent P., Elsie Marie Knoer. 1981. Job matching with heterogenious firms and workers. Econometrica 49 437-450.
9. Feder, Tomás. 1992. A new fixed point approach for stable networks and stable marriages. J. Comput. System Sci. 45(2) 233-284. (Twenty-First Symposium on the Theory of Computing, Seattle, WA, 1989).
10. Fleiner, Tamás. 2000. Stable and crossing structures. Ph.D. dissertation, http://www.renyi.hu/~fleiner.
11. ____. 2002. On the stable b-matching polytope. Technical report, EGRES report TR-2002-03, http://www.cs.elte.hu/egres.
12. Fulkerson, D. R. 1970. Blocking polyhedra. Graph theory and its applications. Proc. Adv. Semin. Math. Research Center, Univ. of Wisconsin, Madison, WI, 1969. Academic Press, New York, 93-112.
13. ____. 1971. Blocking and anti-blocking pairs of polyhedra. Math. Programming 1 168-194.
14. ____. 1972. Anti-blocking polyhedra. J. Combin. Theory Ser. B 12 50-71.
15. Gale, David. 2001. The two-sided matching problem. Origin, development and current issues. Internat. Game Theory Rev. 3(2-3) 237-252. (Special issue on operations research and game theory with economic and industrial applications, Chennai 2001.)
16. ____. L. S. Shapley. 1962. College admissions and stability of marriage. Amer. Math. Monthly 69(1) 9-15.
17. Galvin, Fred. 1995. The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63(1) 153-158.
18. Gusfield, Dan, Robert W. Irving. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA.
19. Hoffman, A. J., D. E. Schwartz. 1978, On lattice polyhedra. Combinatorics, Proc. Fifth Hungarian Colloq., Keszthely, 1976, vol. I. North-Holland, Amsterdam, The Netherlands, 593-598.
20. Ingleton, A. W., M. J. Piff. 1973. Gammoids and transversal matroids. J. Combin. Theory Ser. B 15 51-68.
21. Kelso, Jr., Alexander S., Vincent P. Crawford. 1982. Job matching, coalition formation, and gross substitutes. Econometrica 50 1483-1504.
22. Knaster, Bronisław. 1928. Un théorème sur les fonctions d'ensembles. Ann. Soc. Polon. Math. 6 133-134.
23. Knuth, Donald E. 1997. Stable Marriage and Its Relation to Other Combinatorial Problems. American Mathematical Society, Providence, RI. (An introduction to the mathematical analysis of algorithms, translated from the French by Martin Goldstein and revised by the author.)
24. Kundu, Sukhamay, Eugene L. Lawler. 1973. A matroid generalization of a theorem of Mendelsohn and Dulmage. Discrete Math. 4 159-163.
25. Lévy, Azriel. 1979. Basic Set Theory. Springer-Verlag, Berlin, Germany.
26. Mendelsohn, N. S., A. L. Dulmage. 1958. Some generalizations of the problem of distinct representatives. Canadian J. Math. 10 230-241.
27. Pym, J. S., 1969a. The linking of sets in graphs. J. London Math. Soc. 44 542-550.
28. ____, 1969b. A proof of the linkage theorem. J. Math. Anal. Appl. 27 636-638.
29. Roth, Alvin E. 1984a. The evolution of the labor market for medical interns and residents: A case study in game theory. J. Political Economy Y2(6) 991-1016.
30. ____. 1984b. Stability and polarization of interests in job matching. Econometrica 52(1) 47-57.
31. ____. 1985. Conflict and coincidence of interest in job matching: Some new results and open questions. Math. Oper. Res. 10(3) 379-389.
32. ____, Marilda A. Oliveira Sotomayor. 1990. Two-Sided Matching. Cambridge University Press, Cambridge, U.K.
33. Rothblum, Uriel G. 1992. Characterization of stable matchings as extreme points of a polytope. Math. Programming Ser. A 54(1) 57-67.
34. Sands, B., N. Sauer, R. Woodrow. 1982. On monochromatic paths in edge-coloured digraphs. J. Combin. Theory Ser. B 33(3) 271-275.
35. Schrijver, Alexander. 1986. Theory of Linear and Integer Programming. John Wiley & Sons Ltd., Chichester, U.K.
36. Subramanian, Ashok. 1994. A new approach to stable matching problems. SIAM J. Comput. 23(4) 671-700.
37. Tarski, Alfred. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5 285-310.
38. Vande Vate, John H. 1989. Linear programming brings marital bliss. Oper. Res. Lett. 8(3) 147-153.