IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/7ac3a323-f736-46a6-b568-c4c6d20cfe8c.html
   My bibliography  Save this paper

The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games

Author

Listed:
  • Norde, H.W.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Other publications TiSEM 7ac3a323-f736-46a6-b568-c, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:7ac3a323-f736-46a6-b568-c4c6d20cfe8c
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1526141/2013-039.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 69(2), pages 224-237, July.
    2. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
    3. 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.
    4. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    5. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Other publications TiSEM 2c6cd46b-7e72-4262-a479-3, Tilburg University, School of Economics and Management.
    6. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
    7. 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.
    8. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Discussion Paper 2003-129, Tilburg University, Center for Economic Research.
    9. Anna Bogomolnaia & Ron Holzman & Hervé Moulin, 2010. "Sharing the Cost of a Capacity Network," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 173-192, February.
    10. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Discussion Paper 1994-96, Tilburg University, Center for Economic Research.
    11. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, April.
    12. Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
    13. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Norde, Henk, 2019. "The degree and cost adjusted folk solution for minimum cost spanning tree games," Games and Economic Behavior, Elsevier, vol. 113(C), pages 734-742.
    3. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    4. Dutta, Bhaskar & Mishra, Debasis, 2012. "Minimum cost arborescences," Games and Economic Behavior, Elsevier, vol. 74(1), pages 120-143.
    5. Gustavo Bergantiños & Leticia Lorenzo, 2021. "Cost additive rules in minimum cost spanning tree problems with multiple sources," Annals of Operations Research, Springer, vol. 301(1), pages 5-15, June.
    6. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.
    7. Gustavo Bergantiños & Juan Vidal-Puga, 2015. "Characterization of monotonic rules in minimum cost spanning tree problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 835-868, November.
    8. Hernández, Penélope & Peris, Josep E. & Silva-Reus, José A., 2016. "Strategic sharing of a costly network," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 72-82.
    9. Bergantiños, Gustavo & Lorenzo, Leticia & Lorenzo-Freire, Silvia, 2011. "A generalization of obligation rules for minimum cost spanning tree problems," European Journal of Operational Research, Elsevier, vol. 211(1), pages 122-129, May.
    10. Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
    11. Gustavo Bergantiños & Youngsub Chun & Eunju Lee & Leticia Lorenzo, 2022. "The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 24(01), pages 1-36, March.
    12. Gomez-Rua, Maria & Vidal-Puga, Juan, 2006. "No advantageous merging in minimum cost spanning tree problems," MPRA Paper 601, University Library of Munich, Germany.
    13. Bergantiños, G. & Gómez-Rúa, M. & Llorca, N. & Pulido, M. & Sánchez-Soriano, J., 2014. "A new rule for source connection problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 780-788.
    14. Bergantiños, Gustavo & Kar, Anirban, 2010. "On obligation rules for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 69(2), pages 224-237, July.
    15. Ciftci, B.B. & Tijs, S.H., 2007. "A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems," Other publications TiSEM 1b5a01d9-e7e4-43da-acf0-7, Tilburg University, School of Economics and Management.
    16. Bergantiños, G. & Navarro-Ramos, A., 2019. "The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources," Mathematical Social Sciences, Elsevier, vol. 99(C), pages 43-48.
    17. 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.
    18. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
    19. Ciftci, B.B. & Tijs, S.H., 2007. "A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems," Discussion Paper 2007-89, Tilburg University, Center for Economic Research.
    20. Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties," Other publications TiSEM 78d24994-1074-4329-b911-c, Tilburg University, School of Economics and Management.

    More about this item

    Statistics

    Access and download statistics

    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:tiu:tiutis:7ac3a323-f736-46a6-b568-c4c6d20cfe8c. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.