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

DOI10.1007/S00186-011-0378-XMaRDI QIDQ1935924zbMATH OpenOpenAlexFDO

Authors 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

accessibilitycooperative gamedigraphsemivalue

Mathematics Subject Classification ID

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

Review text

Using methods of cooperative game theory, accessibility measures for the nodes of directed graphs are constructed. Since digraphs without a predefined game are considered, the main part of the paper is devoted to establishing conditions on cooperative games that make it possible to measure accessibility. Games that satisfy desirable properties are called test games. Each ranking on the nodes is then obtained according to a pair formed by a test game and a solution defined on cooperative games whose utilities are given for ordered coalitions. The solutions proposed are extensions of the wide family of semivalues to games in generalized characteristic function form.

Recommendations

• Accessibility in oriented networks
• Values for games on the cycles of a digraph
• The Shapley value for directed graph games
• Introduction of measurement rules on the nodes of oriented structures by using concepts of game theory
• Digraph competitions and cooperative games

Cites work

• Accessibility in oriented networks
• Axiomatization of a class of share functions for \(n\)-person games
• Digraph competitions and cooperative games
• Games with permission structures: The conjunctive approach
• Hierarchical organization structures and constraints on coalition formation
• Modification of semivalues for games with coalition structures
• Multilinear extensions and the banzhaf value
• On values for generalized characteristic functions
• Power Indices in Spanning Connectivity Games
• The bipartisan set of a tournament game
• The positional power of nodes in digraphs
• The Shapley value for n-person games in generalized characteristic function form
• Tournament solutions and majority voting
• Value Theory Without Efficiency

Cited in

(6)

• Tournament solutions based on cooperative game theory
• The degree measure as utility function over positions in graphs and digraphs
• Introduction of measurement rules on the nodes of oriented structures by using concepts of game theory
• scientific article; zbMATH DE number 2171034 (Why is no real title available?)
• scientific article; zbMATH DE number 1892799 (Why is no real title available?)
• Accessibility in oriented networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935924)