We extend the model of friendship networks developed by Brueck-ner (2006) in two ways. First, we extend the level of indirect bene…tsby incorporating bene…ts from up to three links and explore its impli-cation for the socially optimal and individual e¤ort levels. Next, wegeneralize the...

This paper addresses the existence of Nash equilibria in one-way flow or directed network models in a number of different settings. In these models players form costly links with other players and obtain resources from them through the directed path connecting them. We find that heterogeneity in...

We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...

We examine how trade sanctions can be imposed effectively in a trading network. We focus on three factors that affect trade sanctions: a country’s endowment, distance between trading countries, and connectivity in the network. Our models explain several empirical observations: (i) sanctions...

We consider an incomplete information network game in which agents’ information is restricted only to the identity of their immediate neighbors. Agents form beliefs about the adjacency pattern of others and play a linear-quadratic effort game to maximize interim payoffs. We establish the...

This paper introduces a partner heterogeneity assumption in the one-way flow model of Bala and Goyal (2000, [1]). Our goal consists in the characterization of strict Nash networks with regard to the set of resources obtained by players. We use the notion of condensation network which allows us...