Affiliations: College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China
Correspondence:
[*]
Corresponding author. Jianjun Zhu, College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China. E-mail: Zhujianjun@nuaa.edu.cn.
Abstract: Sharing economy is significant for economic development, stable matching plays an essential role in sharing economy, but the large-scale sharing platform increases the difficulties of stable matching. We proposed a two-sided gaming model based on probabilistic linguistic term sets to address the problem. Firstly, in previous studies, the mutual assessment is used to obtain the preferences of individuals in large-scale matching, but the procedure is time-consuming. We use probabilistic linguistic term sets to present the preferences based on the historical data instead of time-consuming assessment. Then, to generate the satisfaction based on the preference, we regard the similarity between the expected preferences and actual preferences as the satisfaction. Considering the distribution features of probabilistic linguistic term sets, we design a shape-distance-based method to measure the similarity. After that, the previous studies aimed to maximize the total satisfaction in matching, but the individuals’ requirements are neglected, resulting in a weak matching result. We establish the two-sided gaming matching model from the perspectives of individuals based on the game theory. Meanwhile, we also study the competition from other platforms. Meanwhile, considering the importance of the high total satisfaction, we balance the total satisfaction and the personal requirements in the matching model. We also prove the solution of the matching model is the equilibrium solution. Finally, to verify the study, we use the experiment to illustrate the advantages of our study.
Keywords: Sharing economy, two-sided gaming matching, shape-distance-based similarity, probabilistic linguistic term sets, efficient sharing
