We study cooperative games with communication structure, represented by an undirected graph. 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 of games. Given the graph structure...

We study cooperative games with communication structure, represented by an undirected graph. 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 of games. Given the graph structure...

We analyze self-selection problem when valuations are non-ordered. The corresponding package-pricing solution has specific graph structure. It is helpful in deriving weak su±cient conditions for both partial e±ciency and Pareto-e±ciency. Unlike the ordered valuations case, Pareto e±ciency is...

We study cooperative games with transferable utility and limited cooperation possibilities. The focus is on communication structures where the set of players forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph....

Mathematical models describing water resources systems optimization are characterized by a large number of variables and constraints, which are needed to describe the physical components of the system, its functional ties, and its operating modalities. Some special algebraic structures allow its...

We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are...

This discussion paper resulted in a publication in 'Games and Economic Behavior', 2010, 68, 626-633. <P> We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A...</p>

We study cooperative games with communication structure, represented by an undirected graph. 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 of games. Given the graph structure...