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

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.