Finding all stable matchings with assignment constraints

DOI10.1016/J.GEB.2024.09.004MaRDI QIDQ6665678zbMATH OpenFDO

Authors G. Gutin, Philip R. Neary, A. Yeo

Publication date 17 January 2025

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.GEB.2024.09.004

zbMATH Keywords

assignment constraintsiterated deletion of unattractive alternativesnormal formstable matchings

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Recommendations

• Stable matching with proportionality constraints
• Stability concepts in matching under distributional constraints
• Strongly stable assignment
• Finding all stable matchings with couples
• Fair matching under constraints: theory and applications

Cites work

• An algorithm to compute the full set of many-to-many stable matchings.
• College Admissions and the Stability of Marriage
• Corrigendum to ``stable matchings and preferences of couples
• Cycles to compute the full set of many-to-many stable matchings
• Deferred acceptance algorithms: history, theory, practice, and open questions
• Deferred acceptance with compensation chains
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 958014 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Kernels in perfect line-graphs
• Many-to-One Stable Matching: Geometry and Fairness
• Median stable matching for college admissions
• Median stable matchings in two-sided markets
• Ms. Machiavelli and the Stable Matching Problem
• Of Stable Marriages and Graphs, and Strategy and Polytopes
• Quantile stable mechanisms
• Random Paths to Stability in Two-Sided Matching
• School choice with controlled choice constraints: hard bounds versus soft bounds
• Some remarks on the stable matching problem
• Stable marriage assignment for unequal sets
• Stable matchings and preferences of couples
• The Complexity of Counting Stable Marriages
• The geometry of fractional stable matchings and its applications
• The stable marriage problem with restricted pairs.
• Three Fast Algorithms for Four Problems in Stable Marriage
• Understanding the generalized median stable matchings
• Unique stable matchings

This page was built for publication: Finding all stable matchings with assignment constraints

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