  We propose and study a strategic model of hiding in a network, where the
network designer chooses the links and his position in the network facing the
seeker who inspects and disrupts the network. We characterize optimal networks
for the hider, as well as equilibrium hiding and seeking strategies on these
networks. We show that optimal networks are either equivalent to cycles or
variants of a core-periphery networks where every node in the periphery is
connected to a single node in the core.
