A strategic flow model of traffic assignment in static capacitated networks

This work pleads for the use of the concept of strategies, and their network-theoretic representation as hyperpaths, for modeling network assignment problems. While this concept describes adequately the behavior of users in transit systems, we show that it can apply as well to networks where arc capacities are rigid. This opens up a whole new field of research and raises several questions, from both the theoretical and computational points of view. These are investigated in the paper.