Public goods in networks with constraints on sharing
Abstract
This paper considers incentives to provide goods that are partially shareable along social links. We introduce a model in which each individual in a social network not only decides how much of a shareable good to provide, but also decides which subset of neighbours to nominate as co-beneficiaries. An outcome of the model specifies an endogenously generated subnetwork of the original network and a public goods game occurring over the realised subnetwork. We prove the existence of specialised pure strategy Nash equilibria: those in which some individuals contribute while the remaining individuals free ride. We then consider how the set of efficient specialised equilibria vary as the constraints on sharing are relaxed and we show that, paradoxically, an increase in shareability may decrease efficiency.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.