Cooperative Grey Games: Grey Solutions and an Optimization Algorithm

نویسندگان
doi
10.22034/2017.3.02
چکیده

In this paper, some set-valued solutions using grey payoffs, namely, the grey core, the grey dominance core and the grey stable sets for cooperative grey games, are introduced and studied. Our main results contained are relations between the grey core, the grey dominance core and the grey stable sets of such a game. Moreover, we present a linear programming (LP) problem for the grey core. On the other hand, we suggest a corresponding optimization-based algorithm finding the grey core element of a cooperative grey game. Finally, we give an application how cooperative grey game theory can be used to model users' behaviors in various multimedia social networks. The paper ends with a conclusion and an outlook to future investigations.