𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A probabilistic version of the stable marriage problem

✍ Scribed by Stephen Y. Itoga

Publisher
Springer Netherlands
Year
1983
Tongue
English
Weight
489 KB
Volume
23
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bistable Versions of the Marriages and R
Bistable Versions of the Marriages and Roommates Problems
✍ B.P. Weems πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 291 KB

A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the

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

A probabilistic version of Ostrowski ine
A probabilistic version of Ostrowski inequality
✍ Mingjin Wang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 203 KB

In this paper, a probabilistic version of the Ostrowski inequality is shown. Applications of the probabilistic version are also given.