1 December 2001 in Mathematical Methods of Operations Research
23 November 2000 in Mathematical Methods of Operations Research
1 November 2002 in European Journal of Operational Research
1 August 2003 in Mathematical Social Sciences
1 January 2003 in SIAM Journal on Discrete Mathematics
The goal of this paper is to develop a theoretical framework in order to analyze cooperative games in which only certain coalitions are allowed to form. We will axiomatize the structure of such allowable coalitions using the theory of antimatroids, a notion developed for combinatorially abstract sets. There have been previous models developed to confront the problem of unallowable coalitions. Games restricted by a communication graph were introduced by Myerson and Owen. 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. The main result of the paper is a direct formula of Shapley and Banzhaf values for games under augmenting systems restrictions.