Characterizations of the \(\beta\)- and the degree network power measure

DOI10.1007/S11238-007-9077-8zbMath1154.91327OpenAlexW2099251416MaRDI QIDQ931431

Guillermo Owen, René van den Brink, Ruud Hendrickx, P. E. M. Borm

Publication date: 25 June 2008

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-007-9077-8

zbMATH Keywords

degree measurenetwork powerstationary power distributionsymmetric networks

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (8)

Axiomatic characterization of PageRank ⋮ The probabilistic Harsanyi power solutions for probabilistic graph games ⋮ Harsanyi power solutions for graph-restricted games ⋮ A model of influence in a social network ⋮ Axiomatizations of the \(\beta\) and the score measures in networks ⋮ Attachment centrality: measure for connectivity in networks ⋮ Logical independence of the axioms characterizing the degree measure in van den Brink et al. (2008) ⋮ On Different Ranking Methods

Cites Work

• Digraph competitions and cooperative games
• An iterative procedure for evaluating digraph competitions
• The apex power measure for directed networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizations of the \(\beta\)- and the degree network power measure