AMS classification: 90D12; 03E72;

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...

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...

In this paper, we consider the relationship between the Weber set and the Shapley set being the set of all weighted Shapley values of a TU-game. In particular, we propose a new proof for the fact that the Weber set always includes the Shapley set. It is shown that the inclusion mentioned follows...

We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and...

This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Further- more, (level-increase) monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element...