On random stable partitions
It is well known that the one-sided stable matching problem (“stable roommates problem”) does not necessarily have a solution. We had found that, for the independent, uniformly random preference lists, the expected number of solutions converges to e1 / 2 as n, the number of members, grows, and with...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Verlag
2019
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |