Semivalues like the Shapley value and the Banzhaf value may assign the same payoff vector to different games. It is even possible that two games attain the same outcome for all semivalues. Due to the linearity of the semivalues, this exactly occurs in case the difference of the two games is an...

A repairman makes a round-trip along a set of customers. He starts in his home location, visits each customer exactly once, and returns home. The cost of his trip has to be shared by the customers. A cooperative cost game, called routing game, is associated with this allocation problem, and an...

We consider several related set extensions of the core and the anticore of games with transferable utility. An efficient allocation is undominated if it cannot be improved, in a specific way, by sidepayments changing the allocation or the game. The set of all such allocations is called the...

For a collection of subsets of a finite set N we define its core to be equal to the polyhedral cone {x∈IRN: ∑i∈N xi=0 and ∑i∈Sxi\geq0 for all S∈}. This note describes several applications of this concept in the field of cooperative game theory. Especially collections are considered...

The selectope of a cooperative transferable utility game is the convex hull of the payoff vectors obtained by assigning the Harsanyi dividends of the coalitions to members determined by so-called selectors. The selectope is studied from a set-theoretic point of view, as superset of the core and...

Cooperative games in characteristic function form (TU games) are considered. We allow for variable populations or carriers. Weighted nucleoli are defined via weighted excesses for coalitions. A solution satisfies the Null Player Out (NPO) property, if elimination of a null player does not affect...