A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas

DOI10.1287/MOOR.2016.0802MaRDI QIDQ2976150zbMATH OpenOpenAlexFDO

Authors 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

polynomial-time algorithmstable matchingmatroidslower 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)

Recommendations

• A matroid approach to stable matchings with lower quotas
• A matroid approach to stable matchings with lower quotas
• A generalization of the stable matching problem
• A fine-grained view on stable many-to-one matching problems with lower and upper quotas
• scientific article; zbMATH DE number 1757951
• Matchings with lower quotas: algorithms and complexity
• An improved approximation lower bound for finding almost stable maximum matchings
• Finding a stable matching under type-specific minimum quotas
• A unifying approach to the structures of the stable matching problems

Cites work

• scientific article; zbMATH DE number 3906513 (Why is no real title available?)
• scientific article; zbMATH DE number 3970769 (Why is no real title available?)
• scientific article; zbMATH DE number 1757951 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Fixed-Point Approach to Stable Matchings and Some Applications
• A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
• A general two-sided matching market with discrete concave utility functions
• A matroid approach to stable matchings with lower quotas
• A strongly polynomial minimum cost circulation algorithm
• Algorithms and Computation
• Classified stable matching
• College Admissions and the Stability of Marriage
• Cores of convex games
• Erratum: The Stable Allocation (or Ordinal Transportation) Problem
• Generalized polymatroids and submodular flows
• Independence Spaces and Combinatorial Problems
• Network flows. Theory, algorithms, and applications.
• On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
• Some remarks on the stable matching problem
• Stable schedule matching under revealed preference.
• The college admissions problem with lower and common quotas
• The hospitals/residents problem with lower quotas
• \(M\)-convex function on generalized polymatroid

Cited in

(14)

• Envy-free matchings with lower quotas
• Efficient matching under general constraints
• The college admissions problem with lower and common quotas
• A matroid approach to stable matchings with lower quotas
• A matroid generalization of the super-stable matching problem
• Stable matchings with covering constraints: a complete computational trichotomy
• Finding a stable allocation in polymatroid intersection
• scientific article; zbMATH DE number 7278072 (Why is no real title available?)
• Classified stable matching
• Pareto stable matchings under one-sided matroid constraints
• A matroid approach to stable matchings with lower quotas
• Assignment mechanisms under distributional constraints
• Popular matchings with two-sided preference lists and matroid constraints
• Quasi-popular Matchings, Optimality, and Extended Formulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976150)