This work focuses on investigating parking problems with time constraints using a game-theoretic approach, specifically in a multi-gate scenario. The cars are treated as agents in a multi-player game where they compete for parking spots at entry gates that have no limit. We propose a priority-based algorithm for allocating parking spaces to address the problem. This algorithm guarantees a Nash equilibrium solution in quadratic time, which depends on the number of cars rather than on the number of gates. Additionally, we compare the performance of the proposed algorithm to a Greedy allocation method. The experimental results indicate the effectiveness of the proposed algorithm. Overall, the study highlights the potential of game-theoretic approaches for solving parking problems.
Parking Problem with Multiple Gates / Noviello, F.; Mittelmann, M.; Murano, A.; Stranieri, S.. - 13955:(2023), pp. 213-224. [10.1007/978-3-031-37616-0_18]
Parking Problem with Multiple Gates
Mittelmann M.Membro del Collaboration Group
;Murano A.
Supervision
;Stranieri S.Membro del Collaboration Group
2023
Abstract
This work focuses on investigating parking problems with time constraints using a game-theoretic approach, specifically in a multi-gate scenario. The cars are treated as agents in a multi-player game where they compete for parking spots at entry gates that have no limit. We propose a priority-based algorithm for allocating parking spaces to address the problem. This algorithm guarantees a Nash equilibrium solution in quadratic time, which depends on the number of cars rather than on the number of gates. Additionally, we compare the performance of the proposed algorithm to a Greedy allocation method. The experimental results indicate the effectiveness of the proposed algorithm. Overall, the study highlights the potential of game-theoretic approaches for solving parking problems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
