This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine.The costs of an agent depend linearly on the final completion time of his jobs.We describe a procedure that provides an optimal...

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

This paper is a reaction on Ginsburgh and Zang (2003).It reconsiders the problem where a group of museums offer a pass such that the owner can visit these museums an unlimited number of times during a fixed period of time.The problem addressed is how to share the total joint income of this pass...

This paper studies situations in which a project consisting of several activities is not executed as planned.It is divided into three parts.The first part analyzes the case where the activities may be delayed; this possibly induces a delay on the project as a whole with additional costs.Associated...

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

This paper introduces a new class of transferable-utility games, called multi-issue allocation games.These games arise from various allocation situations and are based on the concepts underlying the bankruptcy model, as introduced by O'Neill (1982).In this model, a perfectly divisible good...

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

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