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