IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-01592181.html
   My bibliography  Save this paper

The degree measure as utility function over positions in networks

Author

Listed:
  • René van den Brink

    (Department of Econometrics and Tinbergen Institute - VU - Vrije Universiteit Amsterdam [Amsterdam])

  • Agnieszka Rusinowska

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

In this paper, we connect the social network theory on centrality measures to the economic theory of preferences and utility. Using the fact that networks form a special class of cooperative TU-games, we provide a foundation for the degree measure as a von Neumann-Morgenstern expected utility function reflecting preferences over being in different positions in different networks. The famous degree measure assigns to every position in a weighted network the sum of the weights of all links with its neighbours. A crucial property of a preference relation over network positions is neutrality to ordinary risk. If an expected utility function over network positions satisfies this property and some regularity properties, then it must be represented by a utility function that is a multiple of the degree centrality measure. We show this in three steps. First, we characterize the degree measure as a centrality measure for weighted networks using four natural axioms. Second, we relate these network centrality axioms to properties of preference relations over positions in networks. Third, we show that the expected utility function is equal to a multiple of the degree measure if and only if it represents a regular preference relation that is neutral to ordinary risk. Similarly, we characterize a class of affine combinations of the outdegree and indegree measure in weighted directed networks and deliver its interpretation as a von Neumann-Morgenstern expected utility function.

Suggested Citation

  • René van den Brink & Agnieszka Rusinowska, 2017. "The degree measure as utility function over positions in networks," Post-Print halshs-01592181, HAL.
  • Handle: RePEc:hal:journl:halshs-01592181
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-01592181
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-01592181/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    2. Trockel, Walter, 1992. "An Alternative Proof for the Linear Utility Representation Theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(2), pages 298-302, April.
    3. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    4. A. van den Nouweland & P. Borm & W. van Golstein Brouwers & R. Groot Bruinderink & S. Tijs, 1996. "A Game Theoretic Approach to Problems in Telecommunication," Management Science, INFORMS, vol. 42(2), pages 294-303, February.
    5. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
    6. van den Brink, René & González-Arangüena, Enrique & Manuel, Conrado & del Pozo, Mónica, 2014. "Order monotonic solutions for generalized characteristic functions," European Journal of Operational Research, Elsevier, vol. 238(3), pages 786-796.
    7. Sanjeev Goyal, 2007. "Introduction to Connections: An Introduction to the Economics of Networks," Introductory Chapters, in: Connections: An Introduction to the Economics of Networks, Princeton University Press.
    8. repec:hal:pseose:halshs-01109087 is not listed on IDEAS
    9. Ignacio Palacios-Huerta & Oscar Volij, 2004. "The Measurement of Intellectual Influence," Econometrica, Econometric Society, vol. 72(3), pages 963-977, May.
    10. Neuefeind, Wilhelm & Trockel, Walter, 1995. "Continuous Linear Representability of Binary Relations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 6(2), pages 351-356, July.
    11. Zenou, Yves & ,, 2014. "Local and Consistent Centrality Measures in Networks," CEPR Discussion Papers 10031, C.E.P.R. Discussion Papers.
    12. 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.
    13. Giora Slutzki & Oscar Volij, 2006. "Scoring of web pages and tournaments—axiomatizations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(1), pages 75-92, January.
    14. Trockel, Walter, 1989. "Classification of budget-invariant monotonic preferences," Economics Letters, Elsevier, vol. 30(1), pages 7-10.
    15. Pradeep Dubey & Lloyd S. Shapley, 1979. "Mathematical Properties of the Banzhaf Power Index," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 99-131, May.
    16. Gomez, Daniel & Gonzalez-Aranguena, Enrique & Manuel, Conrado & Owen, Guillermo & del Pozo, Monica & Tejada, Juan, 2003. "Centrality and power in social networks: a game theoretic approach," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 27-54, August.
    17. Nowak Andrzej S. & Radzik Tadeusz, 1994. "The Shapley Value for n-Person Games in Generalized Characteristic Function Form," Games and Economic Behavior, Elsevier, vol. 6(1), pages 150-161, January.
    18. Shapley, L. S. & Shubik, Martin, 1954. "A Method for Evaluating the Distribution of Power in a Committee System," American Political Science Review, Cambridge University Press, vol. 48(3), pages 787-792, September.
    19. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Alvin E. Roth, 1977. "A note on values and multilinear extensions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(3), pages 517-520, September.
    21. Bouyssou, Denis, 1992. "Ranking methods based on valued preference relations: A characterization of the net flow method," European Journal of Operational Research, Elsevier, vol. 60(1), pages 61-67, July.
    22. van den Brink, René & Gilles, Robert P., 2009. "The outflow ranking method for weighted directed graphs," European Journal of Operational Research, Elsevier, vol. 193(2), pages 484-491, March.
    23. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    24. D. Bouyssou & P. Perny, 1992. "Ranking methods for valued preference relations," Post-Print hal-02920156, HAL.
    25. Bouyssou, D. & Perny, P., 1992. "Ranking methods for valued preference relations : A characterization of a method based on leaving and entering flows," European Journal of Operational Research, Elsevier, vol. 61(1-2), pages 186-194, August.
    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. van den Brink, René & Rusinowska, Agnieszka, 2022. "The degree measure as utility function over positions in graphs and digraphs," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1033-1044.
    2. René Van Den Brink & Agnieszka Rusinowska, 2023. "Degree Centrality, von Neumann-Morgenstern Expected Utility and Externalities in Networks," Documents de travail du Centre d'Economie de la Sorbonne 23012r, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Jun 2024.
    3. René Van Den Brink & Agnieszka Rusinowska, 2023. "Degree Centrality, von Neumann-Morgenstern Expected Utility and Externalities in Networks," Documents de travail du Centre d'Economie de la Sorbonne 23012, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    4. Brink, René van den & Rusinowska, Agnieszka, 2021. "The degree ratio ranking method for directed graphs," European Journal of Operational Research, Elsevier, vol. 288(2), pages 563-575.
    5. Demange, Gabrielle, 2017. "Mutual rankings," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 35-42.
    6. Rene van den Brink & Agnieszka Rusinowska, "undated". "The Degree Ratio Ranking Method for Directed Networks," Tinbergen Institute Discussion Papers 19-026/II, Tinbergen Institute.
    7. Daniela Bubboloni & Michele Gori, 2018. "The flow network method," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(4), pages 621-656, December.
    8. Dequiedt, Vianney & Zenou, Yves, 2017. "Local and consistent centrality measures in parameterized networks," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 28-36.
    9. P. Herings & A. Predtetchinski & A. Perea, 2006. "The Weak Sequential Core for Two-Period Economies," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 55-65, April.
    10. P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman, 2000. "Cooperative Games in Graph Structure," Tinbergen Institute Discussion Papers 00-072/1, Tinbergen Institute.
    11. 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.
    12. Kar, Anirban & Mitra, Manipushpak & Mutuswami, Suresh, 2009. "On the coincidence of the prenucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 16-25, January.
    13. Rosa van den Ende & Antoine Mandel & Agnieszka Rusinowska, 2023. "Network-based allocation of responsibility for GHG emissions," Post-Print halshs-04188365, HAL.
    14. Manfred Besner, 2020. "Parallel axiomatizations of weighted and multiweighted Shapley values, random order values, and the Harsanyi set," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(1), pages 193-212, June.
    15. Francis Bloch & Matthew O. Jackson & Pietro Tebaldi, 2023. "Centrality measures in networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(2), pages 413-453, August.
    16. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    17. Meinhardt, Holger Ingmar, 2021. "Disentangle the Florentine Families Network by the Pre-Kernel," MPRA Paper 106482, University Library of Munich, Germany.
    18. van den Brink, René & Gilles, Robert P., 2009. "The outflow ranking method for weighted directed graphs," European Journal of Operational Research, Elsevier, vol. 193(2), pages 484-491, March.
    19. Balázs Sziklai, 2018. "How to identify experts in a community?," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 155-173, March.
    20. 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.

    More about this item

    Keywords

    Weighted network; network centrality; utility function; degree centrality; von Neumann-Morgenstern expected utility function; cooperative TU-game; weighted directed network; Réseau pondéré; centralité; fonction d'utilité; centralité de degré; fonction d'utilité attendue de von Neumann-Morgenstern; jeu coopératif; réseau pondéré orienté;
    All these keywords.

    JEL classification:

    • D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics

    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:hal:journl:halshs-01592181. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.