Quadratic programming method for cooperative games with coalition values expressed by triangular fuzzy numbers and its application in the profit distribution of logistics coalition (Q2298586)

Summary: A quadratic programming model is constructed for solving the fuzzy cooperative games with coalition values expressed by triangular fuzzy numbers, which will be abbreviated to TFN-typed cooperative games from now on. Based on the concept of \(\alpha \)-cut set and the representation theorem for the fuzzy set, the least square distance solution for solving TFN-typed cooperative games is proposed. The least square distance solution successfully avoids the subtraction operation of TFNs, which may inevitably lead to the amplification of uncertainty and the distortion of decision information. A calculating example related to the profit distribution of logistics coalition is illustrated to show the advantages, validity, and applicability of the proposed method. Besides, the least square distance solution for solving TFN-typed cooperative games satisfies many important properties of cooperative games, such as uniqueness, additivity, symmetry, and uniqueness.