Stable and weakly additive cost sharing in shortest path problems

DOI10.1016/J.JMATECO.2023.102921MaRDI QIDQ6146452zbMATH OpenFDO

Authors Eric Bahel, M. Gómez-Rúa, Juan J. Vidal-Puga

Publication date 5 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.JMATECO.2023.102921

zbMATH Keywords

additivitycore selectioncost sharingshortest path

Mathematics Subject Classification ID

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

Recommendations

• Stable lexicographic rules for shortest path games
• Cost allocation in shortest path games
• Axiomatizations of game theoretical solutions for one-output cost sharing problems
• Paths and consistency in additive cost sharing
• Characterization of additive cost sharing methods

Cites work

• A fair rule in minimum cost spanning tree problems
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
• Additivity in minimum cost spanning tree problems
• An average lexicographic value for cooperative games
• Cost allocation in shortest path games
• Cost monotonicity, consistency and minimum cost spanning tree games
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Minimum cost arborescences
• Minimum incoming cost rules for arborescences
• On shortest path games
• Shortest path games
• Stable lexicographic rules for shortest path games
• Stochastic air freight hub location and flight routes planning
• The stochastic p-hub center problem with service-level constraints

Cited in

(2)

• Stable source connection and assignment problems as multi-period shortest path problems
• Merge-proofness and cost solidarity in shortest path games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146452)