The Geometry of Fractional Stable Matchings and Its Applications

Published Online:https://doi.org/10.1287/moor.23.4.874

References

  • Abeledo H. G. , Blum Y. Stable matchings and linear programming. Linear Algebra Appl. (1996) 245 321 333 CrossrefGoogle Scholar
  • Abeledo H. G. , Blum Y. , Rothblum U. G. Canonical monotone decompositions of fractional stable matchings. Internat. J. Game Theory (1996) 25 161 176 CrossrefGoogle Scholar
  • Abeledo H. G. , Rothblum U. G. Stable matching and linear inequalities. Discrete Appl. Math. (1994) 54 1 27 CrossrefGoogle Scholar
  • Feder T. A new fixed point approach for stable networks and stable marriages. J. Comput. System Sci. (1992) 45 233 284 CrossrefGoogle Scholar
  • Gale D. , Shapley L. S. College admissions and the stability of marriage. Amer. Math. Monthly (1962) 69 9 15 CrossrefGoogle Scholar
  • Grötschel M. , Lovász L. , Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Gusfield D. , Irving R. W. The Stable Marriage Problem: Structure and Algorithms (1989) (MIT Press, Massachusetts) Google Scholar
  • Irving R. W. An efficient algorithm for the stable roommates problem. J. Algorithms (1985) 6 577 595 CrossrefGoogle Scholar
  • Irving R. W. , Leather P. , Gusfield D. An efficient algorithm for the optimal stable marriage problem. J. ACM (1987) 34 532 543 CrossrefGoogle Scholar
  • Karp R. M. , Papadimitriou C. H. On linear characterizations of combinatorial optimization problems. SIAM J. Comput. (1982) 11 620 632 CrossrefGoogle Scholar
  • Knuth D. E. Marriages Stables (1976) (Les Presses de l'Université de Montreal, Montreal) Google Scholar
  • Raghavan P. , Thompson C. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica (1987) 7 365 374 CrossrefGoogle Scholar
  • Roth A. E. The evolution of the labor market for medical interns and residents: A case study in game theory. J. Political Econom. (1984) 92 991 1016 CrossrefGoogle Scholar
  • Roth A. E. , Rothblum U. G. , Vande Vate J. H. Stable matching, optimal assignments and linear programming. Math. Oper. Res. (1993) 18 808 828 LinkGoogle Scholar
  • Roth A. E. , Sotomayor M. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (1991) (Cambridge University Press, Cambridge) Google Scholar
  • Rothblum U. G. Characterization of stable matchings as extreme points of a polytope. Math. Programming (1992) 54 57 67 CrossrefGoogle Scholar
  • Subramanian A. A new approach to stable matching problems. SIAM J. Comput. (1994) 23 671 700 CrossrefGoogle Scholar
  • Teo C. P. , Sethuraman J. LP based approach to optimal stable matchings. Proc. Eighth Annual ACM-SIAM Sympos. Discrete Algorithms (1997) New Orleans, LA 710 719 Google Scholar
  • Vande Vate J. H. Linear programming brings marital bliss. Oper. Res. Lett. (1989) 8 147 153 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.