According to the work of Faigle [3] a static Shapley value for games on matroids has been introduced in Bilbao, Driessen, Jiménez-Losada and Lebrón [1]. In this paper we present a dynamic Shapley value by using a dynamic model which is based on a recursive sequence of static models. In this...

In the classical model of cooperative games, it is considered that each coalition of players can form and cooperate to obtain its worth. However, we can think that in some situations this assumption is not real, that is, all the coalitions are not feasible. This suggests that it is necessary to...

Cooperative games on antimatroids are cooperative games in which coalition formation is restricted by a combinatorial structure which generalizes permission structures. These games group several well-known families of games which have important applications in economics and politics. The current...

Cooperative games on antimatroids are cooperative games restricted by a combinatorial structure which generalize the permission structure. So, cooperative games on antimatroids group several well-known families of games which have important applications in economics and politics. Therefore, the...

We study a cooperation structure in which the feasible coalitions are those belonging to a partition closure system. First, we develop the relation between the dividends of Harsanyi in the restricted game and the worth function in the original game. Next, we obtain an method for computing the...

We study cooperation structures with the following property: given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. TU-games restricted by union stable systems generalize graph-restricted games and games with permission structures. A study about...

We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. These combinatorial structures have a direct relationship with graph communication situations and conference structures à la...

In this paper, we study the position value for games in which partial cooperation exist, that is based on a union stable coalition system. The concept of basis is introduced for these systems, allowing for a definition of the position value. Moreover, an axiomatic characterization of the...

Two extensions of the Shapley value are given. First we consider a probabilistic framework in which certain consistent allocation rules such as the Shapley value are characterized. The second generalization of the Shapley value is an extension to the structure of posets by means of a recursive...

The goal of the paper is to introduce a family of values for transferable utility cooperative games that are proportional for two-person games and as well satisfying some combinatorial structure composed by contributions of complementary coalitions or, to less extent, marginal contributions by...