We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems.

This paper introduces a new class of games, highway games, which arise from situations where there is a common resource that agents will jointly use. That resource is an ordered set of several indivisible sections, where each section has an associated fixed cost and each agent requires some...

This paper presents an extension of the traditional bankruptcy problem. In a resource allocation problem there is a common-pool resource, which needs to be divided among agents. Each agent is characterized by a claim on this pool and an individual linear monetary reward function for assigned...

This paper presents an extension of the traditional bankruptcy problem. In a resource allocation problem there is a common-pool resource, which needs to be divided among agents. Each agent is characterized by a claim on this pool and an individual linear monetary reward function for assigned...