Pages that link to "Item:Q798345"
From MaRDI portal
The following pages link to Every finite distributive lattice is a set of stable matchings (Q798345):
Displaying 26 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- Characterization of cores of assignment games (Q805509) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- Interior points in the core of two-sided matching markets (Q1110430) (← links)
- Linear programming brings marital bliss (Q1122480) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- Time horizons, lattice structures, and welfare in multi-period matching markets (Q1756324) (← links)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125) (← links)
- On the stable marriage polytope (Q1910547) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- Bipartite choices (Q2105872) (← links)
- The revealed preference theory of stable matchings with one-sided preferences (Q2212761) (← links)
- Entering classes in the college admissions model (Q2212783) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- Von Neumann-Morgenstern stable sets in matching problems (Q2373788) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- Counterexamples of small size for three-sided stable matching with cyclic preferences (Q2678463) (← links)
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences (Q2700602) (← links)
- THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES (Q2772855) (← links)
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (Q3012842) (← links)
- EMPLOYMENT BY LOTTO REVISITED (Q3402027) (← links)
- Coalescence on the real line (Q4644942) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Stable matching: An integer programming approach (Q6053647) (← links)