CON2PAS: A Constrained Congestion Game for Parking Space Assignment - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

CON2PAS: A Constrained Congestion Game for Parking Space Assignment

Abstract

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.
No file

Dates and versions

hal-01672755 , version 1 (27-12-2017)

Identifiers

Cite

Naourez Mejri, Mouna Ayari, Rami Langar, Leila Azouz Saidane. CON2PAS: A Constrained Congestion Game for Parking Space Assignment. IFIP PEMWN 2016, Nov 2016, Paris, France. ⟨10.1109/PEMWN.2016.7842894⟩. ⟨hal-01672755⟩
180 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More