IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v35y1989i10p1264-1273.html
   My bibliography  Save this article

Cost Allocation Revisited: An Optimality Result

Author

Listed:
  • Seungjin Whang

    (Graduate School of Business, Stanford University, Stanford, California 94305)

Abstract

The resource manager of a firm is faced with capacity and pricing decisions with regard to a congestion-prone system such as computer/communication facilities. Difficulties arise since the manager is uninformed of the system demand when the capacity decision is to be made. A game-theoretic model is developed to analyze the effects of different accounting rules on the elicitation of relevant information and ex-post efficiency in acquisition and allocation decisions. The key result is that the cost allocation method (aided by an anonymous reporting scheme) is indeed, as asserted by Zimmerman (Zimmerman, J. 1979. The costs and benefits of cost allocations. Accounting Rev. 54(July) 504--521.), a full-information-efficient rule achieving optimality both in acquisition and allocation decisions. Discussions of the main assumptions underlying this result are provided.

Suggested Citation

  • Seungjin Whang, 1989. "Cost Allocation Revisited: An Optimality Result," Management Science, INFORMS, vol. 35(10), pages 1264-1273, October.
    • Handle: RePEc:inm:ormnsc:v:35:y:1989:i:10:p:1264-1273
    DOI: 10.1287/mnsc.35.10.1264
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.35.10.1264
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.35.10.1264?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Balachandran, Kashi R. & Radhakrishnan, Suresh, 1996. "Cost of congestion, operational efficiency and management accounting," European Journal of Operational Research, Elsevier, vol. 89(2), pages 237-245, March.
    2. Radhakrishnan, Suresh & Balachandran, Kashi R., 1995. "Stochastic choice hazard and incentives in a common service facility," European Journal of Operational Research, Elsevier, vol. 81(2), pages 324-335, March.
    3. Raja Nadiminti & Tridas Mukhopadhyay & Charles H. Kriebel, 2002. "Research Report: Intrafirm Resource Allocation with Asymmetric Information and Negative Externalities," Information Systems Research, INFORMS, vol. 13(4), pages 428-434, December.
    4. Chun (Martin) Qiu & Wenqing Zhang, 2016. "Managing long queues for holiday sales shopping," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(1), pages 52-65, February.
    5. Pangburn, Michael S. & Stavrulaki, Euthemia, 2008. "Capacity and price setting for dispersed, time-sensitive customer segments," European Journal of Operational Research, Elsevier, vol. 184(3), pages 1100-1121, February.
    6. Stephen C. Hansen & Robert P. Magee, 1993. "Capacity Cost and Capacity Allocation," Contemporary Accounting Research, John Wiley & Sons, vol. 9(2), pages 635-660, March.
    7. van Ackere, Ann, 1996. "The management of congestion," European Journal of Operational Research, Elsevier, vol. 89(2), pages 223-225, March.
    8. Lynn, Stephen & Balachandran, Kashi R., 2007. "Allocating costs of a shared server with stochastic service parameters and job class priorities," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1155-1167, August.
    9. V.G. Narayanan & Ratna G. Sarkar, 2002. "The Impact of Activity‐Based Costing on Managerial Decisions at Insteel Industries—A Field Study," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 11(2), pages 257-288, June.
    10. Radhakrishnan, Suresh & Balachandran, Kashi R., 2004. "Service capacity decision and incentive compatible cost allocation for reporting usage forecasts," European Journal of Operational Research, Elsevier, vol. 157(1), pages 180-195, August.
    11. M. Gietzmann & A. Ostaszewski, 1996. "Optimal Disbursement of a Sunk Resource and Decentralised Cost Allocation," Accounting and Business Research, Taylor & Francis Journals, vol. 27(1), pages 17-40.
    12. Wang, E. T. G., 2000. "Information and incentives in computing services supply: The effect of limited system choices," European Journal of Operational Research, Elsevier, vol. 125(3), pages 503-518, September.
    13. Sumita, Ushio & Masuda, Yasushi & Yamakawa, Shigetaka, 2001. "Optimal internal pricing and capacity planning for service facility with finite buffer," European Journal of Operational Research, Elsevier, vol. 128(1), pages 192-205, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:35:y:1989:i:10:p:1264-1273. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.