We analyze the evolution of the international collaboration network in photovoltaic research. Using data on scientific publications for the period 1980-2015, we apply social network analysis to trace the evolution of the global network of countries and national research networks of...

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

Cluster policies are often intended and designed to promote interaction in R&D among colocated organisations, as local knowledge interactions are perceived to be underdeveloped. In contrast to the popularity of the policy measure little is known about its impact on knowledge networks, because...

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

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