Skip to main content

Complete stable marriages and systems of I-M preferences

Invited Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 884)

Abstract

Recently, we have introduced the notion of stable permutations in Latin squares. In this paper, we introduce the systems of I-M preferences in the marriage theory and we prove that in such a system, the study of stable marriages in two matrices is equivalent to the study of stable permutations in one matrix.

Keywords

  • Ideal Maximum
  • Pair Matrice
  • Stable Marriage
  • Inverse Preference
  • Latin Rectangle

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Dénes and A.D. Keedwell, Latin Squares and Their Applications. Academic Press. New York and London 1974.

    MATH  Google Scholar 

  2. D. Gale and L.S. Shapley, College admissions and the stability of marriages. Amer. Math. Monthly 69 (1962), 9–15.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. J.S. Hwang, Stable permutations in Latin squares. Soochow J. Math. 4 (1978), 63–72.

    MathSciNet  MATH  Google Scholar 

  4. J. S. Hwang, On the invariance of stable permutations in Latin rectangles (to appear in ARS Combinatoria).

    Google Scholar 

  5. D. E. Knuth, Mariages stables et leurs relations avec d'autres problèmes combinatoires. Les Presses de l'Université de Montréal 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Hwang, J.S. (1981). Complete stable marriages and systems of I-M preferences. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091807

Download citation

  • DOI: https://doi.org/10.1007/BFb0091807

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive