Kliemann, Lasse - In: Games 2 (2011) 3, pp. 302-332
We study network formation with <em>n players</em> and link cost <em>α </em> 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player <em>ν</em> incorporates the expected number of players to which <em>ν</em> will become disconnected. We focus on...</em>