Pages that link to "Item:Q3201772"
From MaRDI portal
The following pages link to A necessary and sufficient condition for the existence of a complete stable matching (Q3201772):
Displayed 50 items.
- Analysis of stochastic matching markets (Q378330) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- Dominance invariant one-to-one matching problems (Q480857) (← links)
- When do stable roommate matchings exist? A review (Q483587) (← links)
- Large roommate problem with non-transferable random utility (Q508413) (← links)
- A model of partnership formation (Q553531) (← links)
- Stochastic stability for roommate markets (Q617674) (← links)
- An algorithm for a super-stable roommates problem (Q650948) (← links)
- Unique stability in simple coalition formation games (Q705860) (← links)
- Random paths to stability in the roommate problem (Q705942) (← links)
- Smith and Rawls share a room: stability and medians (Q708883) (← links)
- Core of coalition formation games and fixed-point methods (Q904830) (← links)
- A maximum stable matching for the roommates problem (Q922705) (← links)
- Rotations in the stable \(b\)-matching problem (Q964393) (← links)
- Impossibilities for roommate problems (Q975947) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Representing roommates' preferences with symmetric utilities (Q996394) (← links)
- On a lemma of Scarf. (Q1403911) (← links)
- On the existence of stable roommate matchings (Q1592723) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- The existence of a unique core partition in coalition formation games (Q1735811) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
- A generalization of the stable matching problem (Q1804884) (← links)
- The integral stable allocation problem on graphs (Q1952506) (← links)
- The roommates problem revisited (Q1958952) (← links)
- The stable roommates problem with choice functions (Q1959722) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- The roommate problem with externalities (Q2021792) (← links)
- A bargaining set for roommate problems (Q2034815) (← links)
- A local interaction dynamic for the matching problem (Q2170567) (← links)
- Subjective homophily and the fixtures problem (Q2221249) (← links)
- One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences (Q2223683) (← links)
- Exchange-stability in roommate problems (Q2281440) (← links)
- Matching with partners and projects (Q2334133) (← links)
- Competitive equilibrium and singleton cores in generalized matching problems (Q2398192) (← links)
- The core of roommate problems: size and rank-fairness within matched pairs (Q2424240) (← links)
- Absorbing sets in roommate problems (Q2436304) (← links)
- Gross substitutes and complements: a simple generalization (Q2452974) (← 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)
- Moral hazard and stability (Q2513287) (← links)
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings (Q2634485) (← links)
- Popular matchings in complete graphs (Q2663715) (← links)
- Stability against robust deviations in the roommate problem (Q2667273) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- Small random instances of the stable roommates problem (Q3302312) (← links)
- The Stable Roommates Problem with Choice Functions (Q3503861) (← links)