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

In this article we investigate the problem of selecting a committee consisting of k members from a list of m candidates. Each candidate has a certain cost or weight. The choice of the k-committee has to satisfy some budget or weight constraint: the sum of the weights of all committee members...