Essays on cooperation in resource allocation and scheduling

In this dissertation, two topics are discussed. First, cooperation in resource allocation is considered. In resource allocation, resources are divided among collaborating agents who are characterized by individual monetary reward functions. Here assignments of resources are considered such that the total joint reward is maximized. Secondly, cooperation in a single-machine scheduling problem is discussed. For these scheduling problems the reordering of families of jobs with respect to an initial processing order is considered, such that the cost savings are maximized. For both topics, cooperative game theory is applied in order to allocate the resulting maximum total joint reward or maximum cost saving.