For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These …

three agent games in characteristic function form to anonymous pillage games, we find: when the core is non-empty, it must … take one of five forms; all such games with an empty core represent the same dominance relation. When a stable set exists …, and may contain continua. Finally, we provide an algorithm for computing the stable set, and can easily decide non …

anonymous, three agent pillage games we show that: when the core is non-empty, it must take one of five forms; all such pillage … games with an empty core represent the same dominance relation; when a stable set exists, and the game also satisfies a …

particular strategy/algorithm combination is shown to consistently produce superior results when compared to the other …

graph theory literature. A concept on a typical probability graph was defined and a shortest-path algorithm was formulated …

For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance …

For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance … requires a heuristic estimate, a real-valued function on the set of nodes. %This algorithm distinguishes between the main phase …