IDEAS home Printed from https://ideas.repec.org/a/bla/jacrfn/v10y1997i3p117-124.html
   My bibliography  Save this article

The End of Cost Allocations as We Know Them

Author

Listed:
  • Marc Hodak

Abstract

Cost allocation issues have befuddled management around the world for over a century. And, because of “informational asymmetries” and agency conflicts between operating management and headquarters, there is no clear theoretical solution to the problem. Nevertheless, there are good reasons for allocating costs. If properly structured, transfer‐pricing schemes can serve the same purpose as a market price. By communicating useful information about the relative scarcity of resources within an organization, they can serve to balance supply and demand for the product or service being priced. Unfortunately, most transfer‐pricing approaches, like Activity Based Costing, attempt to solve the problem by refining standard cost measures. In contrast to ABC, this article begins by recognizing that efforts to develop more precise cost allocations are bound to be frustrated by the information and incentive problems noted above. And in place of more precisely formulated measures of cost, the author proposes a process of negotiation between two parties to an exchange—a process that is reinforced by a performance measurement system that gives both parties incentives to reveal their “reservation” prices for the good or service in question. For transfers involving multiple users of a given service or products, the author recommends a transfer auction process that is also designed to make would‐be users reveal their assessments of value.

Suggested Citation

  • Marc Hodak, 1997. "The End of Cost Allocations as We Know Them," Journal of Applied Corporate Finance, Morgan Stanley, vol. 10(3), pages 117-124, September.
  • Handle: RePEc:bla:jacrfn:v:10:y:1997:i:3:p:117-124
    DOI: 10.1111/j.1745-6622.1997.tb00152.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1745-6622.1997.tb00152.x
    Download Restriction: no

    File URL: https://libkey.io/10.1111/j.1745-6622.1997.tb00152.x?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. S. Leitner & D.A. Behrens, 2015. "On the efficiency of hurdle rate-based coordination mechanisms," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 21(5), pages 413-431, September.

    More about this item

    Statistics

    Access and download statistics

    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:bla:jacrfn:v:10:y:1997:i:3:p:117-124. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=1078-1196 .

    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.