Stable lexicographic rules for shortest path games

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate cost shares to the players according to some lexicographic preference relation. The average of all such lexicographic rules is shown to satisfy many desirable properties (core selection, symmetry, demand additivity,...). Our method relates to what Tijs et. al (2011) refer to as the Alexia value. We propose a procedure allowing to compute these lexicographic allocations for any shortest path game.