Pages that link to "Item:Q3703906"
From MaRDI portal
The following pages link to An efficient algorithm for the “stable roommates” problem (Q3703906):
Displayed 49 items.
- Analysis of stochastic matching markets (Q378330) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- An algorithm for a super-stable roommates problem (Q650948) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- A maximum stable matching for the roommates problem (Q922705) (← links)
- Rotations in the stable \(b\)-matching problem (Q964393) (← links)
- Size versus stability in the marriage problem (Q964402) (← links)
- Geometric stable roommates (Q976079) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Representing roommates' preferences with symmetric utilities (Q996394) (← links)
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085) (← links)
- A characterization of graphs that ensure the existence of stable matchings (Q1181746) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Residence exchange wanted: A stable residence exchange problem (Q1268437) (← links)
- Stable marriage and indifference (Q1317047) (← links)
- Stable matchings and linear inequalities (Q1336634) (← links)
- On a lemma of Scarf. (Q1403911) (← links)
- On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- A generalization of the stable matching problem (Q1804884) (← links)
- Stable matching with preferences derived from a psychological model (Q1820991) (← links)
- Stable partitions with \(\mathcal W\)-preferences (Q1827807) (← links)
- The stable crews problem (Q1827831) (← links)
- NP-completeness in hedonic games (Q1886742) (← links)
- Stable matchings and linear programming (Q1923201) (← links)
- The stable roommates problem with choice functions (Q1959722) (← links)
- Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)
- Bistable versions of the marriages and roommates problems (Q1970204) (← links)
- The cycle roommates problem: a hard case of kidney exchange (Q2379931) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- On the stable \(b\)-matching problem in multigraphs (Q2476254) (← links)
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems (Q2482674) (← links)
- Random paths to \(P\)-stability in the roommate problem (Q2482678) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- The exchange-stable marriage problem (Q2576343) (← links)
- COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
- The Stable Roommates Problem with Choice Functions (Q3503861) (← links)
- Size Versus Stability in the Marriage Problem (Q3602826) (← links)
- Stable matchings and stable partitions<sup>∗</sup> (Q3989849) (← links)
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm (Q4289306) (← links)
- On the complexity of exchange-stable roommates (Q5957362) (← links)
- matchingMarkets (Q5983273) (← links)