On shortest path games

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

Mathematical Methods of Operations Research, 2000, vol. 52, issue 2, 264 pages

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

Keywords: Key words: Cooperative Games; Shortest Path Problem; Balancedness; Shapley Value (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000061 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:52:y:2000:i:2:p:251-264

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860000061

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().