IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/00be5459-457b-4d83-b8c7-614b008ceeef.html
   My bibliography  Save this paper

Cost allocation and communication

Author

Listed:
  • van den Nouweland, C.G.A.M.
  • Borm, P.E.M.

    (Tilburg University, School of Economics and Management)

  • Owen, G.
  • Tijs, S.H.

    (Tilburg University, School of Economics and Management)

Abstract

This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • van den Nouweland, C.G.A.M. & Borm, P.E.M. & Owen, G. & Tijs, S.H., 1993. "Cost allocation and communication," Other publications TiSEM 00be5459-457b-4d83-b8c7-6, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:00be5459-457b-4d83-b8c7-614b008ceeef
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/632928/26971_12932.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    2. van den Nouweland, Anne & Borm, Peter, 1991. "On the Convexity of Communication Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(4), pages 421-430.
    3. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    4. Guillermo Owen, 1972. "Multilinear Extensions of Games," Management Science, INFORMS, vol. 18(5-Part-2), pages 64-79, January.
    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. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Other publications TiSEM f5cc3272-7570-4e25-895d-e, Tilburg University, School of Economics and Management.
    2. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Research Memorandum FEW 538, Tilburg University, School of Economics and Management.

    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. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2000. "The position value for union stable systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 221-236, November.
    3. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01305005, HAL.
    4. E. Algaba & J.M. Bilbao & J.J. López, 2001. "A unified approach to restricted games," Theory and Decision, Springer, vol. 50(4), pages 333-345, June.
    5. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    6. Slikker, M., 1998. "Average Convexity in Communication Situations," Other publications TiSEM 612b0000-a66a-435a-a707-2, Tilburg University, School of Economics and Management.
    7. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    8. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Research Memorandum FEW 538, Tilburg University, School of Economics and Management.
    9. Daniel Li Li & Erfang Shan, 2022. "Safety of links with respect to the Myerson value for communication situations," Operational Research, Springer, vol. 22(3), pages 2121-2131, July.
    10. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Post-Print hal-01305005, HAL.
    11. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Other publications TiSEM f5cc3272-7570-4e25-895d-e, Tilburg University, School of Economics and Management.
    12. Slikker, M., 1998. "Average Convexity in Communication Situations," Discussion Paper 1998-12, Tilburg University, Center for Economic Research.
    13. Conrado M. Manuel & Daniel Martín, 2020. "A Monotonic Weighted Shapley Value," Group Decision and Negotiation, Springer, vol. 29(4), pages 627-654, August.
    14. Subhadip Chakrabarti & Loyimee Gogoi & Robert P. Gilles & Surajit Borkotokey & Rajnish Kumar, 2024. "Expected values for variable network games," Annals of Operations Research, Springer, vol. 336(3), pages 2061-2089, May.
    15. Labreuche, Christophe, 2011. "Interaction indices for games on combinatorial structures with forbidden coalitions," European Journal of Operational Research, Elsevier, vol. 214(1), pages 99-108, October.
    16. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    17. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    18. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Documents de travail du Centre d'Economie de la Sorbonne 22016, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    19. 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.
    20. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, 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:tiu:tiutis:00be5459-457b-4d83-b8c7-614b008ceeef. 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.