EconStor >
Fondazione Eni Enrico Mattei (FEEM), Mailand >
FEEM Working Papers, Fondazione Eni Enrico Mattei  >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/40681
  
Title:Networks of commons PDF Logo
Authors:İlkiliç, Rahmi
Issue Date:2008
Series/Report no.:Nota di lavoro // Fondazione Eni Enrico Mattei: CTN, Coalition theory network 2008,30
Abstract:A tragedy of the commons appears when the users of a common resource have incentives to exploit it more than the socially efficient level. We analyze the situation when the tragedy of the commons is embedded in a network of users and sources. Users play a game of extractions, where they decide how much resource to draw from each source they are connected to. We show that if the value of the resource to the users is linear, then each resource exhibits an isolated problem. There exists a unique equilibrium. But when the users have concave values, the network structure matters. The exploitation at each source depends on the centrality of the links connecting the source to the users. The equilibrium is unique and we provide a formula which expresses the quantities at an equilibrium as a function of a network centrality measure. Next we characterize the efficient levels of extractions by users and outflows from sources. Again, the case of linear values can be broken down source by source. For the case of concave values, we provide a graph decomposition which divides the network into regions according to the availability of sources. Then the efficiency problem can be solved region by region.
Subjects:Tragedy of the Commons
Networks
Nash Equilibrium
Efficiency
Centrality Measures
JEL:C62
C72
D85
Q20
Document Type:Working Paper
Appears in Collections:FEEM Working Papers, Fondazione Eni Enrico Mattei

Files in This Item:
File Description SizeFormat
568789563.pdf581.16 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/40681

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.