A Matroid Generalization of the Super-Stable Matching Problem

DOI10.1137/21M1437214zbMath1493.91092arXiv2010.03820MaRDI QIDQ5084102

Naoyuki Kamiyama

Publication date: 23 June 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.03820

zbMATH Keywords

matroidstable matchingsuper-stability

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matching models (91B68)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for strong stability in the student-project allocation problem with ties
• The stable marriage problem with master preference lists
• Stable marriage and indifference
• Designing matching mechanisms under constraints: an approach from discrete convex analysis
• A Matroid Approach to Stable Matchings with Lower Quotas
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
• Finding a Stable Allocation in Polymatroid Intersection
• On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
• Algorithmics of Matching Under Preferences
• A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage

This page was built for publication: A Matroid Generalization of the Super-Stable Matching Problem