The aim of this paper is to develop a new method for computing least square interval-valued nucleoli of cooperative games with interval-valued payoffs, which usually are called interval-valued cooperative games for short. In this methodology, based on the square excess which can be intuitionally interpreted as a measure of the dissatisfaction of the coalitions, we construct a quadratic programming model for least square interval-valued prenucleolus of any interval-valued cooperative game and obtain its analytical solution, which is used to determine players’ interval-valued imputations via the designed algorithms that ensure the nucleoli always satisfy the individual rationality of players. Hereby the least square interval-valued nucleoli of interval-valued cooperative games are determined in the sense of minimizing the difference of the square excesses of the coalitions. Moreover, we discuss some useful and important properties of the least square interval-valued nucleolus such as its existence and uniqueness, efficiency, individual rationality, additivity, symmetry, and anonymity.
Game algorithm Cooperative game Interval computing Quadratic programming Optimization model
This is a preview of subscription content, log in to check access.
Ruiz, L.M., Valenciano, F., Zarzuelo, J.M.: The least square prenucleolus and the least square nucleolus: two values for TU games based on the excess vector. Int. J. Game Theor. 25(1), 113–134 (1996)MathSciNetCrossRefMATHGoogle Scholar
Verma, T., Kumar, A., Appadoo, S.S.: Modified difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers. J. Intell. Fuzzy Syst. 29, 1607–1618 (2015)MathSciNetCrossRefMATHGoogle Scholar