A new fixed point approach for stable networks stable marriages

Authors:
T. Feder
Affiliations:
Computer Science Department, Stanford University, Stanford, CA
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 10
Cited 2

The complexity of counting stable marriages

SIAM Journal on Computing
Are search and decision programs computationally equivalent?

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Three fast algorithms for four problems in stable marriage

SIAM Journal on Computing
An efficient algorithm for the “optimal” stable marriage

Journal of the ACM (JACM)
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

Journal of Combinatorial Theory Series A
A fixed cube theorem for median graphs

Discrete Mathematics
The structure of the stable roomate problem: efficient representation and enumeration of all stable assignments

SIAM Journal on Computing
Introductory Combinatorics

Introductory Combinatorics
The stable roommates problem with ties

Journal of Algorithms
On the complexity of stable matchings with and without ties

On the complexity of stable matchings with and without ties

On likely solutions of a stable matching problem

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.