Nothing Special   »   [go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/crb/wpaper/2023-08.html
   My bibliography  Save this paper

Schedule Situations and their Cooperative Game Theoretic Representations

Author

Listed:
  • Léa Munich

    (Université de Franche-Comté, CRESE, F-25000 Besançon, France)

Abstract
In this paper, we optimize and allocate the costs of a non-rival common-pool resource among several users. In such a so-called schedule situation the players have different demands given by distinct subsets of periods satisfying their needs. The total costs resulting from shared use of the resource are allocated by natural allocations called Equal Pooling allocations, in which the cost of each needed period is shared equally among the users of this period. The associated schedule game gives, for each coalition of players, the minimal cost of a period configuration satisfying the needs of all its members. We have three main contributions. First, we provide several sufficient conditions for the non-emptiness of the core of a schedule game. Second, we prove that under some of these conditions the Shapley value is in the core and coincides with some Equal pooling allocation. Third, we establish connections with other classes of operational research games. Furthermore, we present an application to the allocation of the common costs of the mail carrier route of La Poste, the french postal operator.

Suggested Citation

  • Léa Munich, 2023. "Schedule Situations and their Cooperative Game Theoretic Representations," Working Papers 2023-08, CRESE.
    • Handle: RePEc:crb:wpaper:2023-08
    as

    Download full text from publisher

    File URL: https://crese.univ-fcomte.fr/uploads/wp/WP-2023-08.pdf
    File Function: First version, 2023
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Csóka, Péter & Illés, Ferenc & Solymosi, Tamás, 2022. "On the Shapley value of liability games," European Journal of Operational Research, Elsevier, vol. 300(1), pages 378-386.
    2. Hougaard, Jens Leth & Moulin, Hervé, 2014. "Sharing the cost of redundant items," Games and Economic Behavior, Elsevier, vol. 87(C), pages 339-352.
    3. M. Fiestras-Janeiro & Ignacio García-Jurado & Manuel Mosquera, 2011. "Rejoinder on: Cooperative games and cost allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 33-34, July.
    4. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
    5. 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.
    6. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    7. Jens Leth Hougaard & Hervé Moulin, 2018. "Sharing the cost of risky projects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(3), pages 663-679, May.
    8. Hervé Moulin, 2013. "Cost Sharing In Networks: Some Open Questions," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-10.
    9. Hougaard, Jens Leth & Tvede, Mich, 2022. "Trouble comes in threes: Core stability in minimum cost connection networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 319-324.
    10. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    11. Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.
    12. M. Fiestras-Janeiro & Ignacio García-Jurado & Manuel Mosquera, 2011. "Cooperative games and cost allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 1-22, July.
    13. Sudhölter, Peter & Zarzuelo, José M., 2017. "Characterizations of highway toll pricing methods," European Journal of Operational Research, Elsevier, vol. 260(1), pages 161-170.
    14. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    15. Moulin, Herve & Laigret, Francois, 2011. "Equal-need sharing of a network under connectivity constraints," Games and Economic Behavior, Elsevier, vol. 72(1), pages 314-320, May.
    Full references (including those not matched with items on IDEAS)

    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. Munich, Léa, 2024. "Schedule situations and their cooperative game theoretic representations," European Journal of Operational Research, Elsevier, vol. 316(2), pages 767-778.
    2. Léa Munich, 2023. "Schedule Situations and their Cooperative Games," Working Papers of BETA 2023-08, Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg.
    3. Gómez-Rodríguez, Marcos & Davila-Pena, Laura & Casas-Méndez, Balbina, 2024. "Cost allocation problems on highways with grouped users," European Journal of Operational Research, Elsevier, vol. 316(2), pages 667-679.
    4. García-Martínez, Jose A. & Mayor-Serra, Antonio J. & Meca, Ana, 2020. "Efficient Effort Equilibrium in Cooperation with Pairwise Cost Reduction," MPRA Paper 105604, University Library of Munich, Germany.
    5. Algaba, Encarnación & Béal, Sylvain & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Relationship between labeled network games and other cooperative games arising from attributes situations," Economics Letters, Elsevier, vol. 185(C).
    6. Dan C. Popescu & Philip Kilby, 2020. "Approximation of the Shapley value for the Euclidean travelling salesman game," Annals of Operations Research, Springer, vol. 289(2), pages 341-362, June.
    7. Stefano Moretti & Henk Norde, 2022. "Some new results on generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 87-118, March.
    8. Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2018. "The proportional Shapley value and applications," Games and Economic Behavior, Elsevier, vol. 108(C), pages 93-112.
    9. Yuntong Wang, 2013. "An Axiomatic Approach to the Airline Emission Fees Problem," Working Papers 1308, University of Windsor, Department of Economics.
    10. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    11. van Beek, Andries, 2023. "Solutions in multi-actor projects with collaboration and strategic incentives," Other publications TiSEM 3739c498-5edb-442f-87d8-c, Tilburg University, School of Economics and Management.
    12. Bergantiños, Gustavo & Gómez-Rúa, María & Llorca, Natividad & Pulido, Manuel & Sánchez-Soriano, Joaquín, 2020. "Allocating costs in set covering problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1074-1087.
    13. Debing Ni & Yuntong Wang, 2013. "Additive cost sharing on a tree," Working Papers 1307, University of Windsor, Department of Economics.
    14. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2019. "On how to allocate the fixed cost of transport networks," ThE Papers 19/03, Department of Economic Theory and Economic History of the University of Granada..
    15. Wu, Hao & van den Brink, René & Estévez-Fernández, Arantza, 2024. "Highway toll allocation," Transportation Research Part B: Methodological, Elsevier, vol. 180(C).
    16. Algaba, Encarnación & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Horizontal cooperation in a multimodal public transport system: The profit allocation problem," European Journal of Operational Research, Elsevier, vol. 275(2), pages 659-665.
    17. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2020. "Manipulability in the cost allocation of transport systems," ThE Papers 20/08, Department of Economic Theory and Economic History of the University of Granada..
    18. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On how to allocate the fixed cost of transport systems," Annals of Operations Research, Springer, vol. 301(1), pages 81-105, June.
    19. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    20. Hao Wu & Rene van den Brink & Arantza Estevez-Fernandez, 2022. "Highway toll allocation," Tinbergen Institute Discussion Papers 22-036/II, Tinbergen Institute.

    More about this item

    Keywords

    Game theory; Schedule; OR-game; Cost allocation; Equal pooling allocations;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • L87 - Industrial Organization - - Industry Studies: Services - - - Postal and Delivery Services

    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:crb:wpaper:2023-08. 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: Lauent Kondratuk (email available below). General contact details of provider: https://edirc.repec.org/data/crufcfr.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.