Accessibility in oriented networks

DOI10.1016/j.ejor.2006.04.027zbMath1123.90008OpenAlexW2159000640MaRDI QIDQ869605

José Miguel Giménez, Antonio Magaña, Rafael Amer

Publication date: 8 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.027

zbMATH Keywords

accessibilitygame theorydigraphShapley valuecooperative game

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic network models in operations research (90B10)

Related Items (3)

Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games ⋮ Directed communication in games with directed graphs ⋮ Efficient algorithms for game-theoretic betweenness centrality

Cites Work

• Unnamed Item
• Games with permission structures: The conjunctive approach
• The bipartisan set of a tournament game
• The Shapley value for \(n\)-person games in generalized characteristic function form
• Tournament solutions and majority voting
• On values for generalized characteristic functions
• Digraph competitions and cooperative games
• Hierarchical organization structures and constraints on coalition formation
• A connectivity game for graphs
• Values of Graph-Restricted Games
• Value Theory Without Efficiency
• Graphs and Cooperation in Games

This page was built for publication: Accessibility in oriented networks