We study a game-theoretic model of traffic flow assignment with multiple customer groups and a BPR-delay function on a network of parallel links. We prove existence of a unique Nash equilibrium in the game of m > 2 traffic navigation systems and provide closed-form expressions for equilibrium strategies. Finally, we show that under navigation systems’ competitions the average travel time between origin-destination areas increases.