Efficiency in the Roommates Problem

We propose an $O(n^2)$-time algorithm to determine whether a given matching is efficient in the roommates problem.