We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...

We introduce the concepts of the components' second-order productivities in cooperative games with transferable utility (TU games) with a coalition structure (CS games) and of the components' second-order payoffs for one-point solutions for CS games as generalizations of the players'...

In this paper, I introduce an extension of (TU) games with a coalition structure. Taking a situation where all coalitions are already established is not reasonable in order to forecast the reality; there is not only one possible coalition, there are several. I consider situations where...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...

A well known and simple game to model markets is the glove game where worth is produced by building matching pairs. For glove games, different concepts, like the Shapley value, the restricted Shapley value or the Owen value, yield diff erent distributions of worth. Moreover, computational effort...

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and...

We prove that every transferable utility (TU) game can be generated by a coalition production economy. Given a TU game, the set of Walrasian payoff vectors of the induced coalition production economy coincides with the core of the balanced cover of the given game. Therefore, a Walrasian...

In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure. In such games the player set is partitioned into unions and...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...

First, we suggest and discuss second-order versions of properties for solutions for TU games used to characterize the Banzhaf value, in particular, of standardness for two-player games, of the dummy player property, and of 2-efficiency. Then, we provide a number of characterizations of the...