Skip to main content
SpringerLink
Log in

On shortest path games

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dipartimento di Scienze e Tecnologie Avanzate, Università del Piemonte Orientale, Corso Borsalino 54, 15100, Alessandria, Italy (e-mail: fragnell@unipmn.it), , , , , , IT

    Vito Fragnelli

  2. Department of Statistics and OR, Faculty of Mathematics, Universidad de Santiago de Compostela, 15771 Santiago de Compostela, Spain (e-mail: ignacio@zmat.usc.es), , , , , , ES

    Ignacio García-Jurado

  3. Departamento de Métodos Cuantitativos, Facultad de Económicas, Universidad de Santiago de Compostela, 15771 Santiago de Compostela, Spain (e-mail: eclmn1@usc.es), , , , , , ES

    Luciano Méndez-Naya

Authors
  1. Vito Fragnelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignacio García-Jurado
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luciano Méndez-Naya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: November 1999/Final version received: February 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fragnelli, V., García-Jurado, I. & Méndez-Naya, L. On shortest path games. Mathematical Methods of OR 52, 251–264 (2000). https://doi.org/10.1007/s001860000061

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860000061

Search

Navigation