@inproceedings{7e31c32666434baeac474c1ac45adeaa,
title = "On the construction of covert networks",
abstract = "Centrality measures are widely used to identify leaders of covert networks. We study how a group of such leaders can avoid being detected by such measures. More concretely, we study the hardness of choosing a set of edges that can be added to the network in order to decrease the leaders' ranking according to two fundamental centrality measures, namely degree, and closeness. We prove that this problem is NP-complete for each measure. We then study how the leaders can construct a network from scratch, designed specifically for them to hide in disguise. We identify a network structure that not only guarantees to hide the leaders to a certain extent, but also allows them to spread their influence across the network.",
keywords = "Centrality, Hiding in networks, Social network analysis",
author = "Marcin Waniek and Talal Rahwan and Michalak, {Tomasz P.} and Michael Wooldridge",
year = "2017",
language = "English (US)",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "1341--1349",
editor = "Edmund Durfee and Michael Winikoff and Kate Larson and Sanmay Das",
booktitle = "16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017",
note = "16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 ; Conference date: 08-05-2017 Through 12-05-2017",
}