IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v42y2003i1p156-171.html
   My bibliography  Save this article

Cost allocation in spanning network enterprises with stochastic connection costs

Author

Listed:
  • Suijs, Jeroen

Abstract

No abstract is available for this item.

Suggested Citation

  • Suijs, Jeroen, 2003. "Cost allocation in spanning network enterprises with stochastic connection costs," Games and Economic Behavior, Elsevier, vol. 42(1), pages 156-171, January.
    • Handle: RePEc:eee:gamebe:v:42:y:2003:i:1:p:156-171
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(02)00508-0
    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. Nimrod Megiddo, 1978. "Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 189-196, August.
    2. Suijs, Jeroen & Borm, Peter, 1999. "Stochastic Cooperative Games: Superadditivity, Convexity, and Certainty Equivalents," Games and Economic Behavior, Elsevier, vol. 27(2), pages 331-345, May.
    3. Haezendonck, J. & de Vylder, F. & Delbaen, F., 1984. "Representation theorems for extremal distributions," Insurance: Mathematics and Economics, Elsevier, vol. 3(3), pages 195-197, July.
    4. Sharkey, W.W., 1991. "Network Models in Economics," Papers 69, Bell Communications - Economic Research Group.
    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. Moretti, S. & Alparslan-Gok, S.Z. & Brânzei, R. & Tijs, S.H., 2008. "Connection Situations under Uncertainty," Other publications TiSEM e9771ffd-ce59-4b8d-a2c8-d, Tilburg University, School of Economics and Management.
    2. Quant, Marieke & Borm, Peter & Reijnierse, Hans, 2006. "Congestion network problems and related games," European Journal of Operational Research, Elsevier, vol. 172(3), pages 919-930, August.
    3. Moretti, S. & Alparslan-Gok, S.Z. & Brânzei, R. & Tijs, S.H., 2008. "Connection Situations under Uncertainty," Discussion Paper 2008-64, Tilburg University, Center for Economic Research.

    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. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kojiro Furumi, 2023. "A two-stage linear production planning model with partial cooperation under stochastic demands," Annals of Operations Research, Springer, vol. 320(1), pages 293-324, January.
    2. Csóka, Péter & Illés, Ferenc & Solymosi, Tamás, 2022. "On the Shapley value of liability games," European Journal of Operational Research, Elsevier, vol. 300(1), pages 378-386.
    3. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
    4. Németh, Tibor & Pintér, Miklós, 2017. "The non-emptiness of the weak sequential core of a transferable utility game with uncertainty," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 1-6.
    5. Jens Leth Hougaard & Mich Tvede, 2010. "Strategyproof Nash Equilibria in Minimum Cost Spanning Tree Models," MSAP Working Paper Series 01_2010, University of Copenhagen, Department of Food and Resource Economics.
    6. Hougaard, Jens Leth & Tvede, Mich, 2015. "Minimum cost connection networks: Truth-telling and implementation," Journal of Economic Theory, Elsevier, vol. 157(C), pages 76-99.
    7. Economides, Nicholas, 1996. "Network externalities, complementarities, and invitations to enter," European Journal of Political Economy, Elsevier, vol. 12(2), pages 211-233, September.
    8. 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.
    9. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    10. Jian Yang, 2023. "A Partial Order for Strictly Positive Coalitional Games and a Link from Risk Aversion to Cooperation," Papers 2304.10652, arXiv.org.
    11. Ruben Juarez & Rajnish Kumar, 2013. "Implementing efficient graphs in connection networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 359-403, October.
    12. Ziv Hellman & Ron Peretz, 2015. "Values for Cooperative Games over Graphs and Games With Inadmissible Coalitions," Working Papers 2015-04, Bar-Ilan University, Department of Economics.
    13. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions (extended version)," CERS-IE WORKING PAPERS 1914, Institute of Economics, Centre for Economic and Regional Studies.
    14. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    15. Stefano Moretti & Fioravante Patrone, 2008. "Transversality of the Shapley value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 1-41, July.
    16. Pavel Konyukhovskiy & Victoria Holodkova & Aleksander Titov, 2019. "Modeling Competition between Countries in the Development of Arctic Resources," Resources, MDPI, vol. 8(1), pages 1-17, March.
    17. Judith Timmer & Peter Borm & Stef Tijs, 2005. "Convexity In Stochastic Cooperative Situations," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(01), pages 25-42.
    18. 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.
    19. Yang, Jian & Li, Jianbin, 2020. "Cooperative game with nondeterministic returns," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 123-140.
    20. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1087-1109, December.

    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:eee:gamebe:v:42:y:2003:i:1:p:156-171. 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/622836 .

    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.