Rights accessRestricted access - publisher's policy
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 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 on ordered coalitions. The solutions proposed
here are extensions of the wide family of semivalues to games in generalized
characteristic function form.
CitationAmer, R.; Giménez, J.; Magaña, A. Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games. "Mathematical methods of operations research", Febrer 2012, vol. 75, núm. 1, p. 105-134.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com