Power in graphs with classes
From MaRDI portal
Cites work
- Axiomatic characterization of game-theoretic centrality
- Centrality and power in social networks: A game theoretic approach.
- Centrality measures in networks
- Characterizations of the - and the degree network power measure
- Degree centrality, von Neumann-Morgenstern expected utility and externalities in networks
- Efficient algorithms for game-theoretic betweenness centrality
- Efficient computation of the Shapley value for game-theoretic network centrality
- Efficient quotient extensions of the Myerson value
- Graphs and Cooperation in Games
- Harsanyi power solutions for graph-restricted games
- How to share when context matters: the Möbius value as a generalized solution for cooperative games
- scientific article; zbMATH DE number 3138565 (Why is no real title available?)
- scientific article; zbMATH DE number 3839628 (Why is no real title available?)
- scientific article; zbMATH DE number 4164592 (Why is no real title available?)
- scientific article; zbMATH DE number 3614541 (Why is no real title available?)
- Indirect control and power in mutual control structures
- Node centrality based on its edges importance: the position centrality
- The centrality index of a graph
- The centrality of groups and classes
- The degree measure as utility function over positions in graphs and digraphs
- The Myerson value for directed graph games
- The Myerson value on local structures of coalitions
- The Shapley value for directed graph games
- Values for cooperative games over graphs and games with inadmissible coalitions
- Values of games with graph restricted communication and a priori unions
This page was built for publication: Power in graphs with classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303940)
