The paper discusses the set of Harsanyi payoff vectors,also known as the Selectope. First, we reconsider some results on Harsanyi payoff vectors, published by Vasil'ev in the late 1970's, within a more general framework. In particular, these results state already that the set of Harsanyi payoff...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a 'dualize and restrict' procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

A cooperative game with transferable utilities, or simply aTU-game, describes a situation in which players can obtain certainpayoffs by cooperation. A solution mapping for these games is amapping which assigns to every game a set of payoff distributionsover the players in the game. Well-known...

The paper discusses the set of Harsanyi payoff vectors,also known as the Selectope. First, we reconsider some results on Harsanyi payoff vectors, published by Vasil'ev in the late 1970's, within a more general framework. In particular, these results state already that the set of Harsanyi payoff...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

In this paper we consider the problem of the control of access to a firm's productive asset, embedding the relevant decisionmakers into a general structure of formal authority relations. Within such an authority structure, each decision maker acts as a principal to some decision makers, while...

Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...

This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory.

The Shapley-Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear...

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games to determine whether the core of the combined game coincides with the sum of...