IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v64y2017i4p271-286.html
   My bibliography  Save this article

Cost allocation rules for elastic single‐attribute situations

Author

Listed:
  • Frank Karsten
  • Marco Slikker
  • Peter Borm

Abstract

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017

Suggested Citation

  • Frank Karsten & Marco Slikker & Peter Borm, 2017. "Cost allocation rules for elastic single‐attribute situations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 271-286, June.
    • Handle: RePEc:wly:navres:v:64:y:2017:i:4:p:271-286
    DOI: 10.1002/nav.21749
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21749
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21749?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
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-1037, September.
    2. Meca, Ana & Timmer, Judith & Garcia-Jurado, Ignacio & Borm, Peter, 2004. "Inventory games," European Journal of Operational Research, Elsevier, vol. 156(1), pages 127-139, July.
      • Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999. "Inventory Games," Other publications TiSEM 21f26b3f-7fae-4f19-908f-a, Tilburg University, School of Economics and Management.
      • Meca, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 2004. "Inventory games," Other publications TiSEM 49368f2d-02fc-49c9-9d74-8, Tilburg University, School of Economics and Management.
      • Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999. "Inventory Games," Discussion Paper 1999-53, Tilburg University, Center for Economic Research.
    3. James E. Falk & Richard M. Soland, 1969. "An Algorithm for Separable Nonconvex Programming Problems," Management Science, INFORMS, vol. 15(9), pages 550-569, May.
    4. Shoshana Anily & Moshe Haviv, 2014. "Subadditive and Homogeneous of Degree One Games Are Totally Balanced," Operations Research, INFORMS, vol. 62(4), pages 788-793, August.
    5. Frank Karsten & Marco Slikker & Geert-Jan van Houtum, 2015. "Resource Pooling and Cost Allocation Among Independent Service Providers," Operations Research, INFORMS, vol. 63(2), pages 476-488, April.
    6. Karsten, Frank & Basten, Rob J.I., 2014. "Pooling of spare parts between multiple users: How to share the benefits?," European Journal of Operational Research, Elsevier, vol. 233(1), pages 94-104.
    7. Frisk, M. & Göthe-Lundgren, M. & Jörnsten, K. & Rönnqvist, M., 2010. "Cost allocation in collaborative forest transportation," European Journal of Operational Research, Elsevier, vol. 205(2), pages 448-458, September.
    8. Angeles de Frutos, M., 1998. "Decreasing Serial Cost Sharing under Economies of Scale," Journal of Economic Theory, Elsevier, vol. 79(2), pages 245-275, April.
    9. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jop Schouten & Mirjam GrooteSchaarsberg & Peter Borm, 2024. "Cost sharing methods for capacity restricted cooperative purchasing situations," Review of Economic Design, Springer;Society for Economic Design, vol. 28(2), pages 347-390, June.
    2. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ulaş Özen & Marco Slikker & Greys Sošić, 2022. "On the core of m$m$‐attribute games," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1770-1787, April.
    2. Loe Schlicher & Marco Slikker & Geert-Jan Houtum, 2018. "Pooling of critical, low-utilization resources with unavailability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 233-263, January.
    3. Padilla Tinoco, Silvia Valeria & Creemers, Stefan & Boute, Robert N., 2017. "Collaborative shipping under different cost-sharing agreements," European Journal of Operational Research, Elsevier, vol. 263(3), pages 827-837.
    4. Hougaard, Jens Leth & Thorlund-Petersen, Lars, 2001. "Mixed serial cost sharing," Mathematical Social Sciences, Elsevier, vol. 41(1), pages 51-68, January.
    5. M. Albizuri & M. Álvarez-Mozos, 2016. "The $$a$$ a -serial cost sharing rule," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 73-86, March.
    6. Albizuri, M. Josune, 2010. "The [alpha]-serial cost-sharing rule," Mathematical Social Sciences, Elsevier, vol. 60(1), pages 24-29, July.
    7. Pham, Ngoc Anh, 2019. "Lorenz comparison between Increasing serial and Shapley value cost-sharing rules," Economics Letters, Elsevier, vol. 179(C), pages 49-52.
    8. Westerink-Duijzer, L.E. & Schlicher, L.P.J. & Musegaas, M., 2019. "Fair allocations for cooperation problems in vaccination," Econometric Institute Research Papers EI2019-06, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Watts, Alison, 2002. "Uniqueness of equilibrium in cost sharing games," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 47-70, February.
    10. Moulin, Herve, 2002. "Axiomatic cost and surplus sharing," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357, Elsevier.
    11. Subiza, Begoña & Silva-Reus, José A. & Peris, Josep E., 2015. "Cost sharing solutions defined by non-negative eigenvectors," European Journal of Operational Research, Elsevier, vol. 244(2), pages 592-600.
    12. LAMAS, ALEJANDRO & CHEVALIER, Philippe, 2013. "Jumping the hurdles for collaboration: fairness in operations pooling in the absence of transfer payments," LIDAM Discussion Papers CORE 2013073, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Leroux, Justin, 2008. "Profit sharing in unique Nash equilibrium: Characterization in the two-agent case," Games and Economic Behavior, Elsevier, vol. 62(2), pages 558-572, March.
    14. Potters, Jos & Sudholter, Peter, 1999. "Airport problems and consistent allocation rules," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 83-102, July.
    15. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    16. Frank Karsten & Marco Slikker & Geert-Jan van Houtum, 2015. "Resource Pooling and Cost Allocation Among Independent Service Providers," Operations Research, INFORMS, vol. 63(2), pages 476-488, April.
    17. Loe Schlicher & Marco Slikker & Willem van Jaarsveld & Geert-Jan van Houtum, 2020. "Core Nonemptiness of Stratified Pooling Games: A Structured Markov Decision Process Approach," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1445-1465, November.
    18. Ana Meca, 2007. "A core-allocation family for generalized holding cost games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(3), pages 499-517, June.
    19. Fiestras-Janeiro, M.G. & García-Jurado, I. & Meca, A. & Mosquera, M.A., 2015. "Cooperation on capacitated inventory situations with fixed holding costs," European Journal of Operational Research, Elsevier, vol. 241(3), pages 719-726.
    20. Kolpin, Van & Wilbur, Dameon, 2005. "Bayesian serial cost sharing," Mathematical Social Sciences, Elsevier, vol. 49(2), pages 201-220, March.

    More about this item

    JEL classification:

    • D74 - Microeconomics - - Analysis of Collective Decision-Making - - - Conflict; Conflict Resolution; Alliances; Revolutions
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:wly:navres:v:64:y:2017:i:4:p:271-286. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.