𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Impossibilities for roommate problems

✍ Scribed by İpek Özkal-Sanver

Book ID
104045954
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
259 KB
Volume
59
Category
Article
ISSN
0165-4896

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

The Roommate Problem (Mile High Happines
The Roommate Problem (Mile High Happiness)
✍ Mariah Ankenman 📂 Fiction 📅 2020 🏛 Entangled Publishing, LLC (Lovestruck) 🌐 en-AU ⚖ 208 KB 👁 2 views

To Moira “Mo” Rossi, the world is full of sunshine, goodness, and happily ever afters—so of course she figures finding the perfect roomie will be easy. But after four creepos who ask if benefits come with the room and one woman who claims she’s a vampire, Mo is officially desperate. So what if the g

The Stable Roommates Problem with Ties
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