The Stable Roommates Problem with Choice Functions
From MaRDI portal
Recommendations
- The stable roommates problem with choice functions
- On a generalization of the stable roommates problem
- The stable fixtures problem -- a many-to-many extension of stable roommates
- A generalization of the stable matching problem
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
Cites work
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A generalization of the stable matching problem
- A lattice-theoretical fixpoint theorem and its applications
- A necessary and sufficient condition for the existence of a complete stable matching
- A New Approach to Stable Matching Problems
- A new fixed point approach for stable networks and stable marriages
- An efficient algorithm for the “stable roommates” problem
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- Job matching with heterogeneous firms and workers
- Job Matching, Coalition Formation, and Gross Substitutes
- Many-to-One Stable Matching: Geometry and Fairness
- On a generalization of the stable roommates problem
- On a lemma of Scarf.
- On the stable b-matching polytope.
- The Core of an N Person Game
- The Stable Roommates Problem with Choice Functions
Cited in
(7)- The stable roommates problem with choice functions
- The Stable Roommates Problem with Short Lists
- On a generalization of the stable roommates problem
- The Stable Roommates Problem with Ties
- The Stable Roommates Problem with Choice Functions
- Partitionable choice functions and stability
- The ``stable roommates problem with random preferences
This page was built for publication: The Stable Roommates Problem with Choice Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503861)