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,...

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...

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,...

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...

Bicooperative games generalize classical cooperative games in the sense that a player is allowed to play in favor or against some aim, besides non participation. Bicapacities are monotonic bicooperative games, they are useful in decision making where underlying scales are of bipolar nature,...

We study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two nodes if the corresponding players can...