Three Fast Algorithms for Four Problems in Stable Marriage
From MaRDI portal
Recommendations
Cited in
(55)- The stable marriage problem with master preference lists
- Stable matching problems with exchange restrictions
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
- A new fixed point approach for stable networks and stable marriages
- Extracting maximal information about sets of minimum cuts
- Network flow and 2-satisfiability
- The stable marriage problem with restricted pairs.
- Approximability results for stable marriage problems with ties.
- Hard variants of stable marriage.
- The structure of stable marriage with indifference
- The stable roommates problem with short lists
- Local search approaches in stable matching problems
- Stability, optimality and manipulation in matching problems with weighted preferences
- Understanding the generalized median stable matchings
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Coalitional permutation manipulations in the Gale-Shapley algorithm
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- Two-sided matching markets with strongly correlated preferences
- Constrained stable marriage with free edges or few blocking pairs
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Stable fractional matchings
- A stable marriage requires communication
- The diameter of the stable marriage polytope: bounding from below
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Blockers and antiblockers of stable matchings
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?
- Stable allocations and partially ordered sets
- Multi-agent reinforcement learning for decentralized stable matching
- Stable marriages with restricted pairs
- Finding all stable pairs and solutions to the many-to-many stable matching problem
- The Stable Roommates Problem with Short Lists
- Finding a minimum-regret many-to-many Stable Matching
- Center stable matchings and centers of cover graphs of distributive lattices
- Stable matching with special preference patterns
- The complexity of approximately counting stable matchings
- Solving stable matching problems using answer set programming
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
- Bribery and control in stable marriage
- From Marriages to Coalitions: A Soft CSP Approach
- Polyhedral aspects of stable marriage
- Sex-equal stable matchings: complexity and exact algorithms
- The Generalized Median Stable Matchings: Finding Them Is Not That Easy
- Balanced stable marriage: how close is close enough?
- On the set of stable matchings in a bipartite graph
- A fair procedure in a marriage market
- Egalitarian roommate allocations: complexity and stability
- Finding all stable matchings with assignment constraints
- Structural aspects of the student project allocation problem
- A unifying approach to the structures of the stable matching problems
- The necessary and sufficient condition for the worst-case male optimal stable matching
- On the invariance of male optimal stable matching
- A unified approach to finding good stable matchings in the hospitals/residents setting
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Efficient algorithms for generalized stable marriage and roommates problems
This page was built for publication: Three Fast Algorithms for Four Problems in Stable Marriage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774944)
