references.bib

@article{vorobev:liapounov:1998,
  title = {The proper Shapley value},
  author = {Vorob'ev, N. and A. Liapounov},
  journal = {Game Theory and Applications},
  year = {1998},
  volume = {4},
  pages = {155 - 159},
  publisher = {New York: Nova Science},
  series = {L. Petrosjan and M. Mazalove (Eds.)}
}
@article{Hendrickx:et:al:2009,
  title = {The \{VL\} control measure for symmetric networks },
  journal = {Social Networks },
  volume = {31},
  number = {1},
  pages = {85 - 91},
  year = {2009},
  note = {},
  issn = {0378-8733},
  doi = {http://dx.doi.org/10.1016/j.socnet.2008.10.004},
  url = {http://www.sciencedirect.com/science/article/pii/S0378873308000579},
  author = {Ruud Hendrickx and Peter Borm and René Van den Brink and Guillermo Owen},
  keywords = {Network},
  keywords = {Control measure},
  keywords = {Search probabilities},
  keywords = {Cooperative network game},
  keywords = {Proper Shapley value},
  keywords = {Matrix search game }
}
@book{Behzad:1979,
  title = {Graphs \& digraphs},
  author = {Behzad, M. and Gary Chartrand and Lesniak, L.},
  isbn = {9780871502612},
  lccn = {78011171},
  series = {Prindle, Weber \& Schmidt international series},
  url = {http://books.google.co.uk/books?id=P-3uAAAAMAAJ},
  year = {1979},
  publisher = {Prindle, Weber \& Schmidt}
}
@article{Brink:Gilles:2000,
  title = {Measuring domination in directed networks },
  journal = {Social Networks },
  volume = {22},
  number = {2},
  pages = {141 - 157},
  year = {2000},
  note = {},
  issn = {0378-8733},
  doi = {http://dx.doi.org/10.1016/S0378-8733(00)00019-8},
  url = {http://www.sciencedirect.com/science/article/pii/S0378873300000198},
  author = {René van den Brink and Robert P. Gilles}
}
@techreport{Brink:Borm:1994,
  title = {Digraph competitions and cooperative games},
  author = {Brink, J.R. van den and Borm, Peter},
  year = {1994},
  institution = {Tilburg University, Center for Economic Research},
  type = {Discussion Paper},
  number = {1994-24},
  url = {http://EconPapers.repec.org/RePEc:dgr:kubcen:199424}
}
@article{Brink:Borm:2002,
  title = {Digraph Competitions and Cooperative Games},
  author = {van den Brink, Rene and Borm, Peter},
  year = {2002},
  journal = {Theory and Decision},
  volume = {53},
  number = {4},
  pages = {327-342},
  keywords = {Digraph competition; cooperative TU-game; Shapley value; core; marginal vector; selectope vector; simple score vector},
  url = {http://EconPapers.repec.org/RePEc:kap:theord:v:53:y:2002:i:4:p:327-342}
}
@article{Bollen:et:al:2005,
  author = {J. Bollen and
               H. V. Sompel and
               J. A. Smith and
               R. Luce},
  title = {Toward alternative metrics of journal impact: A comparison
               of download and citation data},
  journal = {CoRR},
  volume = {abs/cs/0503007},
  year = {2005}
}
@article{Boldi:Vigna:2013,
  author = {P. Boldi and
               S. Vigna},
  title = {Axioms for Centrality},
  journal = {CoRR},
  volume = {abs/1308.2140},
  year = {2013}
}
@article{Newman:2004,
  author = {Newman, M. E. J.},
  journal = {Phys. Rev. E},
  number = 5,
  numpages = {9},
  pages = 056131,
  title = {Analysis of weighted networks},
  volume = 70,
  year = 2004
}
@book{Welsh:1997,
  booktitle = {Surveys in Combinatorics},
  title = {Approximate counting},
  author = {Welsh, D.J.A.},
  year = {1997},
  pages = {287-324},
  volume = {241}
}
@article{szczepanski:tarkowski:et:al:2014,
  title = {Efficient Computation of Semivalues for Game-Theoretic Network Centrality},
  year = {2014},
  journal = {AAAI},
  author = {P. L. Szczepa\'{n}ski and M. K. Tarkowski and T. P. Michalak and P. Harrenstein and M. Wooldridge}
}
@book{harsanyi:1958,
  title = {A Bargaining Model for the Cooperative N-person Game},
  author = {Harsanyi, J.C.},
  url = {http://books.google.co.uk/books?id=ZLMUAAAAIAAJ},
  year = {1958},
  publisher = {Department of Economics, Stanford University.}
}
@book{Pruzhansky:2005,
  title = {Topics in game theory},
  author = {Pruzhansky, V.},
  isbn = {9789051708257},
  series = {Tinbergen Institute research series},
  url = {http://books.google.co.uk/books?id=MUHpjUTAxxYC},
  year = {2005},
  publisher = {Thela Thesis}
}
@article{Macho-Stadler:et:al:2010,
  year = {2010},
  issn = {0020-7276},
  journal = {International Journal of Game Theory},
  volume = {39},
  number = {1-2},
  doi = {10.1007/s00182-009-0207-0},
  title = {Dividends and weighted values in games with externalities},
  url = {http://dx.doi.org/10.1007/s00182-009-0207-0},
  publisher = {Springer-Verlag},
  keywords = {Games with externalities; Sharing rules; Dividends; D62; C71},
  author = {Macho-Stadler, Inés and Pérez-Castrillo, David and Wettstein, David},
  pages = {177-184},
  language = {English}
}
@book{Brandes:Erlebach:2005,
  author = {Brandes, Ulrik and Erlebach, Thomas},
  title = {Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)},
  year = {2005},
  isbn = {3540249796},
  publisher = {Springer-Verlag New York, Inc.},
  address = {Secaucus, NJ, USA}
}
@article{Meessen:1988,
  author = {Meessen, R.},
  title = {Communication games},
  year = {1988},
  journal = {Master's thesis, Department of Mathematics, University of Mijmegen, The Netherlands}
}
@article{Borm:et:al:1992,
  author = {Borm, P. and Owen, G. and Tijs, S.},
  title = {On the Position Value for Communication Situations},
  journal = {SIAM Journal on Discrete Mathematics},
  volume = {5},
  number = {3},
  pages = {305-320},
  year = {1992},
  doi = {10.1137/0405023},
  url = { 
        http://dx.doi.org/10.1137/0405023
    
},
  eprint = { 
        http://dx.doi.org/10.1137/0405023
    
}
}
@article{Sanchez:Bergantinos:1997,
  year = {1997},
  issn = {0171-6468},
  journal = {Operations-Research-Spektrum},
  volume = {19},
  number = {3},
  doi = {10.1007/BF01545593},
  title = {On values for generalized characteristic functions},
  url = {http://dx.doi.org/10.1007/BF01545593},
  publisher = {Springer-Verlag},
  keywords = {Cooperative games; Game-theoretic models; Kooperative Spiele; Spieltheoretische Modelle},
  author = {Sanchez, Estela and Bergantiños, Gustavo},
  pages = {229-234},
  language = {English}
}
@article{Nowak:Radzik:1994,
  title = {The Shapley Value for n-Person Games in Generalized Characteristic Function Form },
  journal = {Games and Economic Behavior },
  volume = {6},
  number = {1},
  pages = {150 - 161},
  year = {1994},
  note = {},
  issn = {0899-8256},
  doi = {http://dx.doi.org/10.1006/game.1994.1008},
  url = {http://www.sciencedirect.com/science/article/pii/S0899825684710086},
  author = {Andrzej S. Nowak and Tadeusz Radzik}
}
@article{Shapley:1971,
  year = {1971},
  issn = {0020-7276},
  journal = {International Journal of Game Theory},
  volume = {1},
  number = {1},
  doi = {10.1007/BF01753431},
  title = {Cores of convex games},
  url = {http://dx.doi.org/10.1007/BF01753431},
  publisher = {Physica-Verlag},
  author = {Shapley, LloydS.},
  pages = {11-26},
  language = {English}
}
@article{NONLINEAR:PROGRAMMING,
  year = {1995},
  issn = {0025-5610},
  journal = {Mathematical Programming},
  volume = {69},
  number = {1-3},
  doi = {10.1007/BF01585569},
  title = {The complexity of approximating a nonlinear program},
  url = {http://dx.doi.org/10.1007/BF01585569},
  publisher = {Springer-Verlag},
  keywords = {Approximation; Optimization; Probabilistically checkable proofs; Quadratic programming; Nonlinear programming},
  author = {Bellare, Mihir and Rogaway, Phillip},
  pages = {429-441},
  language = {English}
}
@unpublished{Szczepanski:et:al:2014:b,
  author = {P.L. Szczepanski and T.P. Michalak and T. Rahwan},
  title = {A Game-Theoretic Measure of Betweenness Centrality},
  year = {2014},
  note = {\textit{mimeo}, University of Oxford}
}
@article{Kim:Tackseung:2008,
  title = {Connectivity and Allocation Rule in a Directed Network},
  author = {Kim, Jeong-Yoo and Tackseung, Jun},
  year = {2008},
  journal = {The B.E. Journal of Theoretical Economics},
  volume = {8},
  number = {1},
  pages = {1-21},
  abstract = {We introduce a new notion of connectivity, what we call weak connectivity, in a directed network where communication is one-way, and show that weak connectivity is equivalent to the usual concept of connectivity if the outdegree of each node is at most one, referred as the [DC] condition. Based on weak connectivity, we define an allocation rule in a directed network by applying the Shapley value type of consideration. We show that the allocation rule is the unique allocation rule satisfying component efficiency and equal bargaining power under the [DC] condition. If the [DC] condition does not hold, it fails to satisfy component efficiency, but can be shown to be the only allocation rule that satisfies equal bargaining power and quasi-component efficiency which is a weaker property.},
  url = {http://EconPapers.repec.org/RePEc:bpj:bejtec:v:8:y:2008:i:1:n:19}
}
@inproceedings{Belau:2014,
  title = {Consequences of Connection Failure - Centrality and the Importance for Cohesion},
  author = {Julia Belau},
  booktitle = {Public Choice Society},
  year = {2014}
}
@inproceedings{Narayanam:et:al:2014,
  title = {A Shapley Value-based Approach to Determine Gatekeepers in Social Networks with Applications},
  author = {R. Narayanam and O. Skibski and H. Lamba and  T.P. Michalak},
  year = {2014},
  booktitle = {ECAI'14: Proceedings of the 21st European Conference on Artificial Intelligence},
  pages = {forthcoming}
}
@inproceedings{Szczepanski:et:al:2014,
  title = {A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value},
  author = {P.L. Szczepanski and T.P. Michalak and M. Wooldridge},
  year = {2014},
  booktitle = {ECAI'14: Proceedings of the 21st European Conference on Artificial Intelligence},
  pages = {forthcoming}
}
@inproceedings{Matejczyk:et:al:2014,
  title = {How good is the Shapley Value-based approach to the influence maximization problem?(extended abstract)},
  author = {S. Matejczyk and K. Adamczewski and  T.P. Michalak},
  year = {2014},
  booktitle = {ECAI'14: Proceedings of the 21st European Conference on Artificial Intelligence},
  pages = {forthcoming}
}
@article{Algaba:et:al:2007,
  title = {Algorithms for computing the Myerson value by dividends},
  author = {Algaba, E and Bilbao, JM and Fern{\'a}ndez, JR and Jim{\'e}nez, N and L{\'o}pez, JJ},
  journal = {Discrete Mathematics Research Progress},
  pages = {1--13},
  year = {2007},
  publisher = {Citeseer}
}
@inbook{Koschutzki:et:al:2005,
  author = {Kosch\"{u}tzki, D. and Lehmann, K.A. and Peeters, L. and Richter, S. and Tenfelde-Podehl, D. and Zlotowski, O.},
  title = {Centrality indices. Network analysis},
  publisher = {Springer},
  pages = {16--61},
  year = {2005},
  series = {{Lecture Notes in Computer Science}},
  volume = {3418}
}
@article{Gomez:et:al:2003,
  title = {Centrality and power in social networks: a game theoretic approach },
  journal = {Mathematical Social Sciences },
  volume = {46},
  number = {1},
  pages = {27 - 54},
  year = {2003},
  note = {},
  issn = {0165-4896},
  doi = {http://dx.doi.org/10.1016/S0165-4896(03)00028-3},
  url = {http://www.sciencedirect.com/science/article/pii/S0165489603000283},
  author = {Daniel G\'{o}mez and Enrique Gonz\'{a}lez-Arang\"{u}ena and Conrado Manuel and Guillermo Owen and Mónica del Pozo and Juan Tejada},
  keywords = {Social networks},
  keywords = {Game theory},
  keywords = {Centrality},
  keywords = {Shapley value }
}
@article{Adler:2001,
  title = {Evaluation of deregulated airline networks using data envelopment analysis combined with principal component analysis with an application to Western Europe },
  journal = {European Journal of Operational Research },
  volume = {132},
  number = {2},
  pages = {260 - 273},
  year = {2001},
  note = {Data Envelopment Analysis },
  issn = {0377-2217},
  doi = {http://dx.doi.org/10.1016/S0377-2217(00)00150-8},
  url = {http://www.sciencedirect.com/science/article/pii/S0377221700001508},
  author = {Nicole Adler and Boaz Golany},
  keywords = {Data envelopment analysis},
  keywords = {Principal component analysis},
  keywords = {Air transportation networks }
}
@article{Dezso:Barabasi:2002,
  title = {Halting viruses in scale-free networks},
  author = {Dezs\ifmmode \mbox{\H{o}}\else \H{o}\fi{}, Zolt\'an and Barab\'asi, Albert-L\'aszl\'o},
  journal = {Phys. Rev. E},
  volume = {65},
  issue = {5},
  pages = {055103},
  numpages = {4},
  year = {2002},
  month = {May},
  publisher = {American Physical Society},
  doi = {10.1103/PhysRevE.65.055103},
  url = {http://link.aps.org/doi/10.1103/PhysRevE.65.055103}
}
@article{Calvo:Armengol:2001,
  title = {Bargaining power in communication networks },
  journal = {Mathematical Social Sciences },
  volume = {41},
  number = {1},
  pages = {69 - 87},
  year = {2001},
  note = {},
  issn = {0165-4896},
  doi = {http://dx.doi.org/10.1016/S0165-4896(00)00049-4},
  url = {http://www.sciencedirect.com/science/article/pii/S0165489600000494},
  author = {Antoni Calv\'{o}-Armengol},
  keywords = {Communication},
  keywords = {Network},
  keywords = {Graph},
  keywords = {Noncooperative bargaining},
  keywords = {Bargaining power }
}
@article{keinan:2004,
  title = {Casual localization of neural function: the Shapley value method},
  journal = {Neurocomputing},
  volume = {58-60},
  number = {0},
  pages = {215--222},
  year = {2004},
  author = {Alon Keinan and Claus C. Hilgetag and Isaac Meilijson and Eytan Ruppin}
}
@article{Amer:Gimenez:2010,
  year = {2012},
  issn = {1432-2994},
  journal = {Mathematical Methods of Operations Research},
  volume = {75},
  number = {1},
  doi = {10.1007/s00186-011-0378-x},
  title = {Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games},
  url = {http://dx.doi.org/10.1007/s00186-011-0378-x},
  publisher = {Springer-Verlag},
  keywords = {Game theory; Digraph; Accessibility; Cooperative game; Semivalue; 91A12; 91A43},
  author = {Amer, Rafael and Gim\'{e}nez, Jos\'{e} Miguel and Maga{\~n}a, Antonio},
  pages = {105-134},
  language = {English}
}
@article{Amer:Gimenez:2007,
  title = {Accessibility in oriented networks },
  journal = {European Journal of Operational Research },
  volume = {180},
  number = {2},
  pages = {700 - 712},
  year = {2007},
  note = {},
  issn = {0377-2217},
  doi = {http://dx.doi.org/10.1016/j.ejor.2006.04.027},
  url = {http://www.sciencedirect.com/science/article/pii/S037722170600316X},
  author = {Rafael Amer and Jos\'{e} Miguel Gim\'{e}nez and Antonio Maga{\~n}a},
  keywords = {Game theory},
  keywords = {Digraph},
  keywords = {Accessibility},
  keywords = {Cooperative game},
  keywords = {Shapley value }
}
@article{Amer:Gimenez:2004,
  author = {Amer, Rafael and Gim{\'e}nez, Jos{\'e} Miguel},
  journal = {Math. Meth. of OR},
  keywords = {dblp},
  number = 3,
  pages = {453-470},
  title = {A connectivity game for graphs.},
  volume = 60,
  year = 2004
}
@article{Grofman:Owen:1982,
  author = {B. Grofman and Guillermo Owen},
  journal = {Social Networks},
  pages = {213--224},
  title = {A game-theoretic approach to measuring centrality in social networks},
  volume = {4},
  year = {1982}
}
@article{Banzhaf:1965,
  author = {Banzhaf, J. F.},
  journal = {Rutgers Law Review},
  pages = {317--343},
  title = {{Weighted Voting Doesn't Work: A Mathematical Analysis}},
  volume = {19},
  year = {1965}
}
@inproceedings{Szczepanski:et:al:2012,
  title = {A New Approach to Betweenness Centrality Based on the Shapley Value},
  author = {P. L. Szczepa\'{n}ski and T.P. Michalak and T. Rahwan},
  year = {2012},
  booktitle = {AAMAS '12: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems},
  pages = {239--246}
}
@article{Gomez:et:al:2008,
  title = {A value for generalized probabilistic communication situations},
  author = {G{\'o}mez, D. and Gonz{\'a}lez-Aranguena, E. and Manuel, C. and Owen, G.},
  year = {2008},
  journal = {European Journal of Operational Research},
  volume = {190},
  number = {2},
  pages = {539-556}
}
@article{Albert:et:al:2000,
  author = {Albert, R. and Jeong, H. and Barabasi, A.L.},
  journal = {Nature},
  number = 6794,
  pages = {378--382},
  publisher = {Nature Publishing Group},
  title = {{Error and attack tolerance of complex networks}},
  volume = 406,
  year = 2000
}
@article{Guimer:et:al:2009,
  author = {Guimer{\`a}, R. and Danon, L. and Diaz-Guilera, A. and Giralt, F. and Arenas, A.},
  journal = {Physical Review E},
  number = 065103,
  title = {Self-similar community structure in a network of human interactions},
  volume = {68},
  year = 2003
}
@article{Young:1985,
  year = {1985},
  journal = {International Journal of Game Theory},
  volume = {14},
  number = {2},
  title = {Monotonic solutions of cooperative games},
  author = {Young, H.P.},
  pages = {65--72}
}
@article{Lindelauf:et:al:2013,
  author = {Lindelauf, R. and Hamers, H. and Husslage, B.},
  journal = {European Journal of Operational Research},
  number = 1,
  pages = {230--238},
  title = {Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda.},
  volume = 229,
  year = 2013
}
@misc{Anthonisse:1971,
  title = {The rush in a directed graph.},
  year = {1971},
  note = {Tech. Rep. BN 9/71},
  author = {J.M. Anthonisse},
  publisher = {Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam}
}
@article{Cuzzocrea:et:al:2012,
  title = {Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks },
  journal = {Journal of Network and Computer Applications },
  volume = {35},
  number = {4},
  pages = {1210 --1217},
  year = {2012},
  author = {A. Cuzzocrea and A. Papadimitriou and D. Katsaros and Y. Manolopoulos}
}
@article{Puzis:et:al:2009,
  author = { Puzis, R. and Yagil, D. and Elovici, Y. and Braha, D.},
  title = {{ Collaborative attack on internet users' anonymity }},
  year = {2009},
  journal = {Internet Research},
  volume = {19},
  number = {1},
  pages = {60-77}
}
@inproceedings{Skibski:et:al:2014,
  title = {Algorithms for the Shapley and Myerson Values in Graph-restricted Games},
  author = {O. Skibski and  T.P. Michalak and T. Rahwan and M. Wooldridge},
  year = {2014},
  booktitle = {Proc. of the AAMAS}
}
@article{Brin:Page:1998,
  author = {Brin, S. and Page, L.},
  title = {The anatomy of a large-scale hypertextual Web search engine},
  journal = {Comput. Netw. ISDN Syst.},
  volume = {30},
  number = {1-7},
  year = {1998},
  pages = {107--117}
}
@book{Maschler:et:el:2013,
  title = {Game Theory},
  author = {Maschler, M. and E. Solan and S. Zamir},
  year = {2013},
  publisher = {CUP}
}
@article{Latora:Marchiori:2007,
  author = {V. Latora and M. Marchiori},
  title = {A measure of centrality based on network efficiency},
  journal = {New Journal of Physics},
  volume = {9},
  number = {6},
  pages = {188},
  year = {2007}
}
@article{Dolev:et:al:2010,
  author = {Dolev, Shlomi and Elovici, Yuval and Puzis, Rami},
  title = {Routing Betweenness Centrality},
  journal = {J. ACM},
  issue_date = {April 2010},
  volume = {57},
  number = {4},
  month = may,
  year = {2010},
  pages = {25:1--25:27},
  articleno = {25},
  numpages = {27},
  publisher = {ACM}
}
@inproceedings{Li:et:al:2011,
  author = {Li, Pei and Yu, Jeffrey Xu and Liu, Hongyan and He, Jun and Du, Xiaoyong},
  biburl = {http://www.bibsonomy.org/bibtex/25445c67e4759bba12f5bbbddfec8af57/dblp},
  booktitle = {PAKDD (2)},
  editor = {Huang, Joshua Zhexue and Cao, Longbing and Srivastava, Jaideep},
  pages = {407-419},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Ranking Individuals and Groups by Influence Propagation.},
  volume = 6635,
  year = 2011
}
@article{Sanchez:Bergantinos:1999,
  author = {S{\'a}nchez, Estela and Bergantin\~{n}os, Gustavo},
  title = {Coalitional values and generalized characteristic functions},
  journal = {Math. Methods of OR},
  volume = {49},
  year = {1999},
  number = {3},
  pages = {413--433},
  issn = {1432-2994}
}
@article{Bonacich:1972,
  title = {{Factoring and weighting approaches to status scores and clique identification}},
  author = {Bonacich, P.},
  journal = {Journal of Mathematical Sociology},
  volume = {2},
  number = {1},
  pages = {113--120},
  year = {1972}
}
@incollection{Monderer:Samet:2002,
  title = {Variations on the shapley value},
  author = {Monderer, D. and Samet, D.},
  year = {2002},
  chapter = {54},
  pages = {2055--2076},
  booktitle = {Handbook of Game Theory with Economic Applications},
  editor = {Aumann, R.J. and Hart, S.},
  volume = {3},
  edition = {1},
  publisher = {Elsevier}
}
@article{Friedkin:1991,
  title = {Theoretical foundations for centrality measures},
  volume = {96},
  number = {6},
  journal = {American Journal of Sociology},
  author = {Friedkin, N.E.},
  year = {1991},
  pages = {1478–-1504}
}
@article{Castro:et:al:2009,
  title = {Polynomial calculation of the Shapley value based on sampling},
  volume = {36},
  number = {5},
  journal = {Computers \& Operations Research},
  publisher = {Elsevier},
  author = {Castro, J. and Gomez, D. and Tejada, J.},
  year = {2009},
  pages = {1726--1730}
}
@article{Puzis:et:al:2007b,
  author = {Puzis, R. and Elovici, Y. and Dolev, S.},
  title = {Finding the most prominent group in complex networks},
  journal = {AI Communication},
  volume = {20},
  number = {4},
  month = dec,
  year = {2007},
  issn = {0921-7126},
  pages = {287--296},
  publisher = {IOS Press}
}
@incollection{Owen:1977,
  author = {Owen, G.},
  booktitle = {Mathematical economics and game theory: {Essays} in honor of {Oskar Morgenstern}},
  pages = {76--88},
  publisher = {Springer},
  series = {Lecture Notes in Economics and Mathematical Systems},
  title = {{Values of games with a priori unions}},
  volume = {141},
  year = {1977}
}
@article{Callaway:et:al:2000,
  author = {Callaway, D. S. and Newman, M. E. J. and Strogatz, S. H. and Watts, D. J.},
  journal = {Physical Review Letters},
  number = {25},
  pages = {5468--5471},
  publisher = {American Physical Society},
  title = {{Network Robustness and Fragility: Percolation on Random Graphs}},
  volume = {85},
  year = {2000}
}
@article{Holme:et:al:2002,
  author = {Holme, P. and Kim, B. J. and Yoon, C. N. and Han, S. K.},
  journal = {Physical Review E},
  number = 5,
  numpages = {14},
  pages = 056109,
  publisher = {American Physical Society},
  title = {Attack vulnerability of complex networks},
  volume = 65,
  year = 2002
}
@article{del:Pozo:2011,
  title = {Centrality in directed social networks. A game theoretic approach},
  journal = {Social Networks},
  volume = {33},
  number = {3},
  pages = {191 -- 200},
  year = {2011},
  issn = {0378-8733},
  author = {M. del Pozo and C. Manuel and E. Gonz\'{a}lez-Arang\"{u}ena and G. Owen}
}
@article{Puzis:et:al:2007,
  author = {Puzis, Rami and Elovici, Yuval and Dolev, Shlomi},
  journal = {Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)},
  number = {5},
  publisher = {APS},
  title = {{Fast algorithm for successive computation of group betweenness centrality}},
  volume = {76},
  year = {2007}
}
@article{Kolaczyk:et:al:2009,
  author = {Kolaczyk, E. D. and Chua, D. B. and Barth\'{e}lemy, M.},
  issn = {03788733},
  journal = {Social Networks},
  number = {3},
  pages = {190--203},
  title = {{Group betweenness and co-betweenness: Inter-related notions of coalition centrality}},
  volume = {31},
  year = {2009}
}
@article{Girvan:Newman:2002,
  author = {Girvan, M. and Newman, M. E.},
  journal = {Proceedings of the National Academy of Sciences of the United States of America},
  month = jun,
  number = {12},
  pages = {7821--7826},
  publisher = {National Academy of Sciences},
  title = {{Community structure in social and biological networks.}},
  volume = {99},
  year = {2002}
}
@article{Goh:et:al:2001,
  author = {Goh, K. I. and Kahng, B. and Kim, D.},
  journal = {Physical Review Letters},
  pages = {278701+},
  title = {{Universal Behaviour of Load Distribution in Scale-free Networks}},
  volume = {87},
  year = {2001}
}
@article{Freeman:1979,
  title = {{Centrality in social networks: Conceptual clarification}},
  author = {Freeman, L.C.},
  journal = {Social Networks},
  volume = {1},
  number = {3},
  pages = {215--239},
  year = {1979}
}
@article{Porta:et:al:2006,
  author = {Porta, S. and Crucitti, P. and Latora, V.},
  title = {{The network analysis of urban streets: a primal approach}},
  year = {2006},
  journal = {Environment and Planning B: Planning and Design},
  volume = {33},
  number = {5},
  pages = {705--725}
}
@article{Bork:et:al:2004,
  author = {Bork, P. and Jensen, L. J. and Mering, von C.  and Ramani, A. K. and Lee, I. and Marcott, E. M.},
  title = {{Protein interaction networks from yeast to huma}},
  year = {2004},
  journal = {Curr. Opin. Struct. Biol.},
  volume = {14},
  number = {3},
  pages = {292--299}
}
@inproceedings{Brandes:Fleischer:2005,
  author = {Brandes, U. and Fleischer, D.},
  booktitle = {STACS},
  editor = {Diekert, Volker and Durand, Bruno},
  pages = {533-544},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Centrality Measures Based on Current Flow},
  volume = 3404,
  year = 2005
}
@article{Brandes:2008,
  author = { Brandes, U. },
  title = {{ On variants of shortest-path betweenness centrality and their generic computation }},
  year = {2008},
  journal = {Social Networks},
  volume = {30},
  number = {2},
  pages = {136--145}
}
@article{Barabasi:Albert:1999,
  title = {Emergence of scaling in random networks},
  author = {Barab{\'a}si, A.-L. and Albert, R.},
  journal = {Science},
  volume = {286},
  number = {5439},
  pages = {509--512},
  year = {1999}
}
@article{Faloutsos:et:al:1999,
  author = {Faloutsos, M. and Faloutsos, P. and Faloutsos C.},
  title = {{On power-law relationships of the internet topology}},
  year = {1999},
  journal = {ACM SIGCOMM Computer Communication Review},
  volume = {29},
  number = {4},
  pages = {251--262}
}
@article{Yook:et:al:2002,
  author = {Yook, S. -H. and Jeong, H. and Barabasi, A.-L. },
  title = {{ Modeling the internet's large-scale topology}},
  year = {2002},
  journal = {Proceedings of the National Academy of Science},
  volume = {99},
  number = {21},
  pages = {13382--13386}
}
@book{Wasserman:Faust:1994,
  author = {Wasserman, S. and Faust, K.},
  title = {Social network analysis: Methods and applications},
  year = {1994},
  publisher = {England: Cambridge University Press.}
}
@article{Barthelemy:2004,
  author = {Barthelemy, M.},
  title = {{ Betweenness centrality in large complex networks}},
  year = {2004},
  journal = {The European Physical Journal B - Condensed Matter},
  volume = {38},
  number = {2},
  pages = {163--168}
}
@article{Bollobas:Riordan:2003,
  author = { Bollobas, B. and Riordan, O.},
  title = {{ Robustness and vulnerability of scale-free random graphs }},
  year = {2003},
  journal = {Internet Mathematics},
  volume = {1},
  number = {1},
  pages = {1--35}
}
@article{Pastor:Vespignani:2002,
  author = { Pastor-Satorras, R. and Vespignani, A.},
  title = {{ Immunization of complex networks }},
  year = {2002},
  journal = {Physical Review E},
  volume = { 65:036104}
}
@article{Everett:Borgatti:1999,
  author = { Everett,  M. G. and Borgatti, S. P. },
  title = {{ The centrality of groups and classes }},
  year = {1999},
  journal = {Journal of Mathematical Sociology},
  volume = {23},
  number = {3},
  pages = {181--201}
}
@incollection{Shapley:1953,
  author = {Shapley, L. S.},
  booktitle = {In Contributions to the Theory of Games, volume II},
  title = {A Value for n-person Games},
  editor = {H.W. Kuhn and A.W. Tucker},
  pages = {307--317},
  publisher = {Princeton University Press},
  year = {1953}
}
@article{Michalak:et:al:2013,
  title = {Efficient computation of the Shapley value for game-theoretic network centrality},
  author = {Michalak, P. T.  and K. V. Aaditha and P. L. Szczepanski and B. Ravindran  and N. R. Jennings},
  year = {2013},
  journal = {Journal of Artificial Intelligence Research},
  volume = {46},
  pages = {607--650}
}
@article{Michalak:et:al:2013b,
  title = {Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks},
  author = {T. P. Michalak and T. Rahwan and P. L. Szczepanski and O. Skibski and R. Narayanam and M. J. Wooldridge and N. R. Jennings},
  journal = {IJCAI},
  year = {2013}
}
@article{Brandes:2001,
  title = {{A faster algorithm for betweenness centrality}},
  author = {Brandes, U.},
  journal = {Journal of Mathematical Sociology},
  volume = {25},
  number = {2},
  pages = {163--177},
  year = {2001}
}
@article{Borgatti:Everett:2006,
  author = { Borgatti, S. P. and Everett,  M. G.},
  title = {{ A Graph-theoretic perspective on centrality }},
  year = {2006},
  journal = {Social Networks},
  volume = {28},
  number = {4},
  pages = {466--484}
}
@article{Everett:Borgatti:2005,
  author = {Everett, Martin and Borgatti, Stephen P.},
  issn = {03788733},
  journal = {Social Networks},
  number = {1},
  pages = {31--38},
  publisher = {Elsevier B.V.},
  title = {{Ego network betweenness}},
  volume = {27},
  year = {2005}
}
@article{Shimbel:1953,
  author = { Shimbel, A. },
  title = {{ Structural parameters of communication networks }},
  year = {1953},
  journal = {The Bulletin of Mathematical Biophysics},
  volume = {15},
  pages = {501--507}
}
@article{Freeman:1991,
  author = {Freeman, L.},
  issn = {03788733},
  journal = {Social Networks},
  number = {2},
  pages = {141--154},
  title = {{Centrality in valued graphs: A measure of betweenness based on network flow}},
  volume = {13},
  year = {1991}
}
@article{Newman:2005,
  author = {M. E. J. Newman},
  title = {A measure of betweenness centrality based on random walks},
  journal = {Social Networks},
  year = {2005},
  volume = {13},
  pages = {141--154},
  number = {2}
}
@inproceedings{Adali:et:al:2012,
  author = {Adali, Sibel and Lu, Xiaohui and Magdon-Ismail, Malik},
  title = {Attentive Betweenness Centrality (ABC): Considering Options and Bandwidth When Measuring Criticality},
  booktitle = {SOCIALCOM-PASSAT '12: Proceedings of the 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust},
  year = {2012},
  isbn = {978-0-7695-4848-7},
  pages = {358--367},
  numpages = {10},
  publisher = {IEEE Computer Society},
  address = {Washington, DC, USA}
}
@article{Myerson:1977,
  title = {Graphs and cooperation in games},
  author = {Myerson, R.B.},
  year = {1977},
  journal = {Mathematics of Operations Research},
  number = {3},
  volume = {2},
  pages = {225--229}
}
@article{Suri:Narahari:2010,
  author = {Suri, N.R. and Narahari, Y.},
  title = {{A Shapley Value based approach to discover influential nodes in social networks}},
  journal = {IEEE Transactions on Automation Science and Engineering},
  volume = {99},
  pages = {1--18},
  year = {2010}
}
@article{hagecc,
  author = { Hage, P. and Harary, F. },
  title = {{ Eccentricity and centrality in networks. }},
  year = {1995},
  journal = {Social Networks},
  volume = {17},
  pages = {57-63}
}
@inproceedings{gutrea,
  title = {{Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks}},
  author = {Gutman, R. J.},
  booktitle = {{In Proceedings of the 6th Workshop on Algorithm Engineering and Experiments}},
  pages = {100-111},
  year = {2004},
  publisher = {SIAM}
}
@inproceedings{Weerdt:Zhang:2008,
  author = {Mathijs M. de Weerdt and Yingqian Zhang},
  title = {Preventing Under-Reporting in Social Task Allocation},
  booktitle = {Proceedings of the 10th workshop on Agent-Mediated
Electronic Commerce (AMEC-X)},
  publisher = {IFAAMAS},
  year = {2008},
  editor = {Han La Poutre and Onn Shehory},
  url = {http://www.st.ewi.tudelft.nl/\%7Emathijs/publications/amec08.pdf},
  project = {Veni_Weerdt},
  group = {ALG}
}
@inproceedings{Baba:et:al:2010,
  author = {Satomi Baba and
               Atsushi Iwasaki and
               Makoto Yokoo and
               Marius-Calin Silaghi and
               Katsutoshi Hirayama and
               Toshihiro Matsui},
  title = {Cooperative problem solving against adversary: quantified
               distributed constraint satisfaction problem},
  booktitle = {AAMAS},
  year = {2010},
  pages = {781-788}
}
@article{puzcol,
  author = { Puzis, R. and Yagil, D. and Elovici, Y. and Braha, D.},
  title = {{ Collaborative attack on internet users' anonymity }},
  year = {2009},
  journal = {Internet Research},
  volume = {19},
  number = {1},
  pages = {60-77}
}
@article{Kempe05influentialnodes,
  title = {{Influential nodes in a diffusion model for social networks}},
  author = {Kempe, D. and Kleinberg, J. and Tardos, {\'E}.},
  journal = {Automata, Languages and Programming},
  year = {2005}
}
@article{Deng:Papdimitriou94,
  author = {Deng, X. and Papadimitriou, C.},
  year = {1994},
  title = {{On the complexity of cooperative solution concepts}},
  journal = {Mathematics of Operations Research},
  volume = {19},
  number = {2},
  pages = {257--266}
}
@article{closeness,
  author = {Beauchamp, M.A},
  title = {An improved index of centrality},
  journal = {Behavioral Science},
  year = {1965},
  volume = {10},
  number = {2},
  pages = {161--163}
}
@article{Valente199669,
  title = {{Social network thresholds in the diffusion of innovations}},
  journal = {Social Networks},
  year = {1996},
  author = {Valente, T.W.},
  volume = {18},
  number = {1},
  pages = {69--89}
}
@article{newman2001scientific,
  title = {{Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality}},
  author = {Newman, M.E.J.},
  journal = {Physical Review E},
  year = {2001},
  volume = {64},
  number = {1},
  pages = {016132(1-7)}
}
@article{dijkstra1959note,
  title = {{A note on two problems in connexion with graphs}},
  author = {Dijkstra, E.W.},
  journal = {Numerische Mathematik},
  volume = {1},
  number = {1},
  pages = {269--271},
  year = {1959}
}
@article{granovetter1978threshold,
  title = {{Threshold models of collective behavior}},
  author = {Granovetter, M.},
  journal = {American Journal of Sociology},
  volume = {83},
  number = {6},
  pages = {1420--1443},
  year = {1978}
}
@article{Faigle:1989,
  author = {Faigle, U.},
  title = {Cores of games with restricted cooperation},
  journal = {Mathematical Methods of Operations Research},
  volume = {33},
  number = {6},
  pages = {405--422},
  year = {1989}
}
@article{Bilbao:Edelman:2000,
  author = {Bilbao, J.M. and Edelman, P.H.},
  title = {{The Shapley Value on convex geometries}},
  journal = {Discrete Applied Mathematics},
  volume = {103},
  number = {1-3},
  year = {2000},
  pages = {33--40}
}
@article{Algaba:et:al:2004,
  title = {{Cooperative games on antimatroids}},
  author = {Algaba, E. and Bilbao, J.M. and van den Brink, R. and Jim{\'e}nez-Losada, A.},
  journal = {Discrete Mathematics},
  volume = {282},
  number = {1-3},
  pages = {1--15},
  year = {2004}
}
@article{Bilbao:2009,
  title = {{Axiomatizations of the Shapley Value for games on augmenting systems}},
  author = {Bilbao, J.M. and Ord{\'o}{\~n}ez, M.},
  journal = {European Journal of Operational Research},
  volume = {196},
  number = {3},
  pages = {1008--1014},
  year = {2009}
}
@article{Wooldrdige'':Dunne'06,
  author = {Wooldridge, M. and Dunne, P.},
  year = {2006},
  title = {{On the computational complexity of coalitional resource games}},
  journal = {Artificial Intelligence},
  volume = {170},
  number = {10},
  pages = {835--871}
}
@article{Elkind_et_al_2009,
  title = {{A tractable and expressive class of marginal contribution nets and its applications}},
  author = {Elkind, E. and Goldberg, L.A. and Goldberg, P.W. and Wooldridge, M.},
  journal = {Mathematical Logic Quarterly},
  volume = {55},
  number = {4},
  pages = {362--376},
  year = {2009}
}
@article{Watts:Strogatz:1998,
  title = {{Collective dynamics of small-world networks}},
  author = {Watts, D.J. and Strogatz, S.H.},
  journal = {Nature},
  volume = {393},
  number = {6684},
  pages = {440--442},
  year = {1998}
}
@article{bachrach2009power,
  title = {{Power in threshold network flow games}},
  author = {Bachrach, Y. and Rosenschein, J.S.},
  journal = {Autonomous Agents and Multi-Agent Systems},
  volume = {18},
  number = {1},
  pages = {106--132},
  year = {2009}
}
@article{random_walk_centrality,
  title = {{Random walks on complex networks}},
  author = {Noh, J.D. and Rieger, H.},
  journal = {Physical Review Letters},
  year = {2004},
  volume = {92},
  number = {11},
  pages = {118701(1-4)}
}
@article{information_centrality,
  title = {{Rethinking centrality: Methods and examples}},
  author = {Stephenson, K. and Zelen, M.},
  journal = {Social Networks},
  volume = {11},
  number = {1},
  pages = {1--37},
  year = {1989}
}
@article{eigen_centrality,
  title = {{Factoring and weighting approaches to status scores and clique identification}},
  author = {Bonacich, P.},
  journal = {Journal of Mathematical Sociology},
  volume = {2},
  number = {1},
  pages = {113--120},
  year = {1972}
}
@article{centrality_quip,
  title = {{Power and centrality: A family of measures}},
  author = {Bonacich, P.},
  journal = {American Journal of Sociology},
  volume = {92},
  number = {5},
  pages = {1170--1182},
  year = {1987}
}
@article{matsui_voting,
  title = {{A survey of algorithms for calculating power indices of weighted majority games}},
  author = {Matsui, T. and Matsui, Y.},
  journal = {Journal of the Operations Research Society of Japan},
  volume = {43},
  pages = {71--86},
  year = {2000}
}
@article{Megiddo:1978,
  title = {{Computational complexity of the game theory approach to cost allocation for a tree}},
  author = {Megiddo, N.},
  journal = {Mathematics of Operations Research},
  volume = {3},
  number = {3},
  pages = {189--196},
  year = {1978}
}
@article{Nagamochi:et:al:1997,
  title = {{Complexity of the minimum base game on matroids}},
  author = {Nagamochi, H. and Zeng, D. and Kabutoya, N. and Ibaraki, T.},
  journal = {Mathematics of Operations Research},
  volume = {22},
  number = {1},
  pages = {146--164},
  year = {1997}
}
@inproceedings{Michalak:Marciniak:Szamotulski:Rahwan:Jennings:10,
  author = {Michalak, T.P. and Rahwan, T. and Marciniak, D. and Szamotulski, M. and Jennings, N.},
  booktitle = {{ECAI '10: Proceedings of the Nineteenth European Conference on Artificial Intelligence}},
  title = {{Computational aspects of extending the Shapley Value to coalitional games with externalities}},
  year = {2010}
}
@inproceedings{randomized_voting,
  title = {{A randomized method for the Shapley Value for the voting game}},
  author = {Fatima, S.S. and Wooldridge, M. and Jennings, N.R.},
  booktitle = {{AAMAS '07: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multi-Agent Systems}},
  pages = {959--966},
  year = {2007}
}
@inproceedings{Ieong:Shoham05,
  title = {{Marginal contribution nets: a compact representation scheme for coalitional games}},
  author = {Ieong, S. and Shoham, Y.},
  booktitle = {{EC '05: Proceedings of the Sixth ACM Conference on Electronic Commerce}},
  pages = {193--202},
  year = {2005}
}
@inproceedings{Conitzer:Sandholm04b,
  title = {{Computing Shapley Values, manipulating value division schemes and checking core membership in multi-issue domains}},
  author = {Conitzer, V. and Sandholm, T.},
  booktitle = {{AAAI '04: Proceedings of the Nineteenth National Conference on Artificial Intelligence}},
  pages = {219--225},
  year = {2004}
}
@inproceedings{kempe2003maximizing,
  title = {{Maximizing the spread of influence through a social network}},
  author = {Kempe, D. and Kleinberg, J. and Tardos, {\'E}.},
  booktitle = {{KDD '03: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}},
  pages = {137--146},
  year = {2003}
}
@inproceedings{fast_approx_centrality,
  title = {{Fast approximation of centrality}},
  author = {Eppstein, D. and Wang, J.},
  booktitle = {{SODA '01: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms}},
  pages = {228--229},
  year = {2001}
}
@inproceedings{parallel_centrality,
  title = {{Parallel algorithms for evaluating centrality indices in real-world networks}},
  author = {Bader, D.A. and Madduri, K.},
  booktitle = {{ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing}},
  pages = {539--550},
  year = {2006}
}
@inproceedings{Suri:Narahari:2008,
  title = {{Determining the top-k nodes in social networks using the Shapley Value}},
  author = {Suri, N.R. and Narahari, Y.},
  booktitle = {{AAMAS '08: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems}},
  pages = {1509--1512},
  year = {2008}
}
@inproceedings{Greco:et:al:2009,
  author = {Greco, G. and Malizia, E. and Palopoli, L. and Scarcello, F.},
  title = {{On the complexity of compact coalitional games}},
  booktitle = {IJCAI '09: Proceedings of the Twenty First International Joint Conference on Artifical Intelligence},
  year = {2009},
  pages = {147--152}
}
@inproceedings{Michalak:Marciniak:Szamotulski:Rahwan:Wooldridge:McBurney:Jennings:10,
  author = {Michalak, T.P. and Marciniak, D. and Samotulski, M. and Rahwan, T. and McBurney, P. and Wooldridge, M. and Jennings, N.},
  booktitle = {{AAMAS '10: Proceedings of the Ninth International Joint Conference on Autonomous Agents and Multi-Agent Systems}},
  title = {{A logic-based representation for coalitional games with externalities}},
  year = {2010},
  pages = {125--132}
}
@book{six_degrees,
  title = {{Six degrees: The science of a connected age}},
  author = {Watts, D.J.},
  year = {2004},
  publisher = {W.W. Norton \& Company}
}
@book{bondy1976graph,
  title = {{Graph theory and its applications}},
  author = {Bondy, J.A. and Murty, U.S.R.},
  year = {1976},
  publisher = {Macmillan}
}
@book{west2001introduction,
  title = {{Introduction to graph theory}},
  author = {West, D.B.},
  year = {2001},
  publisher = {Prentice Hall, Inc.}
}
@book{gibbons1994primer,
  title = {{A primer in game theory}},
  author = {Gibbons, R.},
  year = {1994},
  publisher = {Harvester Wheatsheaf}
}
@book{rapoport2001n,
  title = {{N-person game theory: Concepts and applications}},
  author = {Rapoport, A.},
  year = {2001},
  publisher = {Dover Publications}
}
@book{cormen2001introduction,
  title = {{Introduction to algorithms}},
  author = {Cormen, T.H.},
  year = {2001},
  publisher = {MIT Press}
}
@book{schelling1978micromotives,
  title = {{Micromotives and macrobehavior}},
  author = {Schelling, T.C.},
  year = {1978},
  publisher = {W.W. Norton \& Company}
}
@inbook{young2006diffusion,
  author = {Young, H.P.},
  title = {The diffusion of innovations in social networks. Economy as an evolving complex system III},
  pages = {267--281},
  year = {2005},
  publisher = {Oxford University Press}
}
@inbook{citeulike:1120028,
  author = {Kosch\"{u}tzki, D. and Lehmann, K.A. and Peeters, L. and Richter, S. and Tenfelde-Podehl, D. and Zlotowski, O.},
  title = {Centrality indices. Network analysis},
  publisher = {Springer},
  pages = {16--61},
  year = {2005},
  series = {{Lecture Notes in Computer Science}},
  volume = {3418}
}
@misc{shapley_electoral_college,
  title = {{Values of large games, VI: Evaluating the electoral college exactly}},
  author = {Mann, I. and Shapley, L.S.},
  note = {RAND Research Memorandum},
  year = {1962}
}
@unpublished{bilbao41092complexity,
  title = {{Complexity in cooperative game theory}},
  author = {Bilbao, J. and Fern{\'a}ndez, J. and L{\'o}pez, J.J.},
  url = {http://www.esi2.us.es/~mbilbao/pdffiles/compgame.pdf},
  year = {2000}
}
@inproceedings{Green:et:al:2012,
  author = {Green, O. and McColl, R. and Bader, D. A.},
  booktitle = {SOCIALCOM-PASSAT '12: Proceedings of the 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust},
  isbn = {978-1-4673-5638-1},
  pages = {11--20},
  publisher = {IEEE},
  title = {A Fast Algorithm for Streaming Betweenness Centrality.},
  year = 2012
}

This file was generated by bibtex2html 1.96.