IDEAS home Printed from
MyIDEAS: Login to save this article or follow this journal

Finding socially best spanning trees

  • Andreas Darmann


  • Christian Klamler


  • Ulrich Pferschy


No abstract is available for this item.

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

File URL:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by Springer in its journal Theory and Decision.

Volume (Year): 70 (2011)
Issue (Month): 4 (April)
Pages: 511-527

in new window

Handle: RePEc:kap:theord:v:70:y:2011:i:4:p:511-527
Contact details of provider: Web page:

References listed on IDEAS
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.:

as in new window
  1. BOSSERT, Walter & SPRUMONT, Yves & SUZUMURA, Kotaro, 2002. "Maximal-Element Rationalizability," Cahiers de recherche 2002-16, Universite de Montreal, Departement de sciences economiques.
  2. 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.
  3. Brams, Steven J. & Fishburn, Peter, 1998. "Voting Procedures," Working Papers 98-30, C.V. Starr Center for Applied Economics, New York University.
  4. BARBERA, Salvador & BOSSERT, Walter & PATTANAIK, Prasanta K., 2001. "Ranking Sets of Objects," Cahiers de recherche 2001-02, Universite de Montreal, Departement de sciences economiques.
  5. 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.
  6. 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.
  7. Fishburn, Peter C., 1992. "Signed orders and power set extensions," Journal of Economic Theory, Elsevier, vol. 56(1), pages 1-19, February.
  8. Perny, Patrice & Spanjaard, Olivier, 2005. "A preference-based approach to spanning trees and shortest paths problems***," European Journal of Operational Research, Elsevier, vol. 162(3), pages 584-601, May.
  9. Roberts, Fred S., 1991. "Characterizations of the plurality function," Mathematical Social Sciences, Elsevier, vol. 21(2), pages 101-127, April.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:70:y:2011:i:4:p:511-527. 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: (Sonal Shukla)

or (Christopher F. Baum)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

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

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.