IDEAS home Printed from https://ideas.repec.org/p/ulb/ulbeco/2013-375261.html
   My bibliography  Save this paper

Essays on Matching Theory

Author

Listed:
  • Umutcan Salman

Abstract

Echenique et. al. (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a corresponding bipartite graph. From this, we obtain a simple condition that verifies whether a given aggregate matching is rationalisable. For matchings that are not rationalisable, we provide a simple greedy algorithm that computes the minimum number of matches that needs to be removed to obtain a rationalisable matching. We also show that the related problem of finding the minimum number of types that we need to remove in order to obtain a rationalisable matching is NP-complete.

Suggested Citation

  • Umutcan Salman, 2024. "Essays on Matching Theory," ULB Institutional Repository 2013/375261, ULB -- Universite Libre de Bruxelles.
    • Handle: RePEc:ulb:ulbeco:2013/375261
    Note: Degree: Doctorat en Sciences économiques et de gestion
    as

    Download full text from publisher

    File URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/375261/3/tableofcontents.pdf
    File Function: Table of content
    Download Restriction: no
    ---><---

    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:ulb:ulbeco:2013/375261. 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: Benoit Pauwels (email available below). General contact details of provider: https://edirc.repec.org/data/ecsulbe.html .

    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.