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

Game Theory and Cost Allocation Problems

Author

Listed:
  • S. H. Tijs

    (Department of Mathematics, University of Nijmegen, Toernooiveld, 6525 ED Nijmegen, The Netherlands)

  • T. S. H. Driessen

    (Department of Applied Mathematics, Twente University of Technology, 7500 AE Enschede, The Netherlands)

Abstract

Problems of allocating joint costs in a reasonable way arise in many practical situations where people decide to work together to save costs. Cost allocation methods based on game theoretical concepts take into account the strategic aspects of cost allocation situations. We give a survey of cost allocation methods based on the nucleolus and the Shapley value, and introduce also a new one, the so-called cost gap allocation method which is based on the \tau -value. It is shown that for some large subclasses of cost allocation problems this new cost allocation method coincides with old separable cost methods proposed in the thirties by the Tennessee Valley Authority and also with the separable costs-remaining benefits (SCRB) method. Properties of this cost gap allocation method are also treated.

Suggested Citation

  • S. H. Tijs & T. S. H. Driessen, 1986. "Game Theory and Cost Allocation Problems," Management Science, INFORMS, vol. 32(8), pages 1015-1028, August.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:8:p:1015-1028
    DOI: 10.1287/mnsc.32.8.1015
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.8.1015
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.8.1015?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
    ---><---

    More about this item

    Keywords

    cost allocation method;

    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:inm:ormnsc:v:32:y:1986:i:8:p:1015-1028. 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.