IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/385509cd-511d-410c-aa23-20525f1428e4.html
   My bibliography  Save this paper

Communications and Cooperation in Public Network Situations

Author

Listed:
  • Suijs, J.P.M.

    (Tilburg University, School of Economics and Management)

  • Borm, P.E.M.

    (Tilburg University, School of Economics and Management)

  • Hamers, H.J.M.

    (Tilburg University, School of Economics and Management)

  • Koster, M.A.L.

    (Tilburg University, School of Economics and Management)

  • Quant, M.

    (Tilburg University, School of Economics and Management)

Abstract

This paper focuses on sharing the costs and revenues of maintaining a public network communication structure. Revenues are assumed to be bilateral and communication links are publicly available but costly. It is assumed that agents are located at the vertices of an undirected graph in which the edges represent all possible communication links. We take the approach from cooperative game theory and focus on the corresponding network game in coalitional form which relates any coalition of agents to its highest possible net benefit, i.e., the net benefit corresponding to an optimal operative network. Although finding an optimal network in general is a difficult problem, it is shown that corresponding network games are (totally) balanced. In the proof of this result a specific relaxation, duality and techniques of linear production games with committee control play a role. Sufficient conditions for convexity of network games are derived. Possible extensions of the model and its results are discussed. Copyright Springer Science + Business Media, Inc. 2005
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was bor
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Suijs, J.P.M. & Borm, P.E.M. & Hamers, H.J.M. & Koster, M.A.L. & Quant, M., 2001. "Communications and Cooperation in Public Network Situations," Other publications TiSEM 385509cd-511d-410c-aa23-2, Tilburg University, School of Economics and Management.
  • Handle: RePEc:tiu:tiutis:385509cd-511d-410c-aa23-20525f1428e4
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/539126/44.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. (*), Anne van den Nouweland & Marco Slikker, 2000. "original papers : Network formation models with costs for establishing links," Review of Economic Design, Springer;Society for Economic Design, vol. 5(3), pages 333-362.
    3. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    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. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. Estévez-Fernández, Arantza & Reijnierse, Hans, 2014. "On the core of cost-revenue games: Minimum cost spanning tree games with revenues," European Journal of Operational Research, Elsevier, vol. 237(2), pages 606-616.
    3. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    4. Estevez Fernandez, M.A., 2006. "Cooperative behavior, competition and operations research," Other publications TiSEM 89866d9a-2195-469c-a13f-0, Tilburg University, School of Economics and Management.
    5. Monsuur, Herman, 2007. "Stable and emergent network topologies: A structural approach," European Journal of Operational Research, Elsevier, vol. 183(1), pages 432-441, November.
    6. Arantza Estévez-Fernández & Peter Borm & Marc Meertens & Hans Reijnierse, 2009. "On the core of routing games with revenues," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 291-304, June.
    7. Pramod C. Mane & Kapil Ahuja & Nagarajan Krishnamurthy, 2020. "Stability, efficiency, and contentedness of social storage networks," Annals of Operations Research, Springer, vol. 287(2), pages 811-842, April.
    8. 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.
    9. 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.
    10. Xiaowei Lin & Jing Zhou & Lianmin Zhang & Yinlian Zeng, 2021. "Revenue sharing for resource reallocation among project activity contractors," Annals of Operations Research, Springer, vol. 301(1), pages 121-141, June.

    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. 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.
    2. 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.
    3. Faigle, U. & Grabisch, M. & Heyne, M., 2010. "Monge extensions of cooperation and communication structures," European Journal of Operational Research, Elsevier, vol. 206(1), pages 104-110, October.
    4. 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.
    5. Demuynck, Thomas & Rock, Bram De & Ginsburgh, Victor, 2016. "The transfer paradox in welfare space," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 1-4.
    6. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    7. Herings, P. Jean-Jacques & van der Laan, Gerard & Talman, Dolf, 2007. "The socially stable core in structured transferable utility games," Games and Economic Behavior, Elsevier, vol. 59(1), pages 85-104, April.
    8. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    9. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    10. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00344802, HAL.
    11. René van den Brink & Peter Borm, 2002. "Digraph Competitions and Cooperative Games," Theory and Decision, Springer, vol. 53(4), pages 327-342, December.
    12. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    13. Pin, Paolo, 2011. "Eight degrees of separation," Research in Economics, Elsevier, vol. 65(3), pages 259-270, September.
    14. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    15. Audy, Jean-François & D’Amours, Sophie & Rönnqvist, Mikael, 2012. "An empirical study on coalition formation and cost/savings allocation," International Journal of Production Economics, Elsevier, vol. 136(1), pages 13-27.
    16. Alessio D'Ignazio & Emanuele Giovannetti, 2006. "From Exogenous To Endogenous Economic Networks: Internet Applications," Journal of Economic Surveys, Wiley Blackwell, vol. 20(5), pages 757-796, December.
    17. Bilbao, J. M. & Lebron, E. & Jimenez, N., 1999. "The core of games on convex geometries," European Journal of Operational Research, Elsevier, vol. 119(2), pages 365-372, December.
    18. Mutuswami, Suresh & Winter, Eyal, 2002. "Subscription Mechanisms for Network Formation," Journal of Economic Theory, Elsevier, vol. 106(2), pages 242-264, October.
    19. Pierre Dehez, 2017. "On Harsanyi Dividends and Asymmetric Values," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(03), pages 1-36, September.
    20. 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.

    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:385509cd-511d-410c-aa23-20525f1428e4. 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.