Values for graph-restricted games with coalition structure ∗

We consider a new model of a TU game endowed with both coalition and two-level cooperation structures that applies to various network situations. The approach to the value is close to that of both Myerson [1977] and Aumann and Drèze [1974]: it is based on ideas of component efficiency and one or another deletion link property, and it treats an a priori union as a self-contained unit; moreover, our approach incorporates also the idea of the Owen’s quotient game property [1977]. The axiomatically introduced values possess an explicit formula representation and in many cases can be quite simply computed. The results obtained are applied to the problem of sharing an international river among multiple users without international firms