Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/74249
Authors: 
Pin, Paolo
Year of Publication: 
2006
Series/Report no.: 
Nota di Lavoro, Fondazione Eni Enrico Mattei 78.2006
Abstract: 
The paper presents a model of network formation where every connected couple gives a contribution to the aggregate payoff, eventually discounted by their distance, and the resources are split between agents through the Myerson value. As equilibrium concept we adopt a refinement of pairwise stability. The only parameters are the number N of agents and a constant cost k for every agent to maintain any single link. This setup shows a wide multiplicity of equilibria, all of them connected, as k ranges over non trivial cases. We are able to show that, for any N, when the equilibrium is a tree (acyclical connected graph), which happens for high k, and there is no decay, the diameter of such a network never exceeds 8 (i.e. there are no two nodes with distance greater than 8). Adopting no decay and studying only trees, we facilitate the analysis but impose worst–case scenarios: we conjecture that the limit of 8 should apply for any possible non–empty equilibrium with any decay function.
Subjects: 
Network Formation
Myerson Value
JEL: 
D85
Document Type: 
Working Paper

Files in This Item:
File
Size





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