A New Approach to Stable Matching Problems
From MaRDI portal
Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Circuits, networks (94C99) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(42)- Improving man-optimal stable matchings by minimum change of preference lists
- Three-Dimensional Stabl Matching Problems
- Popular Matchings in Complete Graphs
- A new fixed point approach for stable networks and stable marriages
- Complexity models for incremental computation
- On a cutting plane heuristic for the stable roommates problem and its applications
- Understanding popular matchings via stable matchings
- The Maximum-Weight Stable Matching Problem: Duality and Efficiency
- Two hardness results for core stability in hedonic coalition formation games
- A new algorithm for stable assignments
- Bistable versions of the marriages and roommates problems
- Solving large-scale matching problems efficiently: A new primal matching approach
- Stable schedule matchings
- Faster and simpler approximation of stable matchings
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- The stable roommates problem with choice functions
- An algorithm to compute the full set of many-to-many stable matchings.
- A new algorithm for stable assignment
- Popularity, Mixed Matchings, and Self-Duality
- Stable networks and product graphs
- Finding a minimum-regret many-to-many Stable Matching
- Popular roommates in simply exponential time
- High Performance Computing - HiPC 2003
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
- The complexity of circuit value and network stability
- The Stable Roommates Problem with Choice Functions
- The complexity of the comparator circuit value problem
- Popular matchings in complete graphs
- Circular stable matching and 3-way kidney transplant
- Three-sided stable matchings with cyclic preferences
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- A unified approach to finding good stable matchings in the hospitals/residents setting
- Three Fast Algorithms for Four Problems in Stable Marriage
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- Two problems in max-size popular matchings
- scientific article; zbMATH DE number 5691235 (Why is no real title available?)
- Efficient algorithms for generalized stable marriage and roommates problems
- Geometric stable roommates
- A sublinear parallel algorithm for stable matching
- On stable marriages and greedy matchings
- Review of the theory of stable matchings and contract systems
- Matching problem of electronic broker based on stable bipartite matching
This page was built for publication: A New Approach to Stable Matching Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305353)
