Autonomous and connected vehicles enable, at least in principle, a coordination of the satnavs of traveling vehicles aimed at assigning paths. On one hand, we aim at eliminating congestion or, in general, at reducing the total travel time in the network. On the other hand, we aim at being fair towards vehicles with the same origin and the same destination. In this talk we tackle the problem of finding a traffic assignment that minimizes the total travel time in the network while guaranteeing that the paths of users with the same origin and the same destination have similar traveling times. Linear and mixed integer models will be presented and tested against the user equilibrium and the system optimum traffic assignments.