Affiliations: [a] School of Information Management, Jiangxi University of Finance and Economics, Nanchang, China
| [b] School of Business, Dalian University of Technology, Panjin, China
Correspondence:
[*]
Corresponding author. L.L. Zhang, School of Business, Dalian University of Technology, Panjin, 124221, China. E-mail: [email protected].
Abstract: The paper proposes a new approach to solving bipartite matching problems with linguistic scorings. The bipartite matching problem based on strict linguistic scorings is firstly described. Some basic concepts are also introduced, including bipartite matching, stable matching, and satisfaction degree. In the proposed approach, linguistic scoring preferences are changed to satisfaction degree preferences. For maximizing satisfaction degrees of agents, a bipartite matching model under the conditions of matching constraints and stability constraints is developed. Considering the important degrees of agents in each side, the bipartite matching model can be changed to a single target model by using the linear weighting approach twice. The stable bipartite matching result is determined through model solution. A numerical case is used to state the practicability of the presented approach.
Keywords: Stable bipartite matching, linguistic scoring, satisfaction degree, bipartite matching model
