About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A new fixed point approach for stable networks and 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 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 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 then gives new efficient algorithms for questions of representation, enumeration, and optimization in stable matching. © 1992.
Related
Conference paper
Efficient Generalization with Distributionally Robust Learning
Short paper