Published September 24, 2023
| Version v1
Journal article
Open
Analysis and solutions to the stable roommate problem: An examination of complexity, stability, and matching algorithms
Authors/Creators
- 1. Research Scholar, Madhyanchal Professional University, Bhopal, Madhya Pradesh, India
- 2. Department of Mathematics, Madhyanchal Professional University, Madhya Pradesh, India
Description
Roommate issues with strong preferences are defined here. An extension of the Stable Marriage Problem that does not include two partners is the Stable Roommates Problem, or SR. The complexity and approximability of the problem of computing an egalitarian stable matching in instances of d-SRI.
Files
2-3-92.1.pdf
Files
(397.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c7444c4ec62a721f02aafff3443c2ef1
|
397.6 kB | Preview Download |