Abstract
This paper corrects and modifies some properties of the Iryo's (2011) solution algorithm of Nash equilibrium in dynamic traffic assignment, in which each discretized vehicle is assigned on its shortest path one-by-one in an appropriate order. Specifically, we first give a counterexample to the theorem that guarantees the algorithm produces a Nash equilibrium solution for single destination networks. This example shows that it is almost impossible to obtain the Nash equilibrium by assigning each vehicle in the order based on that theorem. We then prove the existence of an appropriate vehicle assignment order for single destination networks, which guarantees the applicability of the Iryo's algorithm to those networks.
