The geometry of fractional stable matchings and its applications

Mathematics of Operations Research

Volumn 23, Issue 4, 1998, Pages 874-891

  Teo, Chung Piaw ^a   Sethuraman, Jay ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Linear programming; Rounding; Stable matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING;

FRACTIONAL STABLE MATCHINGS;

LINEAR PROGRAMMING;

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

References (19)

1. Abeledo, H. G., Y. Blum. 1996. Stable matchings and linear programming. Linear Algebra Appl. 245 321-333.
2. _, _, U. G. Rothblum. 1996. Canonical monotone decompositions of fractional stable matchings. Internat. J. Game Theory 25 161-176.
3. _, U. G. Rothblum. 1994. Stable matching and linear inequalities. Discrete Appl. Math. 54 1-27.
4. Feder, T. 1992. A new fixed point approach for stable networks and stable marriages. J. Comput. System Sci. 45 233-284.
5. Gale, D., L. S. Shapley. 1962. College admissions and the stability of marriage. Amer. Math. Monthly 69 9-15.
6. Grotschel, M., L. Lovász, A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin.
7. Gusfield, D., R. W. Irving. 1989. The Stable Marriage Problem: Structure and Algorithms, MIT Press, Massachusetts.
8. Irving, R. W. 1985. An efficient algorithm for the stable roommates problem. J. Algorithms 6 577-595.
9. _, P. Leather, D. Gusfield. 1987. An efficient algorithm for the optimal stable marriage problem. J. ACM 34 532-543.
10. Karp, R. M., C. H. Papadimitriou. 1982. On linear characterizations of combinatorial optimization problems. SIAM J. Comput. 11 620-632.
11. Knuth, D. E. 1976. Marriages Stables, Les Presses de l'Université de Montreal, Montreal.
12. Raghavan, P., C. Thompson. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 365-374.
13. Roth, A. E. 1984. The evolution of the labor market for medical interns and residents: A case study in game theory. J. Political Economy 92 991-1016.
14. _, U. G. Rothblum, J. H. Vande Vate. 1993. Stable matching, optimal assignments and linear programming. Math. Oper. Res. 18 808-828.
15. _, M. Sotomayor. 1991. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis, Cambridge University Press, Cambridge.
16. Rothblum, U. G. 1992. Characterization of stable matchings as extreme points of a poly tope. Math. Programming 54 57-67.
17. Subramanian, A. 1994. A new approach to stable matching problems. SIAM J. Comput. 23 671-700.
18. Teo, C. P., J. Sethuraman. 1997. LP based approach to optimal stable matchings. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA) 710-719.
19. Vande Vate, J. H. 1989. Linear programming brings marital bliss. Oper Res. Lett. 8 147-153.