A computational approach to the multi-period many-to-one matching with ties

DOI10.1007/S10878-015-9944-0MaRDI QIDQ512877zbMATH OpenOpenAlexFDO

Authors Xinsheng Xiong, Yong Zhao, Yang Chen

Publication date 3 March 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9944-0

zbMATH Keywords

fairnessmulti-periodPareto efficiencyindividual rationalitymany-to-one matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1617265
• scientific article; zbMATH DE number 1305096
• Multiperiod matching
• STACS 2004
• Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem

Cites work

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• A dynamic school choice model
• College Admissions and the Stability of Marriage
• Markovian assignment rules
• On cores and indivisibility

Cited in

(1)

• Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

This page was built for publication: A computational approach to the multi-period many-to-one matching with ties

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