A New Approach to Stable Matching Problems

DOI10.1137/S0097539789169483zbMath0808.68077MaRDI QIDQ4305353

Ashok Subramanian

Publication date: 13 September 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

bipartite weighted matchingstable matching problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Circuits, networks (94C99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (25)

Complexity models for incremental computation ⋮ Popular matchings in complete graphs ⋮ Two problems in max-size popular matchings ⋮ Review of the theory of stable matchings and contract systems ⋮ The Stable Roommates Problem with Choice Functions ⋮ The stable roommates problem with choice functions ⋮ Three-sided stable matchings with cyclic preferences ⋮ Circular stable matching and 3-way kidney transplant ⋮ Two hardness results for core stability in hedonic coalition formation games ⋮ Bistable versions of the marriages and roommates problems ⋮ Stable schedule matchings ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ The complexity of circuit value and network stability ⋮ A new fixed point approach for stable networks and stable marriages ⋮ Geometric stable roommates ⋮ Efficient algorithms for generalized stable marriage and roommates problems ⋮ On the existence of three-dimensional stable matchings with cyclic preferences ⋮ Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties ⋮ Popular Matchings in Complete Graphs ⋮ The complexity of the comparator circuit value problem ⋮ A sublinear parallel algorithm for stable matching ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ On a cutting plane heuristic for the stable roommates problem and its applications ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ Understanding Popular Matchings via Stable Matchings

This page was built for publication: A New Approach to Stable Matching Problems