Data cost games as an application of 1-concavity in cooperative game theory (Q1714541)

Summary: The main goal is to reveal the 1-concavity property for a subclass of cost games called data cost games. The motivation for the study of the 1-concavity property is the appealing theoretical results for both the core and the nucleolus, in particular their geometrical characterization as well as their additivity property. The characteristic cost function of the original data cost game assigns to every coalition the additive cost of reproducing the data the coalition does not own. The underlying data and cost sharing situation is composed of three components, namely, the player set, the collection of data sets for individuals, and the additive cost function on the whole data set. The proof of 1-concavity is direct, but robust to a suitable generalization of the characteristic cost function. As an adjunct, the 1-concavity property is shown for the subclass of so-called ``bicycle'' cost games, inclusive of the data cost games in which the individual data sets are nested in a decreasing order.