On the Grey Equal Surplus Sharing Solutions

Abstract

The grey uncertainty is a new methodology focusing on the study of problems involving small samples and poor information. It deals with uncertain systems with partially known information through generating, excavating, and extracting useful information from what is available. This paper focuses some division solutions for cooperative games, called the equal surplus sharing solutions. A situation, in which a finite set of players can obtain certain grey payoffs by cooperation can be described by a cooperative grey game. In this paper, we consider some grey division rules, namely the equal surplus sharing grey solutions. Further, we focus on a class of equal surplus sharing grey solutions consisting of all convex combinations of these solutions. An application from Operations Research (OR) situations is also given