A new fixed point approach for stable networks stable marriages

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.