Results 261 to 270 of about 2,017,974 (284)
Some of the next articles are maybe not open access.
On the decomposability of the stable marriage problem
BIT, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Generalization of the Stable Marriage Problem
Journal of the Operational Research Society, 1981In 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.
openaire +2 more sources
Of Stable Marriages and Graphs, and Strategy and Polytopes
SIAM Review, 1997Summary: This expository paper develops the principal known results (and some new ones) on the stable matchings of marriage games in the language of directed graphs. This both unifies and simplifies the presentation and renders it more symmetric. In addition, it yields a new algorithm and a new proof for the existence of stable matchings, new proofs ...
Michel Balinski, Guillaume Ratier
openaire +1 more source
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications
Management Science, 2001Chung Piaw Teo, Jay Sethuraman
exaly
A stable marriage requires communication
Games and Economic Behavior, 2019Rafail Ostrovsky +2 more
exaly
A stable marriage of Poisson and Lebesgue
Annals of Probability, 2006Christopher Hoffman +1 more
exaly