Company fleets are deployed in road networks to accomplish tasks within a given time frame. When we deploy a whole company fleet of professional vehicles we face the problem of dispatching the optimal one, in terms of service time. This is a major problem in logistics, since customers are demanding on getting their job done. Modern systems employ wireless mediums with Road Side Units (RSU) to monitor and predict traffic, as well as to provide real-time information on passing vehicles about the state of congestion in nearby roads. Delay and flow of information are critical factors in such cases. In this paper, we select a distributed installation of traffic lights wireless stations to perform routing among vehicles that belong to the same fleet. Hence, we have a sense of locality of the information as well as an overall view of the road network. We differentiate the vehicles of a company fleet to domains, where in every domain the participating vehicles maximise their utility functions to assign the optimal vehicle, in terms of service time. To this end, we formulate the selection of the optimal vehicle to perform a task in a game theoretic manner and we prove that it is a potential game. We show that the price of stability is 1 and give the bounds for the price of anarchy. We show results of our approach that the game play of the vehicles' strategies maximise the overall utility of the domain of company vehicle fleet.