Multi-Agent Parking Problem with Sequential Allocation

Aniello Murano, Silvia Stranieri, Munyque Mittelmann

Abstract: In this paper, we study the multi-agent parking problem with time constraints adopting a game-theoretic perspective. Precisely, cars are modeled as agents interacting among themselves in a multi-player game setting, each of which aims to find a free parking slot that satisfies their constraints. We provide an algorithm for assigning parking slots based on a sequential allocation with priorities. We show that the algorithm always finds a Nash equilibrium solution and we prove its complexity is in quadratic time. The usefulness of our approach is demonstrated by considering its application to the parking area of the Federico II Hospital Company in Naples. Finally, we provide experimental results comparing our algorithm with a greedy allocation and evaluating its performance in the application scenario.