Farsightedly Stable Matchings

Abstract

We study the properties of von Neumann-Morgenstern farsightedly stable sets in application to matching models. We show that the result by Diamantoudi and Xue (2003) for hedonic games can be extended to a general matching with contracts framework: a collection of singleton stable sets constitutes a weak core of the matching with contracts game. We also show that singleton stable sets are invariant under different contractual languages.