On shortest path games

Vito Fragnelli; Ignacio García-Jurado; Luciano Méndez-Naya

doi:10.1007/s001860000061

On shortest path games

Vito Fragnelli
, Ignacio García-Jurado
, Luciano Méndez-Naya

Risultato della ricerca: Contributo su rivista › Articolo in rivista › peer review

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.

Lingua originale	Inglese
pagine (da-a)	251-264
Numero di pagine	14
Rivista	Mathematical Methods of Operations Research
Volume	52
Numero di pubblicazione	2
DOI	https://doi.org/10.1007/s001860000061
Stato di pubblicazione	Pubblicato - nov 2000
Pubblicato esternamente	Sì

Accesso al documento

10.1007/s001860000061

Altri file e collegamenti

Link to publication in Scopus

Cita questo

@article{9d851ba9c46f4ce4a23d7d0a0455a9b2,

title = "On shortest path games",

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.",

keywords = "Balancedness, Cooperative Games, Shapley Value, Shortest Path Problem",

author = "Vito Fragnelli and Ignacio Garc{\'i}a-Jurado and Luciano M{\'e}ndez-Naya",

year = "2000",

month = nov,

doi = "10.1007/s001860000061",

language = "English",

volume = "52",

pages = "251--264",

journal = "Mathematical Methods of Operations Research",

issn = "1432-2994",

publisher = "Physica-Verlag",

number = "2",

}

TY - JOUR

T1 - On shortest path games

AU - Fragnelli, Vito

AU - García-Jurado, Ignacio

AU - Méndez-Naya, Luciano

PY - 2000/11

Y1 - 2000/11

N2 - 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.

AB - 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.

KW - Balancedness

KW - Cooperative Games

KW - Shapley Value

KW - Shortest Path Problem

UR - https://www.scopus.com/pages/publications/2242434732

U2 - 10.1007/s001860000061

DO - 10.1007/s001860000061

M3 - Article

SN - 1432-2994

VL - 52

SP - 251

EP - 264

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

IS - 2

ER -

On shortest path games

Abstract

Accesso al documento

Altri file e collegamenti

Fingerprint

Cita questo