The stable matching polytope is a geometric representation of the set of all stable matchings in a bipartite graph, where one set of vertices represents one group (such as men) and the other set represents another group (such as women). The concept is closely tied to the stable marriage problem, which seeks to find a stable match between two equally sized groups based on preferences.
Articles by others on the same topic
There are currently no matching articles.