✦ LIBER ✦

A maximum stable matching for the roommates problem

✍ Scribed by Jimmy J. M. Tan

Publisher: Springer Netherlands
Year: 1990
Tongue: English
Weight: 704 KB
Volume: 30
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The dynamics of stable matchings and hal

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems

✍ Péter Biró; Katarína Cechlárová; Tamás Fleiner 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

The Stable Roommates Problem with Ties

✍ Robert W. Irving; David F. Manlove 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 183 KB

We study the variant of the well-known stable roommates problem in which participants are permitted to express ties in their preference lists. In this setting, more than one definition of stability is possible. Here we consider two of these stability criteria, so-called super-stability and weak stab

An efficient algorithm for the “stable r

An efficient algorithm for the “stable roommates” problem

✍ Robert W Irving 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 938 KB

The Stable Roommates Problem with Choice

The Stable Roommates Problem with Choice Functions

✍ Tamás Fleiner 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 459 KB

Efficient labelling algorithms for the m

Efficient labelling algorithms for the maximum noncrossing matching problem

✍ Federico Malucelli; Thomas Ottmann; Daniele Pretolani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A further note on the stable matching pr

A further note on the stable matching problem

✍ Gabrielle Demange; David Gale; Marilda Sotomayor 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 317 KB