The implementation of Sustainable Development (SD) within an Organization is a difficult task. This is due to the fact that it is difficult to deal with conflicting and incommensurable aspects such as environmental, economic and social dimensions. In this paper we have used a Multi-Criteria...

Most allocation rules for network games presented in the literature assume that the network structure is fixed. We put explicit emphasis on the construction of networks and examine the dynamic formation of networks whose evolution across time periods is stochastic. Time-series of networks are...

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 paper concerns a dynamic model of influence in which agents make a yes-no decision. Each agent has an initial opinion which he may change during different phases of interaction, due to mutual influence among agents. We investigate a model of influence based on aggregation functions. Each...

The coalition formation problem in an economy with externalities can be adequately modeled by using games in partition function form (PFF games), proposed by Thrall and Lucas. If we suppose that forming the grand coalition generates the largest total surplus, a central question is how to...

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

A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the...

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

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The...

The paper proposes a new concept of solution for TU games, called multicoalitional solution, which makes sense in the context of production games, that is, where v(S) is the production or income per unit of time. By contrast to classical solutions where elements of the solution are payoff...