We study the structure of pairwise stable networks from a very general point. Rather than assuming a particular functional form of utility, we simply assume that the society is homogeneous, i.e. that agents' utilities differ only with respect to their network position while their names do not...

In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of...

Social networks display homophily and clustering, and are usually sparse. I develop and estimate a structural model of strategic network formation with heterogeneous players and latent community structure, whose equilibrium networks are sparse and exhibit homophily and clustering. Each player...

Many studies have used self-reported dyadic data without exploiting the pattern of discordant answers. In this paper we propose a maximum likelihood estimator that deals with mis-reporting in a systematic way. We illustrate the methodology using dyadic data on inter-household transfers (gifts...

This paper develops a framework to structurally estimate pairwise stable networks with nonnegative externality. We characterize pairwise stable equilibria as a fixed point of a certain mapping and show that the set of pairwise stable equilibria with nonnegative externality is a complete lattice....

We develop a modification of the connections model by Jackson and Wolinsky (1996) that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general...

We examine the process of building social relationships as a non-cooperative game that requires mutual consent and involves reaching out to others at a cost. Players create their social network from amongst their set of acquaintances. Having acquaintances allows players to form naive beliefs...

A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In...

We study the structure of pairwise stable networks from a very general point. Rather than assuming a particular functional form of utility, we simply assume that the society is homogeneous, i.e. that agents' utilities differ only with respect to their network position while their names do not...

In this paper, we study the formation of endogenous social storage cloud in a dynamic setting, where rational agents build their data backup connections strategically. We propose a degree-distance-based utility model, which is a combination of benefit and cost functions. The benefit function of...