Characterisation of Strongly Stable Matchings

Pratik Ghosal, Adam Kunysz, Katarzyna Paluch

An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A\cup B,E)$, with an adjacency list of each vertex being a linearly ordered list of…