For each outcome (i.e. a payoff vector augmented with a coalition structure) of a TU-game with a non-empty coalition structure core there exists a finite sequence of successively dominating outcomes that terminates in the coalition structure core. In order to obtain this result a restrictive...

A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admissible) and closed. This outsider-independent dominance relation is restrictive in the sense that a deviating coalition cannot...

A voting situation is given by a set of voters and the rules of legislation that determine minimal requirements for a group of voters to pass a motion. A priori measures of voting power, such as the Shapley-Shubik index and the Banzhaf value, show the influence of the individual players in a...

We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoffset. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting....

A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admissible) and closed. This outsider-independent dominance relation is restrictive in the sense that a deviating coalition cannot...

We prove the existence of an upper bound for the number of blockings required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core...

For each outcome (i.e. a payoff vector augmented with a coalition structure) of a TU-game with a non-empty coalition structure core there exists a finite sequence of successively dominating outcomes that terminates in the coalition structure core. In order to obtain this result a restrictive...

In the model of Funaki and Yamato (1999) the tragedy of the commons can be avoided with pessimistic players, while this does not hold for optimistic players. We propose a new core concept to overcome this puzzle and provide numerical simulations of simple games where the conclusions coincide or...

The traditional voting games are special transferable utility cooperative games, so-called simple games, where the players are the parties and the value of a coalition may be 1 or 0 depending on the ability of the coalition to pass a motion or not. In this paper we introduce general weighted...

A ranking of journals is manipulable if a particular journal's position can be improved by making additional citations to other journals. We introduce a simple ranking method that is not manipulable and is invariant to citation intensities, journal scaling and article-splitting. The ranking of...