IDEAS home Printed from https://ideas.repec.org/a/wsi/igtrxx/v22y2020i01ns0219198919500105.html
   My bibliography  Save this article

Cost Allocation in Common Facilities Sharing

Author

Listed:
  • Federica Briata

    (Department of Mechanical, Energy, Management and Transportation Engineering, University of Genova, Genova GE, Italy)

  • Vito Fragnelli

    (Department of Sciences and Innovative Technologies, University of Eastern Piedmont, 13100 Vercelli VC, Italy)

Abstract

Briata, F. and Fragnelli, V. [2017] Free-riding in common facility sharing, in Transaction on Computation Collective Intelligence XXVII, pp. 129–138. dealt with the inefficiency and the free-riding situations that may arise from sharing the maintenance cost of a facility among its potential users and from dividing the cost of a check to assess who the users are among the agents that asked for it.They introduced two mechanisms for reducing the free-riding behaviors and considered the possibility that the check provides also information on the level at which the facility is used by each agent.In this paper, we improve the profitability of the check, introducing a TU-cost game for determining the quota of the total cost assigned to each agent in order to satisfy as many agents as possible. Two solutions are proposed and analyzed and the balancedness of the TU-cost game is studied and characterized.

Suggested Citation

  • Federica Briata & Vito Fragnelli, 2020. "Cost Allocation in Common Facilities Sharing," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 22(01), pages 1-18, March.
  • Handle: RePEc:wsi:igtrxx:v:22:y:2020:i:01:n:s0219198919500105
    DOI: 10.1142/S0219198919500105
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219198919500105
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0219198919500105?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:igtrxx:v:22:y:2020:i:01:n:s0219198919500105. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/igtr/igtr.shtml .

    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.