IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00876006.html
   My bibliography  Save this paper

A sharing mechanism for superadditive and non-superadditive logistics cooperation

Author

Listed:
  • Xiaozhou Xu

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

  • Shenle Pan

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

  • Eric Ballot

    (CGS i3 - Centre de Gestion Scientifique i3 - Mines Paris - PSL (École nationale supérieure des mines de Paris) - PSL - Université Paris Sciences et Lettres - I3 - Institut interdisciplinaire de l’innovation - CNRS - Centre National de la Recherche Scientifique)

Abstract

The lack of a stable, fair and generally applicable sharing mechanism is one of the most noticeable impediments to the implementation of logistics cooperation. Most of the current literature on the sharing mechanism in logistics cooperation focuses on superadditive logistics cooperation games, neglecting the probable occurrence of other types of games resulting from coordination cost and unequal partners. In this work, we propose a sharing model based on game theoretic solutions, taking account of the bargaining power of players to identify a fair in-Core allocation. Under full cooperation assumption, we generalize this model for non-superadditive logistics cooperation games with coordination costs at different levels. The games with empty Core are also studied within the model.

Suggested Citation

  • Xiaozhou Xu & Shenle Pan & Eric Ballot, 2013. "A sharing mechanism for superadditive and non-superadditive logistics cooperation," Post-Print halshs-00876006, HAL.
    • Handle: RePEc:hal:journl:halshs-00876006
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00876006v1
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00876006v1/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Audy, Jean-François & D’Amours, Sophie & Rönnqvist, Mikael, 2012. "An empirical study on coalition formation and cost/savings allocation," International Journal of Production Economics, Elsevier, vol. 136(1), pages 13-27.
    2. Dror, Moshe & Hartman, Bruce C. & Chang, Wei, 2012. "The cost allocation issue in joint replenishment," International Journal of Production Economics, Elsevier, vol. 135(1), pages 242-254.
    3. Groothedde, Bas & Ruijgrok, Cees & Tavasszy, Lóri, 2005. "Towards collaborative, intermodal hub networks: A case study in the fast moving consumer goods market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 567-583, November.
    4. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    5. AUMANN, Robert J. & DREZE, Jacques H., 1974. "Cooperative games with coalition structures," LIDAM Reprints CORE 217, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Cruijssen, Frans & Cools, Martine & Dullaert, Wout, 2007. "Horizontal cooperation in logistics: Opportunities and impediments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 129-142, March.
    7. Konishi, Hideo & Ray, Debraj, 2003. "Coalition formation as a dynamic process," Journal of Economic Theory, Elsevier, vol. 110(1), pages 1-41, May.
    8. Ozlem Ergun & Gultekin Kuyzu & Martin Savelsbergh, 2007. "Reducing Truckload Transportation Costs Through Collaboration," Transportation Science, INFORMS, vol. 41(2), pages 206-221, May.
    9. M. Maschler & B. Peleg & L. S. Shapley, 1979. "Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 303-338, November.
    10. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
    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. Vanessa Rodríguez Cornejo & Ángel Cervera Paz & Luis López Molina & Víctor Pérez-Fernández, 2020. "Lean Thinking to Foster the Transition from Traditional Logistics to the Physical Internet," Sustainability, MDPI, vol. 12(15), pages 1-17, July.
    2. Ramaekers, Katrien & Verdonck, Lotte & Caris, An & Meers, Dries & Macharis, Cathy, 2017. "Allocating collaborative costs in multimodal barge networks for freight bundling," Journal of Transport Geography, Elsevier, vol. 65(C), pages 56-69.

    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. Basso, Franco & Guajardo, Mario & Varas, Mauricio, 2020. "Collaborative job scheduling in the wine bottling process," Omega, Elsevier, vol. 91(C).
    2. Kimms, A. & Kozeletskyi, I., 2016. "Core-based cost allocation in the cooperative traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 910-916.
    3. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, December.
    4. Chabot, Thomas & Bouchard, Florence & Legault-Michaud, Ariane & Renaud, Jacques & Coelho, Leandro C., 2018. "Service level, cost and environmental optimization of collaborative transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 1-14.
    5. Palsule-Desai, Omkar D. & Tirupati, Devanath & Chandra, Pankaj, 2013. "Stability issues in supply chain networks: Implications for coordination mechanisms," International Journal of Production Economics, Elsevier, vol. 142(1), pages 179-193.
    6. Mingming Leng & Chunlin Luo & Liping Liang, 2021. "Multiplayer Allocations in the Presence of Diminishing Marginal Contributions: Cooperative Game Analysis and Applications in Management Science," Management Science, INFORMS, vol. 67(5), pages 2891-2903, May.
    7. Behzad Hezarkhani & Marco Slikker & Tom Woensel, 2016. "A competitive solution for cooperative truckload delivery," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 51-80, January.
    8. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.
    9. 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.
    10. Geoffroy de Clippel & Roberto Serrano, 2008. "Marginal Contributions and Externalities in the Value," Econometrica, Econometric Society, vol. 76(6), pages 1413-1436, November.
    11. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    12. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    13. Greys Soši'{c}, 2006. "Transshipment of Inventories Among Retailers: Myopic vs. Farsighted Stability," Management Science, INFORMS, vol. 52(10), pages 1493-1508, October.
    14. Arslan, Okan & Archetti, Claudia & Jabali, Ola & Laporte, Gilbert & Grazia Speranza, Maria, 2020. "Minimum cost network design in strategic alliances," Omega, Elsevier, vol. 96(C).
    15. Guajardo, Mario & Rönnqvist, Mikael & Flisberg, Patrik & Frisk, Mikael, 2018. "Collaborative transportation with overlapping coalitions," European Journal of Operational Research, Elsevier, vol. 271(1), pages 238-249.
    16. Inés Macho-Stadler & David Pérez-Castrillo & David Wettstein, 2004. "Sharing the surplus: A just and efficient proposal for environments with externalities," UFAE and IAE Working Papers 611.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    17. Shitao Yang & Jiangao Zhang & Shaorui Zhou, 2024. "The cost transportation game for collaboration among transportation companies," Annals of Operations Research, Springer, vol. 336(3), pages 1479-1503, May.
    18. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    19. Besner, Manfred, 2022. "The grand surplus value and repeated cooperative cross-games with coalitional collaboration," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    20. Licun Xue & Lingling Zhang, 2012. "Bidding and sequential coalition formation with externalities," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 49-73, February.

    More about this item

    Keywords

    Logistics cooperation; game-theoretical approach; bargaining power; non-superadditive game in logistics;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:journl:halshs-00876006. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.