IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v2y2016p107-125id1224.html

Power on digraphs

Author

Listed:
  • Hans Peters

  • Judith Timmer

  • Rene van den Brink

Abstract

It is assumed that relations between n players are represented by a directed graph or digraph. Such a digraph is called invariant if there is a link (arc) between any two players between whom there is also a directed path. We characterize a class of power indices for invariant digraphs based on four axioms: Null player, Constant sum, Anonymity, and the Transfer property. This class is determined by 2n – 2 parameters. By considering additional conditions about the effect of adding a directed link between two players, we single out three different, one-parameter families of power indices, reflecting several well-known indices from the literature: the Copeland score,and apex type indices.

Suggested Citation

  • Hans Peters & Judith Timmer & Rene van den Brink, 2016. "Power on digraphs," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 26(2), pages 107-125.
    • Handle: RePEc:wut:journl:v:2:y:2016:p:107-125:id:1224
    DOI: 10.5277/ord160207
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/1224%20-%20published.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.5277/ord160207?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. is not listed on IDEAS
    2. Qianqian Kong & Hans Peters, 2021. "An issue based power index," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 23-38, March.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:wut:journl:v:2:y:2016:p:107-125:id:1224. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.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.