This paper analyzes processing problems and related cooperative games. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. The main feature of the model is a capacity...

This paper investigates a class of dynamic selection processes for n-person normal-form games which includes the Brown-von Neumann-Nash dynamics. For (two-person) zero-sum games and for (n-person) potential games every limit set of these dynamics is a subset of the set of Nash-equilibria....

In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the...

This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system, a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed...

The class of two-person competition games is introduced and analyzed. For any game in this class the set of Nash equilibria is convex and all Nash equilibria lead to the same payoff vector. Competition games are compared to other competitive environments such as unilaterally competitive games...