Bistable versions of the marriages and roommates problems

Journal of Computer and System Sciences

Volumn 59, Issue 3, 1999, Pages 504-520

  Weems, B P ^a  

^a University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

STABLE MARRIAGES PROBLEMS; STABLE ROOMMATES PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 0033284629     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1657     Document Type: Article

References (13)

1. Gale D., Shapley L. S. College admissions and the stability of marriage. Amer. Math. Monthly. 69:1962;9-15.
2. Gratzer G. Lattice Theory. 1971;Freeman, San Francisco.
3. Gusfield D., Irving R. W. The Stable Marriage Problem: Structure and Algorithms. 1989;MIT Press, Cambridge.
4. Irving R. W. An efficient algorithm for the stable room-mates problem. J. Algorithms. 6:1985;577-595.
5. Irving R. W., Leather P. The complexity of counting stable marriages. SIAM J. Comput. 15:1986;655-667.
6. Knuth D. E. Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. CRM Proceedings & Lecture Notes 10. 1997;Amer. Math. Soc. Providence.
7. Koutsofios E., North S. C. AT&T Technical Report. October 18, 1993.
8. Ng C., Hirschberg D. S. Three-dimensional stable matching problems. SIAM J. Discrete Math. 4:1991;245-252.
9. Roth A. E., Sotomayor M. A. O. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Econometric Society Monograph 18. 1990;Cambridge University Press, New York.
10. Rothblum U. G. Characterization of stable matchings as extreme points of a polytope. Math. Programming. 54:1992;57-67.
11. Subramanian A. A new approach to stable matching problems. SIAM J. Comput. 23:1994;671-700.
12. Vande Vate J. H. Linear programming gives marital bliss. Oper. Res. Lett. 8:1989;147-153.
13. Weems B. P. UTA Technical Report. December 1998.