Stable matching with special preference patterns

DOI10.1080/00207169108803966zbMath0723.68080OpenAlexW2073760267MaRDI QIDQ3210911

Shian-Shyong Tseng, R. T. Kuo

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803966

zbMATH Keywords

Latin squareassignmentstable matchingpreference patterns

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• A parallel algorithm to solve the stable marriage problem
• The necessary and sufficient condition for the worst-case male optimal stable matching
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• College Admissions and the Stability of Marriage

This page was built for publication: Stable matching with special preference patterns