Pages that link to "Item:Q4963217"
From MaRDI portal
The following pages link to Efficient Computation of Semivalues for Game-Theoretic Network Centrality (Q4963217):
Displaying 8 items.
- Parallelization of game theoretic centrality algorithms (Q301779) (← links)
- Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
- Centrality and power in social networks: A game theoretic approach. (Q1402484) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Coalitional games for networked controllers with constraints on semivalues: a randomized design approach (Q2096115) (← links)
- On network analysis using non-additive integrals: extending the game-theoretic network centrality (Q2317521) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- Directed communication in games with directed graphs (Q6081614) (← links)