Cooperation versus competition towards an efficient parking assignment solution - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Cooperation versus competition towards an efficient parking assignment solution

Naourez Mejri
  • Function : Author
Mouna Ayari
  • Function : Author
  • PersonId : 967870
Rami Langar
Farouk Kamoun
  • Function : Author
Guy Pujolle
Leila Azouz Saidane
  • Function : Author

Abstract

Cars cruising for parking adds a non negligible amount to traffic congestion and CO2 pollution. Hence, good parking management policies are required to reduce such discomfort. In this paper, we address this problem from two sides. First, we consider how local parking authorities called parking coordinators (PC) can optimize the distribution of the slots they manage through a full cooperation between them. Second, we model the problem as a congestion game, where vehicles act as players who will eventually choose the best parking garage for them, while minimizing the whole network cost. We study the effectiveness of both schemes (i.e, PC-aware and game theoretic approaches) in various contexts and compare them with the reference centralized model as well as a greedy approach. Simulation results show that our proposals provide high request satisfaction ratio, close to the optimal baseline approach and outperform the greedy method up to 30%, while ensuring a fair distribution of slots through the network.
No file

Dates and versions

hal-01216581 , version 1 (16-10-2015)

Identifiers

Cite

Naourez Mejri, Mouna Ayari, Rami Langar, Farouk Kamoun, Guy Pujolle, et al.. Cooperation versus competition towards an efficient parking assignment solution. IEEE International Conference on Communications, ICC 2014, Jun 2014, Sydney, Australia. pp.2915-2920, ⟨10.1109/ICC.2014.6883767⟩. ⟨hal-01216581⟩
61 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More