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...

A class of cooperative games arising from economic and operations research situations in which agents with potential individual possibilities are connected via a hierarchy within an organization is introduced. It is shown that the games in this class form a cone which lies in the intersection of...

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...

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition reflecting the decreasing marginal contribution of non-clan members to growing coalitions. This decreasing marginal contribution is incorporated in the notion of a bi-monotonic...

In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as...

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games...

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et...

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...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...