The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders

Due to the famous Gale-Shapley Theorem we know that each classical marriage problem admits at least one stable matching. This fact inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to find the minimum number of unstable matchings, among all such problems of size $n$. In this paper we deal with this issue for the generalized Gale-Shapley model and discuss it in the context of the classical model.

MoreLess

Year of publication:	2015
Authors:	Drgas-Burchardt, Ewa
Published in:	Operations Research and Decisions. - Wydział Informatyki i Zarządzania. - Vol. 1.2015, p. 5-15
Publisher:	Wydział Informatyki i Zarządzania
Subject:	Combinatorial problems \| stable matching \| Gale-Shapley model

More details

Extent:	application/pdf
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011265357