This paper studies a noncooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...

This paper characterizes the set of equilibrium networks in the two-way flow model of network formation with small decay, and this for all increasing benefit functions of the players. We show that as long as the population is large enough, this set contains large- as well as small-diameter...

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

This paper characterizes the set of equilibrium networks in the two-way flow model of network formation with small decay, and this for all increasing benefit functions of the players. We show that as long as the population is large enough, this set contains large- as well as small-diameter...

We study a coordination game among agents on a network, who choose whether or not to take an action in an uncertain environment that yields value increasing in the actions of neighbors. We develop an algorithm that fully characterizes the equilibrium partitions (coordination sets) and thresholds...

Most literature in strategic network formation shows that there is a substantial tension between stability and efficiency. In this note, I show that such is not the case in the twoway flow model with small decay studied by Bala and Goyal (2000a) and De Jaegher and Kamphorst (2015). Specifically,...

We develop a strategic model of network interdiction in a non-cooperative game of flow. An adversary, endowed with a bounded quantity of bads, chooses a flow specifying a plan for carrying bads through a network from a base to a target. Simultaneously, an agency chooses a blockage specifying a...

We consider a connection networks model. Every agent has a demand in the form of pairs of locations she wants connected, and a willingness to pay for connectivity. A planner aims at implementing a welfare maximizing network and allocating the resulting cost, but information is asymmetric: agents...