We investigate the equilibria of game theoretic models of network formation that are based on individual actions only. Our approach is grounded in three simple and realistic principles: (1) Link formation should be a binary process of consent. (2) Link formation should be costly. (3) The class...

In this paper, we pursue the work of H. Haller and al. (2005, [10]) and examine the existence of equilibrium networks, called Nash networks, in the noncooperative two-way flow model (Bala and Goyal, 2000, [1]) with partner heterogeneous agents. We show through an example that Nash networks do...

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

In this paper we examine efficient networks in network formation games with global spillovers that satisfy convexity and sub-modularity properties. Unlike the previous literature we impose these properties on individual payoff functions. We establish that efficient networks of this class of...

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

A non-cooperative model of network formation is developed. Agents form links with others based on the cost of the link and its assessed benefit. Link formation is one-sided, i.e., agents can initiate links with other agents without their consent, provided the agent forming the link makes the...