Maximizing the minimum voter satisfaction on spanning trees

✍ Scribed by Andreas Darmann; Christian Klamler; Ulrich Pferschy

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 689 KB
• Volume: 58
• Category: Article
• ISSN: 0165-4896
• DOI: 10.1016/j.mathsocsci.2009.05.002

✦ Synopsis

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, can be determined efficiently given the goal of maximin voter satisfaction. In particular, we show that computing spanning trees for maximin voter satisfaction under voting rules such as approval voting or the Borda count is N P -complete for a variable number of voters whereas it remains polynomially solvable for a constant number of voters.