The Stable Marriage Problem

The StableMarriage Problem StructureDan GusfieldRobert IrvingSusumu Hayashi and Hiroshi Nakano. PX, a computational logic. MIT Press, Cambridge, Mass., 1988...

An instance of the stable marriage problem of size n involves n men and n women. Each participant ranks all members of the opposite sex in order of ...

This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the design and analysis of ...

stable matchingsSize versus stabilityStrategic issuesFurther resultsStable Marriage problem with Forbidden pairsBalanced stable matchingsRationalizing matchingsDinitz ...

In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their ...

In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation or ordinal ...

An Empirical Local Search for the Stable Marriage ProblemAbstract This paper proposes a local search algorithm to find the egalitarian and the sex-equal ...

Content delivery networks that distribute much of the world's content and services solve this large and complex stable marriage problem between users and ...

> 1 (where the first contribution plays no role) conversely a value of U = 0 corresponds to the standard stable marriage problem. At this point we ...

The proof of Theorem 3.1 shows that the problem of finding a maximum cardinality weakly stable matching for an instance of SMTI is NP-hard, even if ...