Returns to scale in one-shot information processing when hours count

被引:0
|
作者
De Fontenay C. [1 ]
Meagher K.J. [1 ]
机构
[1] School of Economics, University of New South Wales, Sydney
关键词
Organizations; returns to scale; Parallel processing; Wage costs;
D O I
10.1007/PL00013695
中图分类号
学科分类号
摘要
The decentralized information processing approach pioneered by Radner and Van Zandt endogenously determines the optimal hierarchy for decision making within an organization. The simplest information processing model is the one-shot problem (one set of information to process) which serves as the testing ground for ever richer descriptions of managers and their tasks. Meagher and Van Zandt observed that an hours-based measure should be used for calculating managerial costs rather than the fixed cost per employee used by Radner. Surprisingly they show that the set of efficient hierarchies is equivalent under the two different measures. In this paper we show that using the hours-based measure can give quite different results for returns to scale than were found by Radner. We find constant returns to scale over a wide range of delay costs, whereas Radner found increasing returns to scale: In other words, costs rise proportionally with the size of the firm's information problem. Constant returns to scale implies that distortions in firm size will not arise from the need for hierarchical organization per se, but rather from organizational issues from the theory of the firm, such as incentives and abilities. © Springer-Verlag 2001.
引用
收藏
页码:113 / 124
页数:11
相关论文
共 50 条
  • [31] Real-time decentralized information processing and returns to scale
    Van Zandt, T
    Radner, R
    ECONOMIC THEORY, 2001, 17 (03) : 545 - 575
  • [32] Duopoly Market Analysis within One-Shot Decision Framework with Asymmetric Possibilistic Information
    Guo, Peijun
    Yan, Ruiliang
    Wang, John
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2010, 3 (06): : 786 - 796
  • [33] Speech Representation Disentanglement with Adversarial Mutual Information Learning for One-shot Voice Conversion
    Yang, Sicheng
    Tantrawenith, Methawee
    Zhuang, Haolin
    Wu, Zhiyong
    Sun, Aolan
    Wang, Jianzong
    Cheng, Ning
    Tang, Huaizhen
    Zhao, Xintao
    Wang, Jie
    Meng, Helen
    INTERSPEECH 2022, 2022, : 2553 - 2557
  • [34] Quantifying quantum non-Markovianity via one-shot generalised mutual information
    Luo, Yu
    Li, Yongming
    Shao, Lian-He
    Xi, Zhengjun
    LASER PHYSICS LETTERS, 2020, 17 (03)
  • [35] Duopoly Market Analysis within One-Shot Decision Framework with Asymmetric Possibilistic Information
    Guo P.
    Yan R.
    Wang J.
    International Journal of Computational Intelligence Systems, 2010, 3 (06) : 786 - 796
  • [36] One-shot inner bounds for sending private classical information over a quantum MAC
    Chakraborty, Sayantan
    Nema, Aditya
    Sen, Pranab
    2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [37] Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
    Najjar, F
    Slimani, Y
    INFORMATION SCIENCES, 1999, 114 (1-4) : 1 - 21
  • [38] One-shot 3D scanning by combining sparse landmarks with dense gradient information
    Di Martino, Matias
    Flores, Jorge
    Ferrari, Jose A.
    OPTICS AND LASERS IN ENGINEERING, 2018, 105 : 188 - 197
  • [39] Why One-shot Information Literacy Sessions Are Not the Future of Instruction: A Case for Online Credit Courses
    Mery, Yvonne
    Newby, Jill
    Peng, Ke
    COLLEGE & RESEARCH LIBRARIES, 2012, 73 (04): : 366 - 377
  • [40] One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels
    Salek, Farzin
    Anshu, Anurag
    Hsieh, Min-Hsiu
    Jain, Rahul
    Fonollosa, Javier R.
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 296 - 300