IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_75.html
   My bibliography  Save this book chapter

Order Stable Solutions for Two-sided Matching Problems

In: Operations Research Proceedings 2005

Author

Listed:
  • Zbigniew Switalski

    (University of Economics)

Abstract

We concern the problem of matching the agents from two disjoint sets, such that the agents from the first set have preferences over the agents from the second set and vice versa. Typical problems of this sort are: college admissions problem, matching workers with firms, men with women (in a matrimonial agency) and so on. Classical approach to this problem comes from Gale and Shapley (1962). Recently, a far reaching generalization of Gale-Shapley approach was proposed by Alkan and Gale (2003). In our paper we present another generalization of the Gale-Shapley method, in which we use different concept of stability than the one in Alkan and Gale (the so-called order stability). We show that in some cases the order-stable solutions may be treated as more “fair” than in the Alkan and Gale’s approach. We formulate conditions under which the generalized Gale-Shapley algorithm leads to order-stable and optimal solutions and prove that these conditions are independent.

Suggested Citation

  • Zbigniew Switalski, 2006. "Order Stable Solutions for Two-sided Matching Problems," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 477-481, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_75
    DOI: 10.1007/3-540-32539-5_75
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-32539-0_75. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.