Stable matching with proportionality constraints

DOI10.1287/OPRE.2019.1909MaRDI QIDQ5129207zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 26 October 2020

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2019.1909

zbMATH Keywords

stable matchingdiversityScarf's lemma

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Stability concepts in matching under distributional constraints
• Constrained random matching
• Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
• Distributed Stable Matching Problems
• Designing matching mechanisms under constraints: an approach from discrete convex analysis

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A matroid approach to stable matchings with lower quotas
• Classified stable matching
• Designing matching mechanisms under constraints: an approach from discrete convex analysis
• Effective affirmative action in school choice
• Improving matching under hard distributional constraints
• School choice with controlled choice constraints: hard bounds versus soft bounds
• School choice: impossibilities for affirmative action
• The Core of an N Person Game
• The college admissions problem with lower and common quotas

Cited in

(15)

• Power indices for networks, with applications to matching markets
• Efficient matching under general constraints
• Fair matching under constraints: theory and applications
• Stability concepts in matching under distributional constraints
• Procedurally fair and stable matching
• Interdistrict school choice: a theory of student assignment
• Affinely representable lattices, stable matchings, and choice functions
• Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
• Constrained random matching
• Sustainable matching plans with adverse selection
• Stable matchings of teachers to schools
• Slot-specific priorities with capacity transfers
• Affinely representable lattices, stable matchings, and choice functions
• Finding all stable matchings with assignment constraints
• Cutoff stability under distributional constraints with an application to summer internship matching

This page was built for publication: Stable matching with proportionality constraints

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