Polynomial time algorithm for an optimal stable assignment with multiple partners
From MaRDI portal
Publication:2373720
Recommendations
- Stable assignment with couples: parameterized complexity and local search
- Stable assignment with couples: parameterized complexity and local search
- Finding a stable allocation in polymatroid intersection
- Finding a stable allocation in polymatroid intersection
- On a new algorithm for stable assignment*
- Stable Matchings, Optimal Assignments, and Linear Programming
- A new algorithm for stable assignments
- A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
- A new algorithm for stable assignment
- Faster algorithms for stable allocation problems
Cites work
- A class of multipartner matching markets with a strong lattice structure
- A Selection Problem of Shared Fixed Costs and Network Flows
- An algorithm to compute the full set of many-to-many stable matchings.
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 4027472 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 3558960 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- On preferences over subsets and the lattice structure of stable matchings
- Selected Applications of Minimum Cuts in Networks
- Some remarks on the stable matching problem
- Stability and Polarization of Interests in Job Matching
- The complexity of computing the permanent
- The Complexity of Counting Stable Marriages
- The Complexity of Enumeration and Reliability Problems
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
Cited in
(21)- The stable b-matching polytope revisited
- Understanding the generalized median stable matchings
- Faster algorithms for stable allocation problems
- On the set of many-to-one strongly stable fractional matchings
- Three-sided matching problem with mixed preferences
- Blockers and antiblockers of stable matchings
- Cycles to compute the full set of many-to-many stable matchings
- Stable allocations and partially ordered sets
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Finding all stable pairs and solutions to the many-to-many stable matching problem
- Finding a minimum-regret many-to-many Stable Matching
- scientific article; zbMATH DE number 2038736 (Why is no real title available?)
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
- Affinely representable lattices, stable matchings, and choice functions
- Affinely representable lattices, stable matchings, and choice functions
- On stable assignments generated by choice functions of mixed type
- Non-distributive lattices, stable matchings, and linear optimization
- A unified model of congestion games with priorities. Two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
- A unified model of congestion games with priorities: two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
- A unified approach to finding good stable matchings in the hospitals/residents setting
- Rotations in the stable b-matching problem
This page was built for publication: Polynomial time algorithm for an optimal stable assignment with multiple partners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373720)
