TL;DR
This paper introduces an efficient algorithm with quadratic time complexity to determine the efficiency of matchings in the roommates problem, improving the computational approach to a classic problem.
Contribution
The paper presents a novel $O(n^2)$-time algorithm for checking the efficiency of matchings in the roommates problem.
Findings
Algorithm runs in quadratic time
Efficiently determines matching efficiency
Improves computational methods for roommates problem
Abstract
We propose an -time algorithm to determine whether a given matching is efficient in the roommates problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSupply Chain and Inventory Management · Auction Theory and Applications