Cost allocation in shortest path games

DOI10.1007/s001860200222zbMath1071.91007OpenAlexW2141018446MaRDI QIDQ1396937

Sofia Grahn, Mark Voorneveld

Publication date: 14 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/1930

zbMATH Keywords

strong Nash equilibriumshortest path problems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Noncooperative games (91A10) Cooperative games (91A12) Games involving graphs (91A43)

Related Items (8)

Operations research games: A survey. (With comments and rejoinder) ⋮ The proportional Shapley value and applications ⋮ Proof systems and transformation games ⋮ Computing the strong Nash equilibrium for Markov chains games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ The minimum cost shortest-path tree game ⋮ Modeling cooperation on a class of distribution problems

This page was built for publication: Cost allocation in shortest path games