We study cooperative games with communication structure, represented by an undirectedgraph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class ofgames. Given the graph structure...

By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition that is a nonempty subset of the grand coalition of all players. It is well-known that balancedness is a...

In this paper we study cooperative games with limited cooperation possibilities, representedby an undirected cycle-free communication graph. Players in the game can cooperate if andonly if they are connected in the graph, i.e. they can communicate with one another. Weintroduce a new...

By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition that is a nonempty subset of the grand coalition of all players. It is well-known that balancedness is a...

Let X be a non-empty, compact, convex set in R and an upper semi-continuous mapping from X to the collection of non-empty, compact, convex subsets in R. Its is well knwon that such a mapping has a stationary point in X, i.e. there exists a point in X satisfying that its image under has a...

This paper introduces time-inconsistent preferences in a multi-commodity general equilibrium framework with incomplete markets. The standard concept of competitive equilibrium is extended in order to allow for changes in intertemporal preferences. Depending on whether or not agents recognize...

In this paper an algorithm is presented to compute all Nash equilibria for games in normal form on the only premises that the number of Nash equilibria is finite. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of...

Suppose that a firm has several owners and that the future is uncertain in the sense that one out of many different states of nature will realize tomorrow. An owner''s time preference and risk attitude will determine the importance he places on payoffs in the different states. It is a...

Suppose that a firm has several owners and that the future is uncertain in the sense that one out of many different states of nature will realize tomorrow. An owner''s time preference and risk attitude will determine the importance he places on payoffs in the different states. It is a...

We propose a new concept, the pairwise farsightedly stable set, in order to predict which networks may be formed among farsighted players. A set of networks G is pairwise farsightedly stable (i) if all possible pairwise deviations from any network g E G to a network outside G are deterred by the...