A new fixed point approach for stable networks stable marriages

Abstract

In a network stability problem, the aim is to find stable configurations for a given network of Boolean gates. For general networks, the problem is known to be computationally hard. Mayr and Subramanian [22,23] introduced an interesting class of networks by imposing fanout restrictions at each gate, and showed that network stability on this class of networks is still sufficiently rich to express as special cases the well-known stable marriage and stable roommate problems.In this paper we study the sequential and parallel complexity of network stability on networks with restricted fanout. Our approach builds on structural properties of these networks, and exposes close ties with the theory of retracts and isometric embeddings for product graphs. This structure gives then new efficient algorithms for questions of representation, enumeration and optimality in stable matching.