Curiel, Potters, Prasad, Tijs and Veltman (1993) introduced component additive games which are cooperative TU games that arise by imposing an order on the player set. Further, they introduced the β-rule which allocates a core element to each component additive game. In this paper we consider...

A canonical procedure is described, which associates to each infinite information collecting situation a related information collecting situation with finite state and action spaces, in such a way that the two corresponding IC-games are near to each other. Compensations for informants are then...

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

Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...

In this paper, the classical theory of two-person cooperative games is extended to two-person cooperative games with interval uncertainty. The core, balancedness, superadditivity and related topics are studied. Solutions called ψ <Superscript>α</Superscript>-values are introduced and characterizations are given....</superscript>

This note introduces a new monotonicity property for sequencing situations. A sequencing rule is called drop out monotonic if no player will be worse off whenever one of the players decides to drop out of the queue before processing starts. This intuitively appealing property turns out to be...

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

Kalai and Zemel introduced a class of flow-games showing that these games have a non-empty core and that a minimum cut corresponds to a core allocation.  We consider flow-games with a finite number of players on a network with infinitely many arcs: assuming that the total sum of the capacities...

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