A Shapley distance in graphs

A new distance in finite graphs is defined through a game-theoretic approach. This distance arises when solving the problem about the fair cost, for a node in a graph, of attaining access to another node. The distance indicates the level of difficulty in the communication between any pair of nodes, on the understanding that the fewer paths there are between two nodes and the more nodes there are that form those paths, the greater the distance is.