Abstract
In this paper we extend the results of Gale and Shapely on the stable marriage problem. The set of participants in an assignment configuration is allowed to expand dynamically as long as certain relative preference conditions are maintained. The impact of this extension on complexity and performance issues are discussed.