This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...

In a resource allocation problem there is a common-pool resource, which has to be divided among agents. Each agent is characterized by a claim on this pool and an individual concave reward function on assigned resources. An assignment of resources is optimal if the total joint reward is...

This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of maximizing the total joint reward,...