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.

[1]  Guillermo Owen,et al.  Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..

[2]  G. Owen,et al.  Games with permission structures: The conjunctive approach , 1992 .

[3]  Rafael Amer,et al.  Modification of Semivalues for Games with Coalition Structures , 2003 .

[4]  G. Bergantiños,et al.  On values for generalized characteristic functions , 1997 .

[5]  Rahul Savani,et al.  Power Indices in Spanning Connectivity Games , 2009, AAIM.

[6]  Rafael Amer,et al.  Accessibility in oriented networks , 2007, Eur. J. Oper. Res..

[7]  M. Breton,et al.  The Bipartisan Set of a Tournament Game , 1993 .

[8]  P. Jean-Jacques Herings,et al.  The positional power of nodes in digraphs , 2005, Soc. Choice Welf..

[9]  Teh-Hsing Wei,et al.  The algebraic foundations of ranking theory , 1952 .

[10]  L. Shapley.  A Value for n-person Games , 1988 .

[11]  G. Laan,et al.  Axiomatization of a class of share functions for n-person games , 1998 .

[12]  A. Nowak,et al.  The Shapley Value for n-Person Games in Generalized Characteristic Function Form , 1994 .

[13]  Peter Borm,et al.  Digraph Competitions and Cooperative Games , 2002 .

[14]  Jean-François Laslier,et al.  Tournament Solutions And Majority Voting , 1997 .

[15]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[16]  M. Kendall.  Further contributions to the theory of paired comparisons , 1955 .

[17]  Pradeep Dubey,et al.  Value Theory Without Efficiency , 1981, Math. Oper. Res..

[18]  Jean J. M. Derks,et al.  Hierarchical organization structures and constraints on coalition formation , 1995 .

[19]  G. Owen.  Multilinear extensions and the banzhaf value , 1975 .

[20]  A. Belianin,et al.  A Game-Theoretic Approach , 2001 .

[21]  Jeffrey S. Rosenschein,et al.  Computing the Banzhaf power index in network flow games , 2007, AAMAS '07.