Cooperation structures without any {\it a priori} assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for mar\-ginal values, cores and convexity is established. The theory is based on the notion of a Monge extension of a general characteristic...

The Shapley value is defined as the average marginal contribution of a player, taken over all possible ways to form the grand coalition $N$ when one starts from the empty coalition and adds players one by one. The authors have proposed in a previous paper an allocation scheme for a general model...

We study linear properties of TU-games, revisiting well-known issues like interaction transforms, the inverse Shapley value problem and the concept of semivalues and least square values. We embed TU-games into the model of cooperation systems and influence patterns, which allows us to introduce...

The Shapley value is defined as the average marginal contribution of a player, taken over all possible ways to form the grand coalition N when one starts from the empty coalition and adds players one by one. In a previous paper, the authors have introduced an allocation scheme for a general...

Time series of coalitions (so-called scenarios) are studied that describe processes of coalition formation where several players may enter or leave the current coalition at any point in (discrete) time and convergence to the grand coalition is not necessarily prescribed. Transitions from one...

An interaction system has a finite set of agents that interact pairwise, depending on the current state of the system. Symmetric decomposition of the matrix of interaction coefficients yields the representation of states by self-adjoint matrices and hence a spectral representation. As a result,...