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

DOI10.1007/s10878-015-9944-0zbMath1364.90298OpenAlexW1176838797MaRDI QIDQ512877

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

fairnessPareto efficiencyindividual rationalitymulti-periodmany-to-one matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

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

Cites Work

• Unnamed Item
• On cores and indivisibility
• A dynamic school choice model
• Markovian assignment rules
• College Admissions and the Stability of Marriage

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