Flow methods for cooperative games with generalized coalition configuration

A cooperative games with a coalition structure is formed by a TUgame and a partition of the agent set. For this class of games, the Owen value is computed as a two-step procedure where the relevant coalitions are those formed by the union of some elements of the partition and a coalition of another element of the partition. In this paper, we consider a broader class of games where the partition is replaced by a collection of (not necessarily pairwise disjoint) coalitions over the agent set and where, in each element of this collection, cooperation among the agents is restricted. Agents then organize themselves into a profile of feasible coalitions. This class of games can be applied to several situations such as the problem of allocating aircraft landing fees in the presence of airlines and codeshare flights. We begin by defining and axiomatically characterizing the class of flow methods, which are marginal values whose coefficients induce a unit flow on the graph of feasible coalition profiles. We then define Owen-type values constructed from flow methods. We show that these values are flow methods whose flow is decomposable into two flows. Finally, we introduce two axioms from which we characterize the flows that can be decomposed in this way, and hence the flow methods constructed by our Owen-type procedure. The last part of the paper studies some special cases.