𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the decomposability of the stable marriage problem

✍ Scribed by Eugene Veklerov

Publisher
Springer Netherlands
Year
1989
Tongue
English
Weight
331 KB
Volume
29
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The stable marriage problem with restric
The stable marriage problem with restricted pairs
✍ VΓ’nia M.F. Dias; Guilherme D. da Fonseca; Celina M.H. de Figueiredo; Jayme L. Sz πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 210 KB

A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ranks the members of the opposite sex in order of

On the stable marriage polytope
On the stable marriage polytope
✍ Guillaume Ratier πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 727 KB

The stable marriage problem is a game theoretic model introduced by Gale and Shapley (1962). It involves two sets of players referred to as men and women. A marriage is a set of disjoint pairs, where each pair consists of a woman and a man. Each individual has a strict linear order of preference ove