The stable matching problem is that of matching two sets of agents in such a manner that no two unmatched agents prefer each other to their actual partners under the matching. In this paper we present some special kinds of preference patterns and discuss the elementary properties for stable matching instances with these specific preference patterns.
Relation:
International Journal of Computer Mathematics 38(3-4):153-161
