A reservation system with an efficient matching-and-scheduling mechanism for private parking-sharing programs

P. Yan (1) , X. Cai (2) , Feng Chu (3) , D. Ni (2)

1 UESTC - School of Management and Economics [Chengdu]
2 Shenzhen Key Laboratory of IoT Intelligent Systems and Wireless Network Technology
3 IBISC - Informatique, BioInformatique, Systèmes Complexes

We design a smart parking-sharing reservation system composed of three modules: Pre-processing, matching, and pricing. With the announced supply and demand information, the pre-processing module identifies a set of feasible parking slots for each driver concerning the compatibility of slot supply for the driver's demand. The matching module generates a system-wide optimal matching solution and further schedules the driver's parking time by using the flexibility of driver travel plans. The pricing module adopts a novel VCG-based pricing to determine the parking fees of drivers under an incomplete information setting in which each driver (player) cannot obtain the knowledge of the other competitors (players) who will compete against her. We find that the designed reservation system can not only elicit drivers' truthful demand reports but also achieve the optimal performance of the system. In this short paper we briefly describe our system and the main solution approaches we use. © WMSCI 2021.All right reserved.

Keywords: Incomplete information; Matching and Scheduling; Parking reservation system; Parking sharing

Domains: Computer Science [cs]; Operations Research [cs.RO]

P. Yan, X. Cai, Feng Chu, D. Ni. A reservation system with an efficient matching-and-scheduling mechanism for private parking-sharing programs. 25th World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI 2021), Jul 2021, Orlando, Fl. (Virtual), United States. pp.22--24. ⟨hal-03435875⟩