The latter is based on a decomposition of the graph into components and their resolution by a number of fairly involved dynamic programming arrays. On the other hand, we can give polynomial time algorithms for directed acyclic graphs and for cactus graphs in the undirected case.

We show that finding such a path is PSPACE-complete even for bipartite graphs both for the directed and the undirected version of the game. Such a solution is a subgame perfect equilibrium and can be determined by backward induction in the game tree of the associated finite game in extensive form. Immerse yourself into Path to Mnemosyne, a hypnotic adventure created within an infinite zoom Walk the path, explore your mind and. We want to determine the path where each player minimizes its costs taking into account that also the other player acts in a selfish and rational way. The decider in each vertex also has to pay the cost of the chosen edge. The two players take turns in deciding in each vertex which edge to traverse next. In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (agents/players) move together along the edges of a graph from a given starting vertex to a given destination.

The path game