IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/3334.html

Limited Farsightedness in Priority‐Based Matching

Author

Listed:
  • Atay, Ata

    (University of Barcelona)

  • Mauleon, Ana

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Vannetelbosch, Vincent

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

Abstract

We introduce the horizon‐k vNM stable set to study one‐to‐one priority‐based matching problems with limited farsightedness. We show that, once agents are sufficiently farsighted, the matching obtained from the Top Trading Cycles (TTC) algorithm becomes stable: a singleton set consisting of the TTC matching is a horizon‐k vNM stable set if the degree of farsightedness is greater than three times the number of agents in the largest cycle of the TTC. Our main results do not hold per se for many‐to‐one priority‐based matching problems: more coordination and cooperation on behalf of the agents are required. In the presence of couples, farsightedness may improve both efficiency and stability. When each agent owns an object, a singleton set consisting of the TTC matching is the unique horizon‐k vNM stable set.

Suggested Citation

  • Atay, Ata & Mauleon, Ana & Vannetelbosch, Vincent, 2025. "Limited Farsightedness in Priority‐Based Matching," LIDAM Reprints CORE 3334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:3334
    DOI: https://doi.org/10.1111/jpet.70044
    Note: In: Journal of Public Economic Theory, 2025, vol. 27 (4), e70044
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:cor:louvrp:3334. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.