FEEM working papers "Note di lavoro" series
2003 .117

Stable Matchings for a Generalised Marriage Problem

Authors: Somdeb Lahiri
Series: Economy and Society
Type: Journal
Keywords: Stable outcomes,Matchings,pay-offs,Generalised marriage problem,Contract choice problem
JEL n.: C71,C78
JEL: Computational & Mathematical Organization Theory
Pages: 10, 323-334
Date: 2004


We show that a simple generalisation of the Deferred Acceptance Procedure with men proposing due to Gale and Shapley (1962) yields outcomes for a generalised marriage problem, which are necessarily stable. We also show that any outcome of this procedure is Weakly Pareto Optimal for Men, i.e. there is no other outcome which all men prefer to an outcome of this procedure. In a final concluding section of this paper, we consider the problem of choosing a set of multi-party contracts, where each coalition of agents has a non-empty finite set of feasible contracts to choose from. We call such problems, generalised contract choice problems. The model we propose is a generalisation of the model due to Shapley and Scarf (1974) called the housing market. We are able to show with the help of a three agent example, that there exists a generalised contract choice problem, which does not admit any stable outcome.

Download file
Download PDF file

FEEM Newsletter & Update

Subscribe to stay connected.

Your personal data will be processed by Fondazione Eni Enrico Mattei. – data Controller – with the aim of emailing the FEEM newsletter & Update. The use of Your email address is necessary for the implementation of the newsletter service. You are invited to read the Privacy Policy in order to obtain additional information about the protection of Your rights.

This Website uses technical cookies and cookie analytics, as well as “third party” profiling cookies.
If you close this banner or you decide to continue navigating on this Website, you express consent to the use of cookies. If you need additional information or you wish to express selective choices on the use of cookies, please refer to the   Cookie PolicyI agree