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 concerns a model of influence in which agents make their decisions on a certain issue. We assume that each agent is inclined to make a particular decision, but due to a possible influence of the others, his final decision may be different from his initial inclination. Since in reality...

In cooperative games, the core is the most popular solution concept, and its properties are well known. In the classical setting of cooperative games, it is generally assumed that all coalitions can form, i.e., they are all feasible. In many situations, this assumption is too strong and one has...

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

An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the union of all bounded faces of the core, it is nonempty if...

The core of a cooperative game on a set of players $N$ is one of the most popular concepts of solution. When cooperation is restricted (feasible coalitions form a subcollection $\cF$ of $2^N$), the core may become unbounded, which makes its usage questionable in practice. Our proposal is to make...