This paper studies information collecting (IC) situations with the help of cooperative game theory. Relations are established between IC situations and IC games on one hand and information sharing (IS) situations and IS games on the other hand. Further, it is shown that IC games are convex...

In this note we show that the mathematical tools of cooperative game theory allow a successful approach to the statistical problem of estimating a density function. Specifically, any random sample of an absolutely continuous random variable determines a transferable utility game, the Shapley...

A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided. Copyright Springer-Verlag Berlin...

This paper introduces a new class of cooperative games called externality games. In these games each player contributes with their specific endowment and also with their presence to the total worth of the coalition she belongs to. We prove that for these games there exists a unique efficient,...

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced. The condition of exact balancedness is identical to the one of balancedness, except that one of the...

This article shows that, for any transferable utility game in coalitional form with a nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than...

In order to describe partial cooperation structures, this paper introduces complete coalition structures as sets of feasible coalitions. A complete coalition structure has a property that, for any coalition, if each pair of players in the coalition belongs to some feasible coalition contained in...

In this paper we study situations where asymmetric players have restricted possibilities for communication. Extreme asymmetry results in a hierarchy among the players. We introduce a class of allocation rules for these situations inspired by the Myerson value (Myerson (1977)) and Shapley values...