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. There are no restrictions whatsoever on the processing...

This paper analyzes convex congestion network problems. It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore, an easy way of determining if a given network is...

This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective. It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core. If congestion costs are concave, then the corresponding game has not...

Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games. Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of...

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

In this paper, we characterize the class of games for which the core coincides with the core cover (compromise stable games). Moreover, we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems. Also, the class of convex...

We extend the consistency principle for strategic games (Peleg and Tijs (1996)) to apply to solutions which assign to each game a collection of product sets of strategies. Such solutions turn out to satisfy desirable properties that solutions assigning to each game a collection of strategy...

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