A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas

DOI10.1287/moor.2016.0802zbMath1360.91108OpenAlexW2538025225MaRDI QIDQ2976150

Yu Yokoi

Publication date: 13 April 2017

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7b00475c189d2b197d84e7e01416846b525ffeed

zbMATH Keywords

matroidspolynomial-time algorithmstable matchinglower quotasgeneralized polymatroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Matching models (91B68)

Related Items (8)

A Matroid Generalization of the Super-Stable Matching Problem ⋮ Finding a Stable Allocation in Polymatroid Intersection ⋮ Assignment Mechanisms Under Distributional Constraints ⋮ Envy-free matchings with lower quotas ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hospitals/residents problem with lower quotas
• The college admissions problem with lower and common quotas
• A strongly polynomial minimum cost circulation algorithm
• Some remarks on the stable matching problem
• Generalized polymatroids and submodular flows
• Stable schedule matching under revealed preference.
• A general two-sided matching market with discrete concave utility functions
• Cores of convex games
• M-Convex Function on Generalized Polymatroid
• A Matroid Approach to Stable Matchings with Lower Quotas
• Algorithms and Computation
• On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
• Independence Spaces and Combinatorial Problems
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage

This page was built for publication: A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas