Network Topology, Higher Orders of Stability and Efficiency
AbstractStable networks of order r where r is a natural number refer to those networks that are immune to coalitional deviation of size r or less. In this paper, we introduce stability of a finite order and examine its relation with efficient networks under anonymous and component additive value functions and the component-wise egalitarian allocation rule. In particular, we examine shapes of networks or network architectures that would resolve the conflict between stability and efficiency in the sense that if stable networks assume those shapes they would be efficient and if efficient networks assume those shapes, they would be stable with minimal further restrictions on value functions.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 52749.
Date of creation: 06 Jan 2014
Date of revision:
Stability of order r; Efficiency; Network architecture;
Find related papers by JEL classification:
- C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2014-01-10 (All new papers)
- NEP-GTH-2014-01-10 (Game Theory)
- NEP-NET-2014-01-10 (Network Economics)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Paul Belleflamme & Francis Bloch, 2001.
"Market Sharing Agreements and Collusive Networks,"
443, Queen Mary, University of London, School of Economics and Finance.
- Subhadip Chakrabarti & Robert Gilles, 2007.
Review of Economic Design,
Springer, vol. 11(1), pages 13-52, June.
- Matthew O. Jackson, 2001.
"Strongly Stable Networks,"
University of Oregon Economics Department Working Papers
2001-3, University of Oregon Economics Department, revised 15 Nov 2002.
- Gilles, Robert P. & Chakrabarti, Subhadip & Sarangi, Sudipta & Badasyan, Narine, 2006. "Critical agents in networks," Mathematical Social Sciences, Elsevier, vol. 52(3), pages 302-310, December.
- Sanjeev Goyal & Sumit Joshi, 2006. "Unequal connections," International Journal of Game Theory, Springer, vol. 34(3), pages 319-349, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.