IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v9y2015i1p53-76.html
   My bibliography  Save this article

Proportional egalitarian core solution for profit allocation games with an application to collaborative transportation planning

Author

Listed:
  • Bo Dai
  • Haoxun Chen

Abstract

For a profit allocation game, one key issue is to find a fair allocation of profit among its players. In this paper, a proportional egalitarian core solution is proposed, which defines in the core of a game an allocation that takes account of each player's contribution to the grand coalition. This solution concept generalises the egalitarian core solution for cooperative games. To efficiently compute the new solution, a row generation method is developed. The applicability of this new solution concept and the row generation method is demonstrated by an application to a carrier collaboration problem with numerical experiment results. [Received 12 November 2012; Revised 30 July 2013; Accepted 08 September 2013]

Suggested Citation

  • Bo Dai & Haoxun Chen, 2015. "Proportional egalitarian core solution for profit allocation games with an application to collaborative transportation planning," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 9(1), pages 53-76.
    • Handle: RePEc:ids:eujine:v:9:y:2015:i:1:p:53-76
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=67456
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Mathijs van Zon & Remy Spliet & Wilco van den Heuvel, 2021. "The Joint Network Vehicle Routing Game," Transportation Science, INFORMS, vol. 55(1), pages 179-195, 1-2.
    2. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    3. Rasulkhani, Saeid & Chow, Joseph Y.J., 2019. "Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 60-81.
    4. Ching-Hui Tang, 2018. "Two-stage stochastic modeling of transportation outsourcing plans for transshipment centers," 4OR, Springer, vol. 16(1), pages 67-94, March.
    5. 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.
    6. Bo Dai & Fenfen Li & Yunchong Liu, 2022. "A Profit Allocation Mechanism for Customer-to-Manufacturer Platform in e-Commercial Business," SAGE Open, , vol. 12(2), pages 21582440221, May.
    7. van Zon, M. & Spliet, R. & van den Heuvel, W., 2021. "The effect of algorithm capabilities on cooperative games," Econometric Institute Research Papers EI2021-02, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:ids:eujine:v:9:y:2015:i:1:p:53-76. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.