Multi-Agent Parking Problem with Sequential Allocation

Aniello Murano, Silvia Stranieri, Munyque Mittelmann

2023

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.

Paper Citation

in Harvard Style

Murano A., Stranieri S. and Mittelmann M. (2023). Multi-Agent Parking Problem with Sequential Allocation. In Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART, ISBN 978-989-758-623-1, pages 484-492. DOI: 10.5220/0011689800003393

in Bibtex Style

@conference{icaart23,
author={Aniello Murano and Silvia Stranieri and Munyque Mittelmann},
title={Multi-Agent Parking Problem with Sequential Allocation},
booktitle={Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART,},
year={2023},
pages={484-492},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011689800003393},
isbn={978-989-758-623-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART,
TI - Multi-Agent Parking Problem with Sequential Allocation
SN - 978-989-758-623-1
AU - Murano A.
AU - Stranieri S.
AU - Mittelmann M.
PY - 2023
SP - 484
EP - 492
DO - 10.5220/0011689800003393