Abstract
We propose a stylized model of a problem-solving organization whose internal communication structure is given by a fixed network. Problems arrive randomly anywhere in this network and must find their way to their respective specialized solvers by relying on local information alone. The organization handles multiple problems simultaneously. For this reason, the process may be subject to congestion. We provide a characterization of the threshold of collapse of the network and of the stock of floating problems (or average delay) that prevails below that threshold. We build upon this characterization to address a design problem: the determination of what kind of network architecture optimizes performance for any given problem arrival rate. We conclude that, for low arrival rates, the optimal network is very polarized (i.e. star-like or centralized), whereas it is largely homogenous (or decentralized) for high arrival rates. These observations are in line with a common transformation experienced by information-intensive organizations as their work flow has risen in recent years.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74: 47–97
Allen O (1990) Probability, statistics and queueing theory with computer science application. Academic Press, New York
Arenas A, Díaz-Guilera A, Guimerá R (2001) Communication in networks with hierarchical branching. Phys Rev Lett 86: 3196–3199
Beggs AW (2001) Queues and hierarchies. Rev Econ Stud 68: 297–322
Bentley J (2000) Programming pearls. Addison–Wesley, Boston
Bolton P, Dewatripont M (1994) The firm as a communication network. Q J Econ 109: 809–839
Byrne JA (1993) The horizontal corporation. Business Week, December 20: 76–81
Davenport TH (1993) Process innovation: reengineering work through information technology. Harvard Business School Press, Cambridge
Dodds PS, Watts DJ, Sabel CF (2003) Information exchange and the robustness of organizational networks. Proc Natl Acad Sci 100: 12516–12521
Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40: 35–41
Garicano L (2000) Hierarchies and the organization of knowledge in production. J Polit Econ 108: 874–904
Guimerà R, Díaz-Guilera A, Vega-Redondo F, Cabrales A, (2002) Optimal network topologies for local search with congestion. Phys Rev Lett 89(24): 248701
Hammer M (1990) Reengineer work: don’t automate, obliterate. Harv Bus Rev 90: 104–112
Hayek FA (1940) Socialist calculation: the competitive solution. Economica 7: 125–149
Hurwicz L (1960) Optimality and informational efficiency in resource allocation processes. In: Arrow KJ, Hurwicz L(eds) Mathematical models in the social sciences. Cambridge University Press, Cambridge
Kleinberg J (1999) The small world phenomenon: an algorithmic perspective. Cornell Computer Science Technical Report 99-1776
Kleinberg J (2000) Navigation in a small-world. Nature 406: 845
Krackhardt D, Hanson JR (1993) Informal networks: the company. Harv Bus Rev 71: 104–111
Lange O (1936) On the economic theory of socialism: part one. Rev Econ Stud 4: 53–71
Lange O (1937) On the economic theory of socialism: part two. Rev Econ Stud 4: 123–142
Little JDC (1961) A proof of the queueing formula: L = λ W. Oper Res 9: 383–387
Newman MEJ (2001) Scientific Collaboration networks. II. Shortest paths, weighted networks, and centrality. Phys Rev E 64: 016132
Newman MEJ, Moore C, Watts DJ (2000) Mean-field solution of the small-world network model. Phys Rev Lett 84: 3201–3204
Ostroff F, Smith D (1992) The horizontal organization. McKinsey Q 1: 148–168
Penna TJP (1995) The travelling salesman problem and Tsallis statistics. Phys Rev E 51: R1–R4
Radner R (1993) The organization of decentralized information processing 61:1109–1146
Sah RK, Stiglitz JE (1986) The architecture of economic systems: hierarchies and polyarchies. Am Econ Rev 76: 716–727
Stidham S Jr (1974) A last word on L = λ W. Oper Res 22: 417–421
Tsallis C, Stariolo DA (1994) Optimization by simulated annealing: recent progress. In: Stauffer D(eds) Annual review of computational physics, vol II.. World Scientific, Singapore, p 343
Visser B (2000) Organizational communication structure and performance. J Econ Behav Organ 42: 231–252
Watts DJ (1999) Small worlds: the dynamics of networks between order and randomness. Princeton University Press, Princeton
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393: 440–442
van Zandt T (1999) Decentralized information processing in the theory of organizations. In: Sertel M(eds) Contemporary economic development reviewed The Enterprise and its Environment vol 4. MacMillan, London
Zandt T (1999b) Real-time decentralized information processing as a model of organizations with boundedly rational agents. Rev Econ Stud 66: 633–658
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors would like to thank L. A. N. Amaral, X. Guardiola, R. Monasson, C. J. Pérez, M. Sales and seminar audiences for helpful comments and discussions. This work has been supported by the DGES of the Spanish Government, Grants No. PPQ2001-1519, No. BFM2000-0626, No. BEC2000-1029, No. BEC2001-0980, No. SEJ2007-62656, No. SEJ2006-11665- C02-00, and CONSOLIDER INGENIO 2010 (No. CSD2006-0016), as well as by the EC-Fet Open project IST- 2001-33555. Roger Guimerà also acknowledges financial support from the Generalitat de Catalunya.
Rights and permissions
About this article
Cite this article
Arenas, À., Cabrales, A., Danon, L. et al. Optimal information transmission in organizations: search and congestion. Rev Econ Design 14, 75–93 (2010). https://doi.org/10.1007/s10058-008-0067-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10058-008-0067-2