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 paper extends the notion of individual minimal rights for a transferable utility game (TU-game) to coalitional minimal rights using minimal balanced families of a specific type, thus defining a corresponding minimal rights game. It is shown that the core of a TU-game coincides with the core...

In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by monetary reward functions. We characterize Pareto optimal matchings by means of contractually exchange stability and matchings of maximum total reward by means of compensation...

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