A cooperative situation is characterized by a group of players choosing from a set of alternatives, where each alternative results in a joint cost. In this paper we assume that an alternative with minimum total cost will be chosen and we focus on the corresponding cost allocation problem by...

Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along...

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