IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20050061.html
   My bibliography  Save this paper

Characterizations of Network Power Measures

Author

Listed:
  • René van den Brink

    (Faculty of Economics and Business Administration, Vrije Universiteit Amsterdam)

  • Peter Borm

    (CentER, Tilburg University)

  • Ruud Hendrickx

    (CentER, Tilburg University)

  • Guillermo Owen

    (Dept. of Mathematics, Naval Postgraduate School, Monterey, Ca, USA)

Abstract

This discussion paper led to a publication in 'Theory and Decision', 2008, 64, 519-536. A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable utility game that measures the "power" of each coalition of positions in the network. Applying the Shapley value to this game yields a network power measure, the beta-measure, which reflects the power of the individual positions in the network. Applying this power distribution method iteratively yields a limit distribution, which turns out to equal the well-known degree measure. We compare the beta-measure and degree measure by providing characterizations, which differ only in the normalization that is used.

Suggested Citation

  • René van den Brink & Peter Borm & Ruud Hendrickx & Guillermo Owen, 2005. "Characterizations of Network Power Measures," Tinbergen Institute Discussion Papers 05-061/1, Tinbergen Institute.
  • Handle: RePEc:tin:wpaper:20050061
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/05061.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Peter Borm & René van den Brink & Marco Slikker, 2002. "An Iterative Procedure for Evaluating Digraph Competitions," Annals of Operations Research, Springer, vol. 109(1), pages 61-75, 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. Hendrickx, R.L.P. & Borm, P.E.M. & van den Brink, J.R. & Owen, G., 2005. "The V L Value for Network Games," Discussion Paper 2005-65, 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. Manuel Förster & Michel Grabisch & Agnieszka Rusinowska, 2012. "Ordered Weighted Averaging in Social Networks," Documents de travail du Centre d'Economie de la Sorbonne 12056, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Borm, Peter & van den Brink, Rene & Levinsky, Rene & Slikker, Marco, 2004. "On two new social choice correspondences," Mathematical Social Sciences, Elsevier, vol. 47(1), pages 51-68, January.
    3. Förster, Manuel & Grabisch, Michel & Rusinowska, Agnieszka, 2013. "Anonymous social influence," Games and Economic Behavior, Elsevier, vol. 82(C), pages 621-635.
    4. Yuan Ju & Peter Borm & Pieter Ruys, 2007. "The consensus value: a new solution concept for cooperative games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 685-703, June.
    5. Grabisch, Michel & Rusinowska, Agnieszka, 2011. "A model of influence with a continuum of actions," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 576-587.
    6. Mitri Kitti, 2012. "Axioms for Centrality Scoring with Principal Eigenvectors," Discussion Papers 79, Aboa Centre for Economics.
    7. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2001. "Measuring the Power of Nodes in Digraphs," Other publications TiSEM 8ad1bdb1-a602-4674-b737-2, Tilburg University, School of Economics and Management.
    8. Quant, M. & Borm, P.E.M. & Reijnierse, J.H. & Voorneveld, M., 2002. "Characterizations of Solutions in Digraph Competitions," Discussion Paper 2002-113, Tilburg University, Center for Economic Research.
    9. Robert P. Gilles & Lina Mallozzi, 2022. "Gately Values of Cooperative Games," Papers 2208.10189, arXiv.org, revised Jul 2023.
    10. Encarnación Algaba & René Brink & Chris Dietz, 2017. "Power Measures and Solutions for Games Under Precedence Constraints," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 1008-1022, March.
    11. Mitri Kitti, 2016. "Axioms for centrality scoring with principal eigenvectors," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 639-653, March.
    12. Gilles, Robert P. & Mallozzi, Lina, 2022. "Generalised Gately Values of Cooperative Games," QBS Working Paper Series 2022/06, Queen's University Belfast, Queen's Business School.
    13. Marco Slikker & Peter Borm & René Brink, 2012. "Internal slackening scoring methods," Theory and Decision, Springer, vol. 72(4), pages 445-462, April.
    14. van den Brink, J.R. & Borm, P.E.M. & Hendrickx, R.L.P. & Owen, G., 2008. "Characterizations of the beta- and the degree network power measure," Other publications TiSEM 101ef139-cc05-4b30-bef5-1, Tilburg University, School of Economics and Management.
    15. Quant, M. & Borm, P.E.M. & Reijnierse, J.H. & Voorneveld, M., 2006. "On the Beta measure for digraph competitions," Other publications TiSEM 214590f7-5605-42d6-8353-6, Tilburg University, School of Economics and Management.
    16. László Csató, 2015. "A graph interpretation of the least squares ranking method," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(1), pages 51-69, January.
    17. Encarnacion Algaba & René van den Brink & Chris Dietz, 2015. "Power Measures and Solutions for Games under Precedence Constraints," Tinbergen Institute Discussion Papers 15-007/II, Tinbergen Institute.
    18. René Brink & Peter Borm & Ruud Hendrickx & Guillermo Owen, 2008. "Characterizations of the β- and the Degree Network Power Measure," Theory and Decision, Springer, vol. 64(4), pages 519-536, June.

    More about this item

    Keywords

    symmetric networks; network power; stationary power distribution; beta-measure; degree measure;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • Z13 - Other Special Topics - - Cultural Economics - - - Economic Sociology; Economic Anthropology; Language; Social and Economic Stratification

    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:tin:wpaper:20050061. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.