Affiliations: [a]
College of Mathematics & Statistics, Hebei University of Economics and Business, Shijiazhuang, China
| [b]
Tencent Technology(Shenzhen) Company Limited, Beijing, China
| [c]
School of Management and Economics, Beijing Institute of Technology, Beijing, China
Correspondence:
[*]
Corresponding author. Fei Guan, College of Mathematics & Statistics, Hebei University of Economics and Business, Shijiazhuang 050061, China. Tel.: +86 13832185082; E-mail: guanfei_118@126.com.
Abstract: A cooperative game describes a situation in which a finite set of n players can generate certain profits by their cooperation. How to allocate the profits effectively among each player is very important and it will affect the stability and the sustainable development of their cooperation. In this paper, by analyzing the characteristics of the existing solutions to solve the profit allocation problem, some concepts such as cooperative unit, perfect matching pair are firstly defined, a construction method of matching order is proposed. Then a new solution called matching value is defined, its basic properties are discussed by a series of theorems. Finally, a matching value under total coalition structure is defined and its axiomatization is proved by three axioms.
