CON2PAS: A Constrained Congestion Game for Parking Space Assignment
Résumé
In this paper, we address the problem of efficiently finding parking slots in a competitive parking setting. For this purpose, we model the parking assignment problem as a constrained singleton congestion game, denoted as Con2Pas. In our proposal, vehicles act as non-cooperative players in search of the best free parking slots satisfying their requirements among the available ones. We first study the existence of a Nash equilibrium for the proposed game. Then, we show through extensive simulations that Con2Pas outperforms greedy approaches in general and achieves a close performance to that of centralized ones.