This paper analyzes the asymmetries with regard to the resources obtained by groups of players in equilibrium networks. We use the notion of condensation networks which allows us to partition the population into sets of players who obtain the same resources and we order these sets according to...

In this paper we characterize efficient networks for network formation games with global spillovers, that satisfy convexity and sub-modularity properties. This allows us to complete the work of Goyal and Joshi (2006) and Westbrock on collaborative oligopoly networks. In particular, we establish...

Our paper belongs to the strand of literature associated with the notion of Nash networks introduced by Bala and Goyal [1] in the connections model. Our aim is to consider situations where agent i has concerns about the validity of information that she acquires from agent j. Independently...

We provide existence results in a game with local spillovers where the payoff function satisfies both convexity and the strategic substitutes property. We show that there always exists a stable pairwise network in this game, and provide a condition which ensures the existence of pairwise...

This paper examines directed networks in which the payoff of a player depends on the total number links formed by her and the other players. After showing that these networks with global spillovers may not always have Nash equilibria in pure strategies, we introduce two additional properties for...

Heterogeneity in Nash networks can arise due to differences in the following four variables: (i) the value of information held by agents, (ii) the rate at which information decays or loses its value as it traverses the network, (iii) the prob- ability with which a links transmits information,...

This paper addresses the existence of Nash networks for the one-way flow model of Bala and Goyal (2000) in a number of different settings. First, we provide conditions for he existence of Nash networks in models where costs and values of links are heterogenous and players obtain resources from...

Heterogeneity in Nash networks with two-way flow can arise due to differences in the follow- ing four variables: (i) the value of information held by players, (ii) the rate at which information decays as it traverses the network, (iii) the probability with which a link transmits information, and...

Galeotti et al. (2006, [2]) show that all minimal networks can be strict Nash in two-way flow models with full parameter heterogeneity while only inward pointing stars and the empty network can be strict Nash in the homogeneous parameter model of Bala and Goyal (2000, [1]). In this note we show...

In this paper, we examine the role played by heterogeneity in the connection model. In sharp contrast to the homogeneous cases we show that under heterogeneity involving only two degrees of freedom, all networks can be supported as Nash or efficient. Moreover, we show that there does not always...