We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted communication between as well as within the a priori unions of the coalition structure. Both types of...

Hamiache (2001) assigns to every TU game a so-called associated game and then shows that the Shapley value is characterized as the unique solution for TU games satisfying the inessential game property, continuity and associated consistency. The latter notion means that for every game the Shapley...

This paper provides a framework for implementing and comparing several solution concepts for transferable utility cooperative games. We construct bidding mechanisms where players bid for the role of the proposer. The mechanisms differ in the power awarded to the proposer. The Shapley, consensus...

Playing three-person games can be very cumbersome without a good algorithm. This paper works out the algorithm to paly the Talmud bankruptcy game using Shapley's method in a simple Excel spreadsheet. The algorithm can be applied to any estate size, and consistency check is included

A highway problem is a cost sharing problem that arises if the common resource is an ordered set of sections with fixed costs such that each agent demands consecutive sections. We show that the core, the prenucleolus, and the Shapley value on the class of TU games associated with highway...

We show that any transferable utility game can be represented by an assignment of facilities to players, in which it is intuitively obvious how to allocate the total cost of the facilities. The intuitive solution in the representation turns out to be the Shapley value of the game, and thus...