Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem

DOI10.1287/ijoc.1110.0449zbMath1465.91069OpenAlexW2155985449MaRDI QIDQ2815443

Panayiotis Miliotis, Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0449

zbMATH Keywords

analysis of algorithmsconstraint programmingeconomics

Mathematics Subject Classification ID

Matching models (91B68) Labor markets (91B39)

Related Items (7)

Blockers and antiblockers of stable matchings ⋮ Cycles to compute the full set of many-to-many stable matchings ⋮ Stable allocations and partially ordered sets ⋮ The stable \(b\)-matching polytope revisited ⋮ Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ Finding a minimum-regret many-to-many Stable Matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling algorithms for network problems
• Three remarks on the many-to-many stable matching problem
• On the stable \(b\)-matching polytope.
• An algorithm to compute the full set of many-to-many stable matchings.
• The stable admissions polytope
• Hard variants of stable marriage.
• Understanding the generalized median stable matchings
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES
• Beyond the flow decomposition barrier
• A Constraint Programming Approach to the Hospitals / Residents Problem
• Three Fast Algorithms for Four Problems in Stable Marriage
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• Job Matching, Coalition Formation, and Gross Substitutes
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Of Stable Marriages and Graphs, and Strategy and Polytopes
• College Admissions and the Stability of Marriage

This page was built for publication: Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem