IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v52y2000i2p251-264.html
   My bibliography  Save this article

On shortest path games

Author

Listed:
  • Vito Fragnelli
  • Ignacio García-Jurado
  • Luciano Méndez-Naya

Abstract

A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided. Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • Vito Fragnelli & Ignacio García-Jurado & Luciano Méndez-Naya, 2000. "On shortest path games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 251-264, November.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:2:p:251-264
    DOI: 10.1007/s001860000061
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000061
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000061?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.

    Citations

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


    Cited by:

    1. 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.
    2. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2021. "Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations," Annals of Operations Research, Springer, vol. 302(1), pages 23-47, July.
    3. 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.
    4. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    5. Miklós Pintér & Anna Radványi, 2013. "The Shapley value for shortest path games: a non-graph-based approach," 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. 21(4), pages 769-781, December.
    6. Andreas Darmann & Christian Klamler & Ulrich Pferschy, 2015. "Sharing the Cost of a Path," Studies in Microeconomics, , vol. 3(1), pages 1-12, June.
    7. F. Fernández & J. Puerto, 2012. "The minimum cost shortest-path tree game," Annals of Operations Research, Springer, vol. 199(1), pages 23-32, October.
    8. Perea, F. & Puerto, J. & Fernández, F.R., 2009. "Modeling cooperation on a class of distribution problems," European Journal of Operational Research, Elsevier, vol. 198(3), pages 726-733, November.
    9. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2019. "Cohesive efficiency in TU-games: Two extensions of the Shapley value," Working Papers 2019-03, CRESE.
    10. 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.
    11. Molinero, Xavier & Riquelme, Fabián & Serna, Maria, 2015. "Forms of representation for simple games: Sizes, conversions and equivalences," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 87-102.
    12. Pantelidis, Theodoros P. & Chow, Joseph Y.J. & Rasulkhani, Saeid, 2020. "A many-to-many assignment game and stable outcome algorithm to evaluate collaborative mobility-as-a-service platforms," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 79-100.
    13. Grahn, Sofia, 2001. "Core and Bargaining Set of Shortest Path Games," Working Paper Series 2001:3, Uppsala University, Department of Economics.

    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:spr:mathme:v:52:y:2000:i:2:p:251-264. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.