Recommendations
- The complexity of approximately counting stable matchings
- The Complexity of Approximately Counting Stable Matchings
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- Complexity of the sex-equal stable marriage problem
- An efficient algorithm for the “stable roommates” problem
Cited in
(87)- The stable marriage problem with master preference lists
- Stable matching problems with exchange restrictions
- Stable marriage with ties and bounded length preference lists
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Linear programming brings marital bliss
- A fast algorithm for the generalized parametric minimum cut problem and applications
- A new fixed point approach for stable networks and stable marriages
- Network flow and 2-satisfiability
- The stable marriage problem with restricted pairs.
- An algorithm to compute the full set of many-to-many stable matchings.
- The structure of stable marriage with indifference
- The lattice of envy-free matchings
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- Matching games with partial information
- How do I marry thee? Let me count the ways
- Understanding the generalized median stable matchings
- An efficient algorithm for batch stability testing
- Circular stable matching and 3-way kidney transplant
- Bistable versions of the marriages and roommates problems
- On the set of many-to-one strongly stable fractional matchings
- (Un)stable matchings with blocking costs
- Coalitional permutation manipulations in the Gale-Shapley algorithm
- Essentially stable matchings
- Entering classes in the college admissions model
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Matching with preferences over colleagues solves classical matching
- A stable marriage requires communication
- The diameter of the stable marriage polytope: bounding from below
- A characterization of strongly stable fractional matchings
- The losses from integration in matching markets can be large
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Complexity study for the robust stable marriage problem
- Jointly stable matchings
- A number of stable matchings in models of the Gale-Shapley type
- On the stable \(b\)-matching problem in multigraphs
- 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?
- Disjoint stable matchings in linear time
- The graphs of stably matchable pairs
- Cycles to compute the full set of many-to-many stable matchings
- Counterexamples of small size for three-sided stable matching with cyclic preferences
- Stable allocations and partially ordered sets
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences
- Stable matching with special preference patterns
- On the likely number of solutions for the stable marriage problem
- Size Versus Stability in the Marriage Problem
- The algebra of stable marriages
- Stable matchings and stable partitions∗
- The complexity of approximately counting stable roommate assignments
- The complexity of approximately counting stable matchings
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- Deferred acceptance with compensation chains
- Finding stable matchings that are robust to errors in the input
- On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
- Stability and stabilisation of networked pairing problem via event-triggered control
- Jointly stable matchings
- On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
- Polyhedral aspects of stable marriage
- Sex-equal stable matchings: complexity and exact algorithms
- Finding a Level Ideal of a Poset
- The Generalized Median Stable Matchings: Finding Them Is Not That Easy
- Affinely representable lattices, stable matchings, and choice functions
- Affinely representable lattices, stable matchings, and choice functions
- Review of the theory of stable matchings and contract systems
- On the set of stable matchings in a bipartite graph
- The lattice of envy-free many-to-many matchings with contracts
- Unique stable matchings
- On stable assignments generated by choice functions of mixed type
- On a many-sided matching problem with mixed preferences
- Finding all stable matchings with assignment constraints
- Structural aspects of the student project allocation problem
- An experimental study of decentralized matching
- Stable matchings, choice functions, and linear orders
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- A unifying approach to the structures of the stable matching problems
- The complexity of the certification of properties of stable marriage
- Hardness results on the man-exchange stable marriage problem with short preference lists
- A deferred acceptance algorithm with contracts
- Parametric stable marriage and minimum cuts
- On the invariance of male optimal stable matching
- A unified approach to finding good stable matchings in the hospitals/residents setting
- Size versus stability in the marriage problem
- The singleton core in the college admissions problem and its application to the national resident matching program (NRMP)
- Efficient algorithms for generalized stable marriage and roommates problems
This page was built for publication: The Complexity of Counting Stable Marriages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751000)
