{"type":"ScholarlyArticle","title":"Attachment Centrality for Weighted Graphs","authors":[{"name":"Jadwiga Sosnowska","slug":"jadwiga-sosnowska","given":"Jadwiga","family":"Sosnowska","affiliation":"University of Warsaw , Poland"},{"name":"Oskar Skibski","slug":"oskar-skibski","given":"Oskar","family":"Skibski","affiliation":"University of Warsaw , Poland"}],"abstract":"Measuring how central nodes are in terms of connecting a network has recently received increasing attention in the literature. While a few dedicated centrality measures have been proposed, Skibski et al. [2016] showed that the Attachment Centrality is the only one that satisfies certain natural axioms desirable for connectivity. Unfortunately, the Attachment Centrality is defined only for unweighted graphs which makes this measure ill-fitted for various applications. For instance, covert networks are typically weighted, where the weights carry additional intelligence available about criminals or terrorists and the links between them. To analyse such settings, in this paper we extend the Attachment Centrality to node-weighted and edge-weighted graphs. By an axiomatic analysis, we show that the Attachment Centrality is closely related to the Degree Centrality in weighted graphs.","doi":"10.24963/ijcai.2017/59","url":"https://ijcai.org/proceedings/2017/59","pdf":"https://ijcai.org/proceedings/2017/0059.pdf","markdown":"https://ijcai.org/proceedings/2017/59.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/59","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":59,"pages":{"first":416,"last":422},"keywords":["Agent-based and Multi-agent Systems: Economic paradigms, auctions and market-based systems","Agent-based and Multi-agent Systems: Cooperative Games"],"videos":[],"references":[{"position":1,"raw":"[Amer and Giménez, 2004] Rafael Amer and José Miguel Giménez. A connectivity game for graphs. Mathematical Methods of Operations Research, 60(3):453-470, 2004.","title":"Rafael Amer and José Miguel Giménez. A connectivity game for graphs","authors":"Giménez Amer","year":"2004","venue":"Mathematical Methods of Operations Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bagler, 2008] Ganesh Bagler. Analysis of the airport net- work of india as a complex weighted network. Physica A: Statistical Mechanics and its Applications, 387(12):2972- 2980, 2008.","title":"Ganesh Bagler. Analysis of the airport network of india as a complex weighted network","authors":"Bagler","year":"2008","venue":"Physica A: Statistical Mechanics and its Applications","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Belau, 2014] Julia Belau. Consequences of connection fail- ure -centrality and the importance for cohesion. In Public Choice Society, 2014.","title":"Consequences of connection failure -centrality and the importance for cohesion","authors":"Julia Belau","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brandes and Erlebach, 2005] Ulrik Brandes and Thomas Erlebach. Network analysis: Methodological foundations. Springer-Verlag, 2005.","title":"Network analysis: Methodological foundations","authors":"Erlebach Brandes, Ulrik Brandes, Thomas Erlebach","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calvo et al., 1999] Emilio Calvo, Javier Lasaga, and Anne van den Nouweland. Values of games with probabilistic graphs. Mathematical Social Sciences, 37(1):79-95, 1999.","title":"Values of games with probabilistic graphs","authors":"Calvo","year":"1999","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Derrible, 2012] S. Derrible. Network centrality of metro systems. PLoS ONE, 7(7), 2012.","title":"Network centrality of metro systems","authors":"S Derrible","year":"2012","venue":"PLoS ONE","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Freeman, 1979] Linton C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1(3):215-239, 1979.","title":"Centrality in social networks: Conceptual clarification","authors":"C Linton, Freeman","year":"1979","venue":"Social Networks","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Haeringer, 1999] Guillaume Haeringer. Weighted Myerson value. International Game Theory Review, 1(02):187-192, 1999.","title":"Guillaume Haeringer. Weighted Myerson value","authors":"Haeringer","year":"1999","venue":"International Game Theory Review","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Heitzig et al., 2010] Jobst Heitzig, Norbert Marwan, Yong Zou, Jonathan F Donges, and Jürgen Kurths. Consistently weighted measures for complex network topologies. Eu- rop. Phys. J. B, 85:1-16, 2010.","title":"Consistently weighted measures for complex network topologies","authors":"Jobst Heitzig, Norbert Marwan, Yong Zou, Jonathan F Donges, Jürgen Kurths","year":"2010","venue":"Europ. Phys. J. B","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kalai and Samet, 1987] Ehud Kalai and Dov Samet. On weighted Shapley values. International Journal of Game Theory, 16(3):205-222, 1987.","title":"On weighted Shapley values","authors":"Samet Kalai, Ehud Kalai, Dov Samet","year":"1987","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Koschade, 2006] Stuart Koschade. A social network anal- ysis of Jemaah Islamiyah: The applications to counterter- rorism and intelligence. Studies in Conflict & Terrorism, 29(6):559-575, 2006.","title":"A social network analysis of Jemaah Islamiyah: The applications to counterterrorism and intelligence","authors":"Stuart Koschade","year":"2006","venue":"Studies in Conflict & Terrorism","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lindelauf et al., 2013] Roy Lindelauf, Herbert Hamers, and Bart Husslage. Cooperative game theoretic centrality anal- ysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda. European Journal of Operational Research, 229(1):230-238, 2013.","title":"Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda","authors":"Roy Lindelauf, Herbert Hamers, Bart Husslage","year":"2013","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Michalak et al., 2013] Tomasz P. Michalak, Talal Rah- wan, Piotr L. Szczepański, Oskar Skibski, Ramasuri Narayanam, Michael Wooldridge, and Nicholas R. Jen- nings. Computational analysis of connectivity games with applications to the investigation of terrorist networks. In Proceedings of 23rd International Joint Conference on Ar- tificial Intelligence (IJCAI), pages 293-301, 2013.","title":"Computational analysis of connectivity games with applications to the investigation of terrorist networks","authors":"P Tomasz, Talal Michalak, Piotr L Rahwan, Oskar Szczepański, Ramasuri Skibski, Michael Narayanam, Nicholas R Wooldridge, Jennings","year":"2013","venue":"Proceedings of 23rd International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2013/52"},{"position":14,"raw":"[Moretti et al., 2010] Stefano Moretti, Vito Fragnelli, Fiora- vante Patrone, and Stefano Bonassi. Using coalitional games on biological networks to measure centrality and power of genes. Bioinformatics, 26(21):2721-2730, 2010.","title":"Using coalitional games on biological networks to measure centrality and power of genes","authors":"Stefano Moretti, Vito Fragnelli, Fioravante Patrone, Stefano Bonassi","year":"2010","venue":"Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Myerson, 1977] Roger B. Myerson. Graphs and coopera- tion in games. Mathematical Methods of Operations Re- search, 2(3):225-229, 1977.","title":"Graphs and cooperation in games","authors":"B Roger, Myerson","year":"1977","venue":"Mathematical Methods of Operations Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Myerson, 1980] Roger B. Myerson. Conference structures and fair allocation rules. International Journal of Game Theory, 9:169-82, 1980.","title":"Conference structures and fair allocation rules","authors":"B Roger, Myerson","year":"1980","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Narayanam et al., 2014] Ramasuri Narayanam, Oskar Skib- ski, Hemank Lamba, and Tomasz P. Michalak. A Shapley value-based approach to determine gatekeepers in social networks with applications. In Proceedings of 21st Euro- pean Conference on Artificial Intelligence (ECAI), pages 651-656, 2014.","title":"A Shapley value-based approach to determine gatekeepers in social networks with applications","authors":"Narayanam","year":"2014","venue":"Proceedings of 21st European Conference on Artificial Intelligence (ECAI)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Nepusz et al., 2012] Tamás Nepusz, Haiyuan Yu, and Al- berto Paccanaro. Detecting overlapping protein complexes in protein-protein interaction networks. Nature methods, 9(5):471-472, 2012.","title":"Detecting overlapping protein complexes in protein-protein interaction networks","authors":"Tamás Nepusz, Haiyuan Yu, Alberto Paccanaro","year":"2012","venue":"Nature methods","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Opsahl et al., 2010] Tore Opsahl, Filip Agneessens, and John Skvoretz. Node centrality in weighted networks: Generalizing degree and shortest paths. Social networks, 32(3):245-251, 2010.","title":"Node centrality in weighted networks: Generalizing degree and shortest paths","authors":"Opsahl","year":"2010","venue":"Social networks","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Palla et al., 2007] Gergely Palla, Albert-László Barabási, and Tamás Vicsek. Quantifying social group evolution. Nature, 446(7136):664-667, 2007.","title":"Quantifying social group evolution","authors":"Gergely Palla, Albert-László Barabási, Tamás Vicsek","year":"2007","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Shapley, 1953a] Lloyd S Shapley. Additive and non- additive set functions. Princeton University, 1953.","title":"Additive and nonadditive set functions","authors":"Lloyd S Shapley, Shapley","year":"1953","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Shapley, 1953b] Lloyd S. Shapley. A value for n-person games. In H.W. Kuhn and A.W. Tucker, editors, Contribu- tions to the Theory of Games, volume II, volume II, pages 307-317. Princeton University Press, 1953.","title":"A value for n-person games","authors":"Lloyd S Shapley, Shapley","year":"1953","venue":"Contributions to the Theory of Games","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Skibski et al., 2014] Oskar Skibski, Tomasz P. Michalak, Talal Rahwan, and Michael Wooldridge. Algorithms for the Shapley and Myerson values in graph-restricted games. In Proceedings of 13th International Conference on Au- tonomous Agents and Multiagent Systems (AAMAS), pages 197-204, 2014.","title":"Algorithms for the Shapley and Myerson values in graph-restricted games","authors":"Oskar Skibski, P Tomasz, Talal Michalak, Michael Rahwan, Wooldridge","year":"2014","venue":"Proceedings of 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Skibski et al., 2016] Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, and Makoto Yokoo. Attach- ment centrality: An axiomatic approach to connectivity in networks. In Proceedings of 15th International Con- ference on Autonomous Agents and Multiagent Systems (AAMAS), pages 168-176, 2016.","title":"Attachment centrality: An axiomatic approach to connectivity in networks","authors":"Oskar Skibski, Talal Rahwan, P Tomasz, Makoto Michalak, Yokoo","year":"2016","venue":"Proceedings of 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Skibski et al., 2017] Oskar Skibski, Tomasz P. Michalak, and Talal Rahwan. Axiomatic characterization of game- theoretic network centralities. In Proceedings of 31st AAAI Conference on Artificial Intelligence (AAAI), pages 698- 705, 2017.","title":"Axiomatic characterization of gametheoretic network centralities","authors":"Oskar Skibski, P Tomasz, Talal Michalak, Rahwan","year":"2017","venue":"Proceedings of 31st AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Tarkowski et al., 2016] Mateusz K Tarkowski, Piotr Szczepański, Talal Rahwan, Tomasz P. Michalak, and Michael Wooldridge. Closeness centrality for networks with overlapping community structure. In Proceedings of 30th AAAI Conference on Artificial Intelligence (AAAI), pages 622-629, 2016.","title":"Closeness centrality for networks with overlapping community structure","authors":"Piotr Mateusz K Tarkowski, Talal Szczepański, Rahwan, P Tomasz, Michael Michalak, Wooldridge","year":"2016","venue":"Proceedings of 30th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}