Stable lexicographic rules for shortest path games

DOI10.1016/J.ECONLET.2014.08.033MaRDI QIDQ2345157zbMATH OpenOpenAlexFDO

Authors Eric Bahel, Christian Trudeau

Publication date 19 May 2015

Published in Economics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.econlet.2014.08.033

zbMATH Keywords

algorithmcorelexicographic minimashortest path

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Cost allocation in shortest path games
• Axiomatizations of game theoretical solutions for one-output cost sharing problems
• On shortest path games
• Shortest path games
• On the nucleolus of shortest path games

Cites work

• A discrete cost sharing model with technological cooperation
• A note on two problems in connexion with graphs
• An average lexicographic value for cooperative games
• scientific article; zbMATH DE number 956794 (Why is no real title available?)
• Shortest path games

Cited in

(11)

• Consistency requirements and pattern methods in cost sharing problems with technological cooperation
• Minimum incoming cost rules for arborescences
• Hyperadditive games and applications to networks or matching problems
• Shortest path games
• Stable cost sharing in production allocation games
• A cost sharing example in which subsidies are necessary for stability
• On the set of extreme core allocations for minimal cost spanning tree problems
• Stable and weakly additive cost sharing in shortest path problems
• Stable source connection and assignment problems as multi-period shortest path problems
• Merge-proofness and cost solidarity in shortest path games
• Two-person positive shortest path games have Nash equilibria in pure stationary strategies

This page was built for publication: Stable lexicographic rules for shortest path games

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