Three-sided matching problem with mixed preferences

Feng Zhang and Liwei Zhong ()
Additional contact information
Feng Zhang: Shanghai Polytechnic University
Liwei Zhong: Shanghai Jiaotong University

Journal of Combinatorial Optimization, 2021, vol. 42, issue 4, No 15, 928-936

Abstract: Abstract In this paper, we study the three-sided matching problems with mixed preferences, where three agent sets are U, V and W. We discussed two matching problems with different types of preferences. The first is that each $$u\in U$$ u ∈ U has a strict preference over set V, each $$v\in V$$ v ∈ V has a strict preference over set W, each $$w\in W$$ w ∈ W has a strict preference over set V and each $$w\in W$$ w ∈ W has a strict preference over set U. The second is that each $$u\in U$$ u ∈ U has a strict preference over set V, each $$v\in V$$ v ∈ V has a strict preference over set W and each $$w\in W$$ w ∈ W has a strict preference over set $$U\times V=\{(u,v)|u\in U,v\in V \}$$ U × V = { ( u , v ) | u ∈ U , v ∈ V } . For these two kinds of matching problems, we give the concept of stable matching and the algorithm of solving stable matching respectively. Finally, we discuss the relationship between these two matching problems.

Keywords: Three-sided matching problem; Mixed preference; Stable matching; Algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00501-2 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:42:y:2021:i:4:d:10.1007_s10878-019-00501-2

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

DOI: 10.1007/s10878-019-00501-2

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 ().