Decentralized optimal parking lot allocation by static and dynamic two-stage matching

In this paper, we propose an optimal parking lot allocation method based on matching theory that takes into account the desires of both drivers searching for parking lots and parking lot managers. In the conventional method, the allocation calculation is performed centrally, making it difficult to expand the area. We propose a decentralized allocation method that combines static and dynamic matching. In this method, individual drivers and parking lots perform calculations, and the allocation is determined in a decentralized manner through information communication, making it possible to expand the area. Finally, we confirm the effectiveness of the proposed method through numerical simulations.