Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
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.
KeywordsGame theory Digraph Accessibility Cooperative game Semivalue
Mathematics Subject Classification (2000)91A12 91A43
Unable to display preview. Download preview PDF.
- Aziz H, Lachish O, Paterson M, Savani R (2009) Power indices in spanning connectivity games. In: Proceedings of algorithmic aspects in information and management, 5th international conference, AAIM 2009. Springer, Berlin, pp 55–67Google Scholar
- Bachrach Y, Rosenschein JS (2007) Computing the Banzhaf power index in network flow games. In: Proceedings of the 8th international conference on autonomous agents and multiagent systems, AAMAS, pp 335–341Google Scholar
- Banzhaf JF (1965) Weigthed voting doesn’t work: a mathematical analysis. Rutgers Law Rev 19: 317–343Google Scholar
- Giménez JM (2001) Contributions to the study of solutions for cooperative games (in Spanish). Ph.D. Thesis. Technical University of Catalonia, SpainGoogle Scholar
- Gómez D, et al (2001) Centrality and power in social networks. A game theoretic approach. In: Proceedings of the XXVI national congress of statistic and operations research, Úbeda, SpainGoogle Scholar
- Puente MA (2000) Contributions to the representability of simple games and to the calculus of solutions for this class of games (in Spanish). Ph.D. Thesis. Technical University of Catalonia, SpainGoogle Scholar
- Shapley LS (1953) A value for n-person games. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307–317Google Scholar
- Wei TH (1952) The algebraic foundations of ranking theory. Cambridge University Press, CambridgeGoogle Scholar