The emergent carpooling phenomenon has known a great success throughout the world [1] thanks to efforts developed in this context. Several of the studied works failed and some of them led to operational systems but not without having many drawbacks. Thus, in this paper, we present our works through which we attempt to remedy those limits mainly aiming at providing users with optimized responses to instantaneously issued queries. For this purpose, we primarily focus on useful concepts to reduce real time carpooling's high complexity. The most important among them are a decomposition process to establish a distributed dynamic graph representing the served network and the multi agent concept to perform parallel Optimized and Distributed Assignment of Vehicles (ODAVe) to users' queries.