Maximizing the minimum voter satisfaction on spanning trees
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Dutta, Bhaskar & Kar, Anirban, 2004.
"Cost monotonicity, consistency and minimum cost spanning tree games,"
Games and Economic Behavior,
Elsevier, pages 223-248.
- 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.
- 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.
- 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.
- William Thomson, 2007. "Fair Allocation Rules," RCER Working Papers 539, University of Rochester - Center for Economic Research (RCER).
- Marc Vorsatz, 2008. "Scoring rules on dichotomous preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(1), pages 151-162, June.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Klamler, Christian & Pferschy, Ulrich & Ruzika, Stefan, 2012. "Committee selection under weight constraints," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 48-56.
- 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.
- Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.
- Darmann, Andreas, 2013. "How hard is it to tell which is a Condorcet committee?," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 282-292.
More about this item
KeywordsMinimal spanning tree Social choice Fairness;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:58:y:2009:i:2:p:238-250. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .