This paper provides a first insight into cost sharing rules for the continuous knapsack problem. Assuming a set of divisible items with weights from which a knapsack with a certain weight constraint is to be filled, different such (classes of) rules are discussed. Those - based on individual...

In recent years, many authors have analysed fair division aspects in problems containing network structures. Frequently, the connection of all vertices of the network, i.e., a minimum cost spanning tree, and the sharing of its cost was considered. In this paper we study the fair division of...