IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v60y2010i1p82-85.html
   My bibliography  Save this article

A note on maximizing the minimum voter satisfaction on spanning trees

Author

Listed:
  • Darmann, Andreas
  • Klamler, Christian
  • Pferschy, Ulrich

Abstract

A fair spanning tree of a graph maximizes the minimum satisfaction among individuals given their preferences over the edges of the graph. In this note we answer an open question about the computational complexity of determining fair spanning trees raised in Darmann et al. (2009). It is shown that the maximin voter satisfaction problem under choose-t elections is -complete for each fixed t>=2.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matsoc:v:60:y:2010:i:1:p:82-85
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(10)00036-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. Brams, Steven J. & Fishburn, Peter C., 2002. "Voting procedures," 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, Elsevier.
    4. Peters, H.J.M. & Roy, S. & Storcken, A.J.A., 2008. "Manipulation under k-approval scoring rules," Research Memorandum 056, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.
    2. Klamler, Christian & Pferschy, Ulrich & Ruzika, Stefan, 2012. "Committee selection under weight constraints," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 48-56.
    3. Darmann, Andreas, 2013. "How hard is it to tell which is a Condorcet committee?," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 282-292.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2011. "Finding socially best spanning trees," Theory and Decision, Springer, vol. 70(4), pages 511-527, April.
    2. Darmann, Andreas, 2013. "How hard is it to tell which is a Condorcet committee?," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 282-292.
    3. Klamler, Christian & Pferschy, Ulrich & Ruzika, Stefan, 2012. "Committee selection under weight constraints," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 48-56.
    4. Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
    5. Juarez, Ruben & Ko, Chiu Yu & Xue, Jingyi, 2018. "Sharing sequential values in a network," Journal of Economic Theory, Elsevier, vol. 177(C), pages 734-779.
    6. Núñez, Matías & Sanver, M. Remzi, 2017. "Revisiting the connection between the no-show paradox and monotonicity," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 9-17.
    7. László Csató, 2023. "A comparative study of scoring systems by simulations," Journal of Sports Economics, , vol. 24(4), pages 526-545, May.
    8. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2024. "Stable and weakly additive cost sharing in shortest path problems," Journal of Mathematical Economics, Elsevier, vol. 110(C).
    9. 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.
    10. Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Discussion Paper 2013-039, Tilburg University, Center for Economic Research.
    11. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    12. Bergantiños, Gustavo & Navarro, Adriana, 2019. "Characterization of the painting rule for multi-source minimal cost spanning tree problems," MPRA Paper 93266, University Library of Munich, Germany.
    13. Peleg, Bezalel & Peters, Hans, 2017. "Choosing k from m: Feasible elimination procedures reconsidered," Games and Economic Behavior, Elsevier, vol. 103(C), pages 254-261.
    14. Bergantinos, Gustavo & Lorenzo-Freire, Silvia, 2008. ""Optimistic" weighted Shapley rules in minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 185(1), pages 289-298, February.
    15. Eyal Baharad & Shmuel Nitzan, 2011. "Condorcet vs. Borda in light of a dual majoritarian approach," Theory and Decision, Springer, vol. 71(2), pages 151-162, August.
    16. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November.
    17. Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
    18. Aumann, Robert J., 2003. "Presidential address," Games and Economic Behavior, Elsevier, vol. 45(1), pages 2-14, October.
    19. Gustavo Bergantiños & María Gómez-Rúa, 2015. "An axiomatic approach in minimum cost spanning tree problems with groups," Annals of Operations Research, Springer, vol. 225(1), pages 45-63, February.
    20. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.

    Corrections

    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.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.