The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced by an arbitrary digraph prescribing the dominance relation among the players, is introduced. It is defined as the average of marginal contribution vectors corresponding to all permutations that do...

We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all...

For arbitrary cycle-free directed graph games tree-type values are introduced axiomatically and their explicit formula representation is provided. These values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph...

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average...

This paper introduces a new solution concept for cooperative games with general coalitional structure in which only certain sets of players, including the set of all players, are able to form feasible coalitions. The solution concept takes into account the marginal contribution of players. This...

This paper considers the investment decision of a firm where it has to decide about the timing and capacity. We obtain that in a fast growing market, right after investment the firm produces below capacity, where the utilization rate (the proportion of capacity that is used for production right...

Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characterization underlines an important difference, in terms of symmetric treatment of...

In this paper we study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Zn of the n-dimensional Euclidean space IRn. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in...

A new solution is presented for transferable utility games with graph communication where the cooperation possibilities are represented by a graph. Players are only able to cooperate and obtain some worth in a coalition if they form a connected set in the given graph. To determine the payoff for...

A general equilibrium model is considered with multiple divisible and multiple indivisible commodities. In models with indivisibles it is always assumed that an indivisible commodity, called money, is present that is used to transfer the value of certain amounts of indivisible goods. For these...