Power on digraphs

Hans Peters, Judith Timmer, Rene van den Brink

Research output: Working paperProfessional

405 Downloads (Pure)

Abstract

It is assumed that relations between n players are reflected by a directed
graph or digraph. Such a digraph is called invariant if there is an 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 consider-
ing additional conditions about the effect of adding a directed link (arc)
between two players we single out three different, one parameter families
of power indices, reflecting several well-known indices from the literature:
Copeland score, β- and apex-type indices.
Original languageEnglish
PublisherMaastricht University, Graduate School of Business and Economics
DOIs
Publication statusPublished - Apr 2016

Publication series

SeriesGSBE Research Memoranda
Number019

JEL classifications

  • c71 - Cooperative Games

Cite this