Strongly Stable Networks

We analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coincide with the set of efficient networks (those maximizing the total productive value). We show that the existence of strongly stable networks is equivalent to core existence in a derived cooperative game and use that result to characterize the class of value functions for which there exist strongly stable networks via a "top convexity" condition on the value function on networks. We also consider a variation on strong stability where players can make side payments, and examine situations where value functions may be non-anonymous - depending on player labels