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

This paper combines social choice theory with discrete optimization. We assume that individuals have preferences over edges of a graph that need to be aggregated. The goal is to find a socially "best" spanning tree in the graph. As ranking all spanning trees is becoming infeasible even for small...

This paper analyzes the computational complexity involved in solving fairness issues on graphs, e.g.in the installation of networks such as water networks or oil pipelines. Based on individual rankings of the edges of a graph, we will show under which conditions solutions, i.e.spanning trees,...

A fair spanning tree of a graph maximizes the minimum satisfaction among individuals given their preferences over the edges of the graph. In this note we answer an open question about the computational complexity of determining fair spanning trees raised in Darmann et al. (2009). It is shown...