Efficient structure of noisy communication networks

Yves Breitmoser () and Pauline Vorjohann

Mathematical Social Sciences, 2013, vol. 66, issue 3, 396-409

Abstract: In the canonical network model, the connections model, only three specific network structures are generically efficient: complete, empty, and star networks. This renders many plausible network structures inefficient. We show that requiring robustness with respect to stochastic information transmission failures rehabilitates incomplete, redundant network structures. Specifically, we show that star and complete networks are not generally robust to transmission failures, that circular and quasi-circular networks are efficient at intermediate costs in four-player networks, and that if either of them is efficient, then at least one of them is pairwise stable even without reallocation. Thus, incomplete, redundant networks are efficient and stable at intermediate costs.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489613000784
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Efficient structure of noisy communication networks (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:66:y:2013:i:3:p:396-409

DOI: 10.1016/j.mathsocsci.2013.09.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().