We study network formation with n players and link cost α 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player ν incorporates the expected number of players to which ν will become disconnected. We focus on...

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs....

Cooperation is widely recognized to be fundamental for the well-balanced development of human societies. Several different approaches have been proposed to explain the emergence of cooperation in populations of individuals playing the Prisoner’s Dilemma game, characterized by two concurrent...

Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal...

We initiate the study of the destruction or adversary model (Kliemann 2010) using the swap equilibrium (SE) stability concept (Alon et al., 2010). The destruction model is a network formation game incorporating the robustness of a network under a more or less targeted attack. In addition to...