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

See also the article in 'European Journal of Operational Research' (2014), 237, 606-616.<P> 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...</p>

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 introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations.In max-RP sequencing situations it is assumed that each player's cost...

In this paper, we characterise the compromise value of a game as the barycentre of the edges of its core cover.For this, we introduce the value, which extends the adjusted proportional rule for bankruptcy situations and coincides with the compromise value on a large class of games.

In this paper preparation sequencing situations are introduced. This new type of onemachine sequencing situations assumes that before a job can start, some preparation depending on its predecessor is required. Preparation sequencing situations are first analyzed from an operations research...

In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines.By identifying jobs with agents, whose costs linearly depend on the completion time of their jobs, and assuming an initial...