Congestion network problems and related games

DOI10.1016/j.ejor.2004.11.003zbMath1111.90019OpenAlexW2119882176MaRDI QIDQ2488915

Marieke Quant, P. E. M. Borm, Hans Reijnierse

Publication date: 16 May 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/1a0fb713-6949-42cb-96f1-408689618895

zbMATH Keywords

CoreCongestionCooperative gamesNetwork problems

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic network models in operations research (90B10)

Related Items (8)

Strategic decentralization in binary choice composite congestion games ⋮ Public congestion network situations and related games ⋮ A new rule for source connection problems ⋮ A review on cost allocation methods in collaborative transportation ⋮ Stable cost sharing in production allocation games ⋮ Network flow problems and permutationally concave games ⋮ A cost sharing example in which subsidies are necessary for stability ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Operations research games: A survey. (With comments and rejoinder)
• Cost allocation in spanning network enterprises with stochastic connection costs.
• Potential games
• A cost allocation problem arising in hub-spoke network systems
• The \(P\)-value for cost sharing in minimum
• A class of games possessing pure-strategy Nash equilibria
• Minimum cost spanning tree games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: Congestion network problems and related games