Power on digraphs

Hans Peters, Judith Timmer () and Rene van den Brink ()

Operations Research and Decisions, 2016, vol. 26, issue 2, 107-125

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.

Keywords: digraph; power index; transfer property; link addition (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/1224%20-%20published.pdf (application/pdf)

Related works:
Working Paper: Power on digraphs (2016)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:2:y:2016:p:107-125:id:1224

DOI: 10.5277/ord160207

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().