Classified stable matching

MaRDI QIDQ5417703zbMATH OpenFDO

Authors Chien-Chung Huang

Publication date 22 May 2014

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

Recommendations

• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• A matroid approach to stable matchings with lower quotas
• A matroid approach to stable matchings with lower quotas
• The college admissions problem with lower and common quotas
• The stable admissions polytope

Cited in

(33)

• The stable b-matching polytope revisited
• Envy-free matchings with lower quotas
• Stable matchings with covering constraints: a complete computational trichotomy
• Popularity in the generalized hospital residents setting
• Strategy-proof school choice mechanisms with minimum quotas and initial endowments
• Two problems in max-size popular matchings
• The hospitals/residents problem with lower quotas
• Blockers and antiblockers of stable matchings
• Strategyproof matching with regional minimum and maximum quotas
• A matroid approach to stable matchings with lower quotas
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach
• Stable matching with proportionality constraints
• Assignment mechanisms under distributional constraints
• scientific article; zbMATH DE number 7278072 (Why is no real title available?)
• Popular matchings with multiple partners
• Pareto stable matchings under one-sided matroid constraints
• Matroidal choice functions
• Popular matchings with ties and matroid constraints
• A matroid approach to stable matchings with lower quotas
• Envy-freeness and relaxed stability: hardness and approximation algorithms
• Review of the theory of stable matchings and contract systems
• Hedonic diversity games: a complexity picture with more than two colors
• Cutoff stability under distributional constraints with an application to summer internship matching
• Efficient matching under general constraints
• Reallocation mechanisms under distributional constraints in the full preference domain
• Structural aspects of the student project allocation problem
• Strongly stable matchings under matroid constraints
• Perfect matchings and popularity in the many-to-many setting
• Efficient and strategy-proof mechanism under general constraints
• The complexity of finding fair many-to-one matchings
• Super-stable common independent sets of generalized matroids
• Classified rank-maximal matchings and popular matchings: algorithms and hardness

This page was built for publication: Classified stable matching

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