Stable matchings and linear programming

Linear Algebra and Its Applications

Volumn 245, Issue , 1996, Pages 321-333

  Abeledo, Hernán ^a   Blum, Yosef ^b  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030501040     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(95)00052-6     Document Type: Article

References (15)

1. H. Abeledo and G. Isaak, A characterization of graphs which assure the existence of stable matchings, Math. Social Sci. 22:93-96 (1991).
2. H. Abeledo and U. Rothblum, Stable matchings and linear inequalities, Discrete Appl. Math. 54:1-27 (1994).
3. B. Bollobás, Graph Theory: An Introductory Course, Springer-Verlag, New York, 1979.
4. T. Feder, A new fixed point approach for stable networks and stable marriages, presented at Twenty-First Annual Symposium on Theory of Computing, 1989.
5. D. Gale and L. S. Shapley, College admissions and the stability of marriage, Amer. Math. Monthly 69:9-15 (1962).
6. D. Gusfield and R. W. Irving, The Stable Marriage Problem: Structure and Algorithms, MIT Press, Cambridge, Mass., 1989.
7. R. W. Irving, An efficient algorithm for the stable room-mates problem, J. Algorithms 6:577-595 (1985).
8. R. Karp and C. Papadimitriou, On linear characterizations of combinatorial optimization problems, in Proceedings of the Twenty-First Annual Symposium of the Foundations of Computer Science, IEEE, 1980, pp. 1-9.
9. D. Knuth, Mariages Stables, Presses Univ. Montreal, Montreal, 1976.
10. W. R. Pulleyblank, Polyhedral combinatorics, in Mathematical Programming: The State of the Art (A. Bachem, M. Grötschel, and B. Korte, Eds.), Springer-Verlag, Berlin, 1983, pp. 312-345.
11. A. E. Roth, U. G. Rothblum, and J. H. Vande Vate, Stable matchings, optimal assignments and linear programming, RUTCOR Research Report 23-90, Rutgers Univ., 1990; Math. Oper. Res., to appear.
12. A. E. Roth and M. Sotomayor, Two Sided Matchings; A Study in Game-Theoretic Modeling and Analysis, Econometric Soc. Monograph Ser., Cambridge U.P., 1990.
13. U. G. Rothblum, Characterization of stable matchings as extreme points of a polytope, Math. Programming 53:57-67 (1992).
14. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1989.
15. J. H. Vande Vate, Linear programming brings marital bliss, Oper. Res. Lett. 8:147-153 (1989).