Skip to main content
SpringerLink
Log in
Book cover

International Conference on Integer Programming and Combinatorial Optimization

IPCO 1999: Integer Programming and Combinatorial Optimization pp 429–438Cite as

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1610))

Abstract

This paper is motivated by a study of the mechanism used to assign primary school students in Singapore to secondary schools. The assignment process requires that primary school students submit a rank ordered list of six schools to the Ministry of Education. Students are then assigned to secondary schools based on their preferences, with priority going to those with the highest examination scores on the Primary School Leaving Examination (PSLE). The current matching mechanism is plagued by several problems, and a satisfactory resolution of these problems necessitates the use of a stable matching mechanism. In fact, the student-optimal and school-optimal matching mechanisms of Gale and Shapley [2] are natural candidates.

Research supported by a NUS Research grant RP 3970021.

Research supported by an IBM Fellowship.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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. Dubins, L.E. and D.A. Freedman (1981), “Machiavelli and the Gale-Shapley Algorithm.” American Mathematical Monthly, 88, pp485–494.

    Article  MATH  MathSciNet  Google Scholar 

  2. Gale, D., L. S. Shapley (1962). College Admissions and the Stability of Marriage. American Mathematical Monthly 69 9–15.

    Article  MATH  MathSciNet  Google Scholar 

  3. Gale, D., M. Sotomayor (1985a). Some Remarks on the Stable Matching Problem. Discrete Applied Mathematics 11 223–232.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gale, D., M. Sotomayor (1985b). Ms Machiavelli and the Stable Matching Problem. American Mathematical Monthly 92 261–268.

    Article  MATH  MathSciNet  Google Scholar 

  5. Gusfield, D., R. W. Irving (1989). The Stable Marriage Problem: Structure and Algorithms, MIT Press, Massachusetts.

    MATH  Google Scholar 

  6. Pittel B. (1989), the Average Number of Stable Matchings, SIAM Journal of Discrete Mathematics, 530–549.

    Google Scholar 

  7. Roth, A.E. (1982). The Economics of Matching: Stability and Incentives. Mathematics of Operations Research 7 617–628.

    Article  MATH  MathSciNet  Google Scholar 

  8. Roth, A.E., M. Sotomayor (1991). Two-sided Matching: A Study in Game-theoretic Modelling and Analysis, Cambridge University Press, Cambridge.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Decision Sciences, Faculty of Business Administration, National University of Singapore, Singapore

    Chung-Piaw Teo & Wee-Peng Tan

  2. Operations Research Center, MIT, Cambridge, MA, 02139

    Jay Sethuraman

Authors
  1. Chung-Piaw Teo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jay Sethuraman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wee-Peng Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GSIA, Carnegie Mellon University, Schenley Park, Pittsburgh, PA, 15213, USA

    Gérard Cornuéjols

  2. Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010, Graz, Austria

    Rainer E. Burkard  & Gerhard J. Woeginger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Teo, CP., Sethuraman, J., Tan, WP. (1999). Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract). In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-48777-8_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66019-4

  • Online ISBN: 978-3-540-48777-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation