Accessibility in oriented networks
From MaRDI portal
Recommendations
- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
- The cooperative game theory of networks and hierarchies
- Introduction of measurement rules on the nodes of oriented structures by using concepts of game theory
- Values of games with weighted graphs
- Values for cooperative games over graphs and games with inadmissible coalitions
Cites work
- A connectivity game for graphs
- Digraph competitions and cooperative games
- Games with permission structures: The conjunctive approach
- Graphs and Cooperation in Games
- Hierarchical organization structures and constraints on coalition formation
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- On values for generalized characteristic functions
- The bipartisan set of a tournament game
- The Shapley value for n-person games in generalized characteristic function form
- Tournament solutions and majority voting
- Value Theory Without Efficiency
- Values of Graph-Restricted Games
Cited in
(6)- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
- Introduction of measurement rules on the nodes of oriented structures by using concepts of game theory
- Improved Orientations of Physical Networks
- Accessibility and hyperbolicity
- Directed communication in games with directed graphs
- Efficient algorithms for game-theoretic betweenness centrality
This page was built for publication: Accessibility in oriented networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869605)
