Lattice structure of the random stable set in many-to-many matching markets
From MaRDI portal
Publication:2078071
Abstract: For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and the greatest lower bound for each side of the matching market. Then, we prove that with these binary operations the set of random stable matchings forms two dual lattices.
Recommendations
- Binary operations for the lattice structure in a many-to-many matching model
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- Lattice structure of many-to-one stable matchings
- A class of multipartner matching markets with a strong lattice structure
- Binary operations and lattice structure for a model of matching with contracts
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A class of multipartner matching markets with a strong lattice structure
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
- A theory of school-choice lotteries
- An algorithm to compute the full set of many-to-many stable matchings.
- Binary operations and lattice structure for a model of matching with contracts
- Characterization of stable matchings as extreme points of a polytope
- College Admissions and the Stability of Marriage
- Core many-to-one matchings by fixed-point methods
- Efficiency and stability of probabilistic assignments in marriage problems
- Job Matching, Coalition Formation, and Gross Substitutes
- Many-to-One Stable Matching: Geometry and Fairness
- On a characterization of stable matchings
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- On the set of many-to-one strongly stable fractional matchings
- Single agents and the set of many-to-one stable matchings
- Stable Matchings, Optimal Assignments, and Linear Programming
- Stable marriage assignment for unequal sets
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The ``rural hospital theorem revisited
- The college admissions problem is not equivalent to the marriage problem
- The geometry of fractional stable matchings and its applications
- The lattice of envy-free matchings
- The stable admissions polytope
Cited in
(14)- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
- The stability of conventions: random and lattice matching networks compared
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- On preferences over subsets and the lattice structure of stable matchings
- Binary operations for the lattice structure in a many-to-many matching model
- A note on the lattice structure for matching markets via linear programming
- Binary operations and lattice structure for a model of matching with contracts
- Lattice structure of many-to-one stable matchings
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
- A class of multipartner matching markets with a strong lattice structure
- Every finite distributive lattice is a set of stable matchings
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- The lattice of envy-free matchings
This page was built for publication: Lattice structure of the random stable set in many-to-many matching markets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078071)