Maximizing the minimum voter satisfaction on spanning trees
AbstractThis 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 -complete for a variable number of voters whereas it remains polynomially solvable for a constant number of voters.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 58 (2009)
Issue (Month): 2 (September)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Minimal spanning tree Social choice Fairness;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Marc Vorsatz, 2004.
"Scoring Rules on Dichotomous Preferences,"
UFAE and IAE Working Papers
617.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Dutta, Bhaskar & Kar, Anirban, 2002.
"Cost Monotonicity, Consistency And Minimum Cost Spanning Tree Games,"
The Warwick Economics Research Paper Series (TWERPS)
629, University of Warwick, Department of Economics.
- Dutta, Bhaskar & Kar, Anirban, 2004. "Cost monotonicity, consistency and minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 223-248, August.
- Bhaskar Dutta & Anirban Kar, 2002. "Cost monotonicity, consistency and minimum cost spanning tree games," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 02-04, Indian Statistical Institute, New Delhi, India.
- William Thomson, 2007. "Fair Allocation Rules," RCER Working Papers 539, University of Rochester - Center for Economic Research (RCER).
- Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February.
- Roberts, Fred S., 1991. "Characterizations of the plurality function," Mathematical Social Sciences, Elsevier, vol. 21(2), pages 101-127, April.
- Darmann, Andreas & Klamler, Christian & Pferschy, Ulrich, 2010. "A note on maximizing the minimum voter satisfaction on spanning trees," Mathematical Social Sciences, Elsevier, vol. 60(1), pages 82-85, July.
- Klamler, Christian & Pferschy, Ulrich & Ruzika, Stefan, 2012. "Committee selection under weight constraints," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 48-56.
- Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.