3,970 research outputs found

    A Theory of Discrete Hierarchies as Optimal Cost-Adjusted Productivity Organisations

    Full text link
    Hierarchical structures are ubiquitous in human and animal societies, but a fundamental understanding of their raison d'\^etre has been lacking. Here, we present a general theory in which hierarchies are obtained as the optimal design that strikes a balance between the benefits of group productivity and the costs of communication for coordination. By maximising a generic representation of the output of a hierarchical organization with respect to its design, the optimal configuration of group sizes at different levels can be determined. With very few ingredients, a wide variety of hierarchically ordered complex organisational structures can be derived. Furthermore, our results rationalise the ubiquitous occurrence of triadic hierarchies, i.e., of the universal preferred scaling ratio between 33 and 44 found in many human and animal hierarchies, which should occur according to our theory when production is rather evenly contributed by all levels. We also provide a systematic approach for optimising team organisation, helping to address the question of the optimal `span of control'. The significantly larger number āˆ¼3āˆ’20\sim 3-20 of subordinates a supervisor typically manages is rationalised to occur in organisations where the production is essentially done at the bottom level and in which the higher levels are only present to optimise coordination and control

    Non rivalry and complementarity in computer software

    Get PDF
    In this paper we contend that ā€“ contrary to what argued by a vast part of the literature ā€“ computer software and, more in general, digital goods (i.e. symbolic strings on an electronic medium with some eco- nomic value) do not present the characteristics of a public good as they do not suffer from lack of rivarly and excludability any more than other durable goods which are regularly allocated on competitive markets. We argue instead that the ā€œmarket allocation problemā€ ā€“ if any ā€“ with digital goods does not arise from their public nature but from some pe- culiar characteristics of the production technology. The latter presents the nature of a typical problem solving activity as far as the produc- tion of the first unit is concerned, this means that innovative activities in computer software are characterized by high degrees of interdepen- dencies, cumulativeness, sequentiality, path dependence and, more in general, sub-optimality arising from imperfect problem decompositions. As far as the production of further units is concerned, we observe in- stead high (but not infinite) expansibility and perfect codification (lack of any tacit dimension) which make diffusion costs rapidly fall. Given such claims, we argue that a standard ā€œCoasianā€ approach to property rights, designed to cope with the externalities of semi-public goods may not be appropriate for computer software, as it may decrease both ex-ante incentives to innovation and ex-post efficiency of diffusion. On the other hand the institutional definition of property rights may strongly influence the patterns of technological evolution and division of labor in directions which are not necessarily optimal.Intellectual property; hierarchies; innovation; software; digital goods

    Division of Labor, Organizational Coordination and Market Mechanism in Collective Problem-Solving

    Get PDF
    This paper builds upon a view of economic system and individual economic organization as problem-solving arrangements and presents a simple model of adaptive problem-solving driven by trial-and-error and collective selection. The institutional structure, and in particular its degree of decentralization, determines which solutions are tried out and undergo selection. It is shown that if the design problem at hand is complex (in term of interdependencies between the elements of the system) then a decentralized institutional structure is very unlikely to ever generate optimal solutions and therefore no selection process can ever select them. We also show that nearly-decomposable structures have in general a selective advantage in terms of speed in reaching good locally optimal solutions.Theory of the firm, Vertical and horizontal integration, Computational complexity
    • ā€¦
    corecore