Parking slot assignment games
Authors:
Open Access
- 1 November 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 299-308
Abstract
With the proliferation of location-based services, mobile devices, and embedded wireless sensors, more and more applications are being developed to improve the efficiency of the transportation system. In particular, new applications are arising to help vehicles locate open parking spaces. Nevertheless, while engaged in driving, travelers are better suited being guided to a particular and ideal parking slot, than looking at a map and choosing which spot to go to. Then the question of how an application should choose this ideal parking spot becomes relevant. Vehicular parking can be viewed as vehicles (players) competing for parking slots (resources with different costs). Based on this competition, we present a game-theoretic framework to analyze parking situations. We introduce and analyze Parking Slot Assignment Games (Psag) in complete and incomplete information contexts. For both models we present algorithms for individual players to choose parking spaces ideally. To evaluate the more realistic incomplete information Psag, simulations were performed to test the performance of various proposed algorithms.Keywords
Funding Information
- Division of Graduate Education (DGE-0549489)
This publication has 14 references indexed in Scilit:
- Reaching Available Public Parking Spaces in Urban Environments Using Ad Hoc Networking2011
- Generalized efficiency bounds in distributed resource allocation2010
- Optimal matching between spatial datasets under capacity constraintsACM Transactions on Database Systems, 2010
- Equilibria in Dynamic Selfish Routing2009
- Cruising for parkingTransport Policy, 2006
- Dissemination of Spatial-Temporal Information in Mobile Networks with HotspotsLecture Notes in Computer Science, 2005
- A New Gravitational Clustering Algorithm2003
- How bad is selfish routing?Journal of the ACM, 2002
- Gravitational clusteringPattern Recognition, 1977
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences, 1950