A note on 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.
- Brams, Steven J. & Fishburn, Peter C., 2002.
Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 4, pages 173-236
- Brams, Steven J., 1994. "Voting procedures," Handbook of Game Theory with Economic Applications,in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 30, pages 1055-1089 Elsevier.
- Darmann, Andreas & Klamler, Christian & Pferschy, Ulrich, 2009. "Maximizing the minimum voter satisfaction on spanning trees," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 238-250, September.
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.
- 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:60:y:2010:i:1:p:82-85. 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 .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.