Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games

DOI10.1007/s00186-011-0378-xzbMath1266.91010OpenAlexW2042881129MaRDI QIDQ1935924

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

Publication date: 20 February 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-011-0378-x

zbMATH Keywords

accessibilitydigraphcooperative gamesemivalue

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (1)

Tournament solutions based on cooperative game theory

Cites Work

• Accessibility in oriented networks
• 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
• Axiomatization of a class of share functions for \(n\)-person games
• Digraph competitions and cooperative games
• Modification of semivalues for games with coalition structures
• Hierarchical organization structures and constraints on coalition formation
• The positional power of nodes in digraphs
• Power Indices in Spanning Connectivity Games
• Value Theory Without Efficiency
• Multilinear extensions and the banzhaf value

This page was built for publication: Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games