Stable Matchings for a Generalised Marriage Problem

16 Pages Posted: 22 Jan 2004

Date Written: December 2003

Abstract

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.

Keywords: Stable outcomes, Matchings, pay-offs, Generalised marriage problem, Contract choice problem

JEL Classification: C71, C78

Suggested Citation

Lahiri, Somdeb, Stable Matchings for a Generalised Marriage Problem (December 2003). Available at SSRN: https://ssrn.com/abstract=486090 or http://dx.doi.org/10.2139/ssrn.486090

Somdeb Lahiri (Contact Author)

Lok Jagruti (LJ) University ( email )

S.G. Road & Kataria Motors
Sarkhej Circle
Ahmedabad, IN Gujarat 382210
India

HOME PAGE: http://https://sites.google.com/view/somdeblahiri/home

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
96
Abstract Views
1,202
Rank
496,248
PlumX Metrics