IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/8ad1bdb1-a602-4674-b737-2355c11e7d21.html
   My bibliography  Save this paper

Measuring the Power of Nodes in Digraphs

Author

Listed:
  • Herings, P.J.J.

    (Tilburg University, Center For Economic Research)

  • van der Laan, G.
  • Talman, A.J.J.

    (Tilburg University, Center For Economic Research)

Abstract

This discussion paper led to a publication in 'Social Choice and Welfare', 2005, 24, 439-454. Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its successors, as in axiomatic methods, and the powers of its successors, as initerative methods. Contrary to other iterative methods, we obtain a full ranking of the nodes forany digraph. The new power function, called the positional power function, can either bedetermined as the unique solution to a system of equations, or as the limit point of an iterativeprocess. The solution is also explicitly characterized. This characterization enables us to derive anumber of interesting properties of the positional power function. Next we consider a number ofextensions, like the positional weakness function and the position function.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2001. "Measuring the Power of Nodes in Digraphs," Discussion Paper 2001-72, Tilburg University, Center for Economic Research.
  • Handle: RePEc:tiu:tiucen:8ad1bdb1-a602-4674-b737-2355c11e7d21
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/539985/72.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. 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.
    3. 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.
    4. 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.
    5. Gilles, Robert P & Owen, Guillermo & van den Brink, Rene, 1992. "Games with Permission Structures: The Conjunctive Approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 277-293.
    6. Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.
    7. D. Bouyssou & P. Perny, 1992. "Ranking methods for valued preference relations," Post-Print hal-02920156, HAL.
    8. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2003. "Socially Structured Games and their Applications," Other publications TiSEM 271c701e-4489-41b3-8d9e-f, Tilburg University, School of Economics and Management.
    4. Amer, Rafael & Gimenez, Jose Miguel & Magana, Antonio, 2007. "Accessibility in oriented networks," European Journal of Operational Research, Elsevier, vol. 180(2), pages 700-712, July.

    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, 2017. "The degree measure as utility function over positions in networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01592181, HAL.
    3. Rene van den Brink & Agnieszka Rusinowska, "undated". "The Degree Ratio Ranking Method for Directed Networks," Tinbergen Institute Discussion Papers 19-026/II, Tinbergen Institute.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. László Csató, 2019. "An impossibility theorem for paired comparisons," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 497-514, June.
    9. Walter Bossert & Kotaro Suzumura, 2020. "Positionalist voting rules: a general definition and axiomatic characterizations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(1), pages 85-116, June.
    10. G Özerol & E Karasakal, 2008. "Interactive outranking approaches for multicriteria decision-making problems with imprecise information," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1253-1268, September.
    11. Chen, Xuqi & Gao, Zhifeng & House, Lisa, 2015. "Willingness to Pay for Niche Fresh Produce across the States: Why Are Consumers Willing to Pay More for the Less Favorite?," 2015 Annual Meeting, January 31-February 3, 2015, Atlanta, Georgia 196901, Southern Agricultural Economics Association.
    12. Alexandru-Liviu Olteanu & Khaled Belahcene & Vincent Mousseau & Wassila Ouerdane & Antoine Rolland & Jun Zheng, 2022. "Preference elicitation for a ranking method based on multiple reference profiles," 4OR, Springer, vol. 20(1), pages 63-84, March.
    13. Zhiwei Cui & Yan-An Hwang & Ding-Cheng You, 2021. "Axiomatizations of the $$\beta $$ β and the score measures in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 399-418, June.
    14. Philippe Vincke, 1994. "Recent progresses in Multicriteria Decision-Aid," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 17(2), pages 21-32, September.
    15. Csató, László, 2013. "Rangsorolás páros összehasonlításokkal. Kiegészítések a felvételizői preferencia-sorrendek módszertanához [Paired comparisons ranking. A supplement to the methodology of application-based preferenc," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(12), pages 1333-1353.
    16. Vincke, Ph., 1999. "Robust and neutral methods for aggregating preferences into an outranking relation," European Journal of Operational Research, Elsevier, vol. 112(2), pages 405-412, January.
    17. Yazidi, Anis & Ivanovska, Magdalena & Zennaro, Fabio M. & Lind, Pedro G. & Viedma, Enrique Herrera, 2022. "A new decision making model based on Rank Centrality for GDM with fuzzy preference relations," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1030-1041.
    18. Behzadian, Majid & Kazemzadeh, R.B. & Albadvi, A. & Aghdasi, M., 2010. "PROMETHEE: A comprehensive literature review on methodologies and applications," European Journal of Operational Research, Elsevier, vol. 200(1), pages 198-215, January.
    19. Maria Rosaria Guarini & Fabrizio Battisti & Anthea Chiovitti, 2018. "A Methodology for the Selection of Multi-Criteria Decision Analysis Methods in Real Estate and Land Management Processes," Sustainability, MDPI, vol. 10(2), pages 1-28, February.
    20. Monsuur, Herman, 2005. "Characterizations of the 3-cycle count and backward length of a tournament," European Journal of Operational Research, Elsevier, vol. 164(3), pages 778-784, August.

    More about this item

    Keywords

    graphs;

    JEL classification:

    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

    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:tiucen:8ad1bdb1-a602-4674-b737-2355c11e7d21. 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: http://center.uvt.nl .

    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.