Abstract
We characterize the set of stable matchings when individuals are farsighted and when they choose their objections optimally along a farsighted objection path. We use a solution concept called maximal farsighted set (MFS), which is an adaptation of the concepts developed in Dutta and Vohra (2017) and Dutta and Vartiainen (2020) to one-to-one matching problems. MFS always exists, but it need not be unique. There is a unique largest MFS that contains all other, which is equal to the largest consistent set of Chwe (1994). This implies that the largest consistent set embodies the idea of maximality in one-to-one matching problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have