IDEAS home Printed from https://ideas.repec.org/a/bla/jpbect/v27y2025i4ne70044.html
   My bibliography  Save this article

Limited Farsightedness in Priority‐Based Matching

Author

Listed:
  • Ata Atay
  • Ana Mauleon
  • Vincent Vannetelbosch

Abstract

We introduce the horizon‐ k $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 $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 $k$ vNM stable set.

Suggested Citation

  • Ata Atay & Ana Mauleon & Vincent Vannetelbosch, 2025. "Limited Farsightedness in Priority‐Based Matching," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 27(4), August.
    • Handle: RePEc:bla:jpbect:v:27:y:2025:i:4:n:e70044
    DOI: 10.1111/jpet.70044
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/jpet.70044
    Download Restriction: no
    File URL: https://libkey.io/10.1111/jpet.70044?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:bla:jpbect:v:27:y:2025:i:4:n:e70044. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/apettea.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.