Limited Farsightedness in Priority‐Based Matching

Ata Atay, Ana Mauleon and Vincent Vannetelbosch

Journal of Public Economic Theory, 2025, vol. 27, issue 4

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.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/jpet.70044

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jpbect:v:27:y:2025:i:4:n:e70044

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=1097-3923

Access Statistics for this article

Journal of Public Economic Theory is currently edited by Rabah Amir, Gareth Myles and Myrna Wooders

More articles in Journal of Public Economic Theory from Association for Public Economic Theory Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().