ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES

The aim of this paper is to compute Shapley’s and Banzhaf’s values of cooperative games restricted by a combinatorial structure. There have been previous models developed to study the problem of games with partial cooperation. Games restricted by a communication graph were introduced by Myerson and Owen. Another type of combinatorial structure introduced by Gilles, Owen and van den Brink is equivalent to a subclass of antimatroids. Cooperative games in which the set of players is a partially ordered set, that is, games on distributive lattices was investigated by Faigle and Kern. We introduce a new combinatorial structure called augmenting system which is a generalization of the antimatroid structure and the system of connected subgraphs of a graph. We present new algorithmic procedures for computing values of games under augmenting systems restrictions and we show that there exist problems with polynomial algorithm complexity