-theoretic model of attack and defense of a network in which the defender's objective is to maintain network connectivity and the … attacker's objective is to destroy a set of nodes that disconnects the network. The conflict at each node is modeled as a … which a single random [minimal] set of nodes that disconnects the network is attacked. …

-theoretic model of attack and defense of a network in which the defender’s objective is to maintain network connectivity and the … attacker’s objective is to destroy a set of nodes that disconnects the network. The conflict at each node is modeled as a … which a single random [minimal] set of nodes that disconnects the network is attacked. …

This paper studies a game of attack and interception in a network where a single attacker chooses a target and a path … characterize equilibrium attack paths and attack distributions as a function of the underlying network and target values. We show …

network model, in which an agent's payoff depends on the ranking of their allocation among their network neighbors. Given a … network, an allocation is called α-stable if no blocking coalition whose size is an α fraction of the population can strictly … improve their payoffs. We find a sufficient and necessary condition for a network to permit an α-stable allocation: the …

, I provide a proposition that generalizes the results of these two models by stating that: (i) Strict Nash network … network as in Billand et al (2011). This proposition requires that a certain restriction on link formation cost (called …