The aim of this paper consists of constructing accessibility measures to the nodes of directed graphs using methods of Game Theory. Since digraphs without a predefined game are considered, the main part of the paper is devoted to establish conditions on cooperative games so that they can be used...

The introduction of a {0,1}-valued game associated to a connected graph allows us to assign to each vertex a value of weighted connectivity according to the different solutions that for cooperative games are obtained by means of semivalues. The marginal contributions of each vertex to the...