Abstract
The stable roommates problem with n agents has worst case complexity O(n2) in time and space. Random instances can be solved faster and with less memory, however. We introduce an algorithm that has average time and space complexity for random instances. We use this algorithm to simulate large instances of the stable roommates problem and to measure the probabilty pn that a random instance of size n admits a stable matching. Our data support the conjecture that pn = Θ(n−1/4).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Statistical Mechanics: Theory and Experiment
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
