Values for graph-restricted games with coalition structure

We consider a new model for TU games with both coalition and cooperation structures that applies to different network situations, in particular, to sharing an international river with multiple users without international firms. Our approach to the value for such a game is close to that of Myerson and is based on ideas of component efficiency and fairness adopted to graph situations under scrutiny, and it incorporates also the idea of the intermediate game property of the Owen value. The newly axiomatically introduced values have an explicit formula representation and in many cases can be quite simply computed. We apply the results obtained to the problem of sharing an international river among multiple users without international firms.