Efficiency in the Roommates Problem
Abstract
We propose an O(n2)-time algorithm to determine whether a given matching is efficient in the roommates problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.