Equivalence of two-sided stable matching

Liwei Zhong () and Yanqin Bai ()
Additional contact information
Liwei Zhong: Shanghai University
Yanqin Bai: Shanghai University

Journal of Combinatorial Optimization, 2018, vol. 36, issue 4, No 14, 1380-1387

Abstract: Abstract In this article, we study a one-to-many two-sides matching problem. This one-to-many two-sides matching problem can be converted into one-to-one two-sides matching problem, and the equivalence between them is proved.

Keywords: Two-sided matching; One-many-matching; Stable matching (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0308-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:36:y:2018:i:4:d:10.1007_s10878-018-0308-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0308-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().