In this paper we generalize the concept of coalitional games by allowing for any organizational structure within coalitions represented by a graphon the set of players ot the coalition. A, possibly empty, set of payoffvectors is assigned to any graph on every subset of players. Such a game will...

Any function from a non-empty polytope into itself that is locally gross direction preserving is shown to have the fixed point property. Brouwer's fixed point theorem for continuous functions is a special case. We discuss the application of the result in the area of non-cooperative game theory.

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

Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...