In this paper we consider four different game-theoretic approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider Jackson-Wolinsky’s concept of pairwise stability. Next, we introduce a stronger version of this concept based on...

Recently a variety of link-based stability concepts have emerged in the literature on game theoretic models of social network formation. We investigate two basic formation properties that establish equivalence between some well known types of stable networks and their natural extensions. These...

After years of neglect, Piccione and Rubinstein (1997a) re-examined the problem of imperfect recall and its implications for game theory. They introduced the notion of absent-mindedness through a decision-making problem called the absentminded driver's paradox. This simple game precipitated a...

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...

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...

For the connections model of strategic network formation, with two-way flow of information and without information decay, specific parameter configurations are given for which Nash networks do not exist. Moreover, existence and the scope of Nash network architectures are briefly discussed.

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

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...

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...