We study a simple model of a population of agents whose interaction network co-evolves with knowledge diffusion and accumulation. Diffusion takes place along the current network and, reciprocally, network formation depends on the knowledge profile. Diffusion makes neighboring agents tend to display similar knowledge levels. On the other hand, similarity in knowledge favors network formation. Th...

We investigate the trade-off between the risk-sharing gains enjoyed by more interconnected firms and the costs resulting from an increased risk exposure. We find that when the shock distribution displays “fat” tails, extreme segmentation into small components is optimal, while minimal segmentation and high density of connections are optimal when the distribution exhibits “thin” tails. For less ...

This work was designed to the study some heat resistance characteristics of the isolates obtained in relation to fruit processing parameters. The effect of heat (85, 90 , 92.5 0 and 95 C) in combination with common fruit products preservatives (sodium benzoate and citric acid) and sugars (fructose and sucrose) on inactivation of ascospores of N. fischeri and T. flavus was studied in water, phos...

We model network formation when heterogeneous nodes enter sequentially and form connections through both random meetings and network-based search, but with type-dependent biases. We show that there is “long-run integration,” whereby the composition of types in sufficiently old nodes’ neighborhoods approaches the global type distribution, provided that the network-based search is unbiased. Howev...

We analyze a multi-period entry game among privately informed agents who differ with respect to the number of agents who must enter in order for their own entry to be profitable. In each period agents who have not yet joined decide whether to subscribe to a network. There exists a unique equilibrium that approximates any symmetric equilibrium arbitrarily closely as the discount factor approache...

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 to divide the population in sets of players who obtain the same resources and we order these sets acco...

We show that although the prominent centrality measures in network analysis make use of different information about nodes’ positions, they all process that information in a very restrictive and identical way. They all spring from a common family that are characterized by the same axioms. In particular, they are all based on a additively separable and linear treatment of a statistic that capture...

We focus on the crucial role of network architecture in the defence against targeted attacks. A two-stage strategic game between a network designer and a network disruptor is analyzed. Given a set of nodes, the designer builds a network by investing in costly links. In the second stage, the disruptor deletes (possibly in a costly way) some of the links or nodes to reduce the designer’s benefit ...

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller pieces, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of summarizing complex strategic interactions by simple ones can be applied to compute Nash equilibria. We also provide an application to publi...

We examine the optimal disruption of dark (covert and illegal) networks. Of central importance is that an interventionist will generally have incomplete information about the dark network’s architecture. We derive the optimal disruption strategy in a stylized model of dark network intervention with incomplete information and show how it combines features of two types of disruption considered in...