Pareto stability in two-sided many-to-many matching with weak preferences
From MaRDI portal
Publication:2425160
Recommendations
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- A 3/2-Approximation Algorithm for General Stable Marriage
- A 1.875-approximation algorithm for the stable marriage problem
- A class of multipartner matching markets with a strong lattice structure
- A many-to-many `rural hospital theorem'
- A new approach to the Pareto stable matching problem
- Algorithms – ESA 2004
- An algorithm to compute the full set of many-to-many stable matchings.
- College Admissions and the Stability of Marriage
- Credible group stability in many-to-many matching problems
- Efficient resource allocation under multi-unit demand
- Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game
- Hard variants of stable marriage.
- Introduction to algorithms
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- Matching with slot-specific priorities: Theory
- On computing Pareto stable assignments
- On preferences over subsets and the lattice structure of stable matchings
- Paths to stability for matching markets with couples
- Random Paths to Stability in Two-Sided Matching
- Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration
- School Choice with Consent*
- Stability and Polarization of Interests in Job Matching
- Stable marriage and indifference
- Strongly stable assignment
- Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
- The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Two-sided matching with indifferences
Cited in
(15)- The difference between the weak core and the strong core from the design point of view
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
- Two-sided matching with indifferences
- Transfers and exchange-stability in two-sided matching problems
- Nash implementation of constrained efficient stable matchings under weak priorities
- The stability of many-to-many matching with max-min preferences
- Resource allocation on the basis of priorities under multi-unit demand
- Generalized matchings for preferences represented by simplest semiorder: stability and Pareto optimality
- Pareto stable matchings under one-sided matroid constraints
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
- Many-to-many matching with max-min preferences
- Existence of stable allocations in matching markets with infinite contracts: a topological approach
- Pareto efficient matchings with pairwise preferences
- A new approach to the Pareto stable matching problem
- Stability, optimality and manipulation in matching problems with weighted preferences
This page was built for publication: Pareto stability in two-sided many-to-many matching with weak preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425160)