Stable and weakly additive cost sharing in shortest path problems

DOI10.1016/j.jmateco.2023.102921MaRDI QIDQ6146452

Eric Bahel, Juan J. Vidal-Puga, María Gómez-Rúa

Publication date: 5 February 2024

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

zbMATH Keywords

shortest pathadditivitycost sharingcore selection

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• An average lexicographic value for cooperative games
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
• Minimum cost arborescences
• Cost monotonicity, consistency and minimum cost spanning tree games
• Stochastic air freight hub location and flight routes planning
• The stochastic \(p\)-hub center problem with service-level constraints
• Additivity in minimum cost spanning tree problems
• Cost allocation in shortest path games
• On shortest path games
• Minimum incoming cost rules for arborescences
• Shortest path games
• Stable lexicographic rules for shortest path games
• A fair rule in minimum cost spanning tree problems

This page was built for publication: Stable and weakly additive cost sharing in shortest path problems