Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Combinatorial optimization
Journal of the ACM (JACM)
Algorithmic Game Theory
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
A cooperative reservation protocol for parking spaces in vehicular ad hoc networks
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Optimal matching between spatial datasets under capacity constraints
ACM Transactions on Database Systems (TODS)
ParkNet: drive-by sensing of road-side parking statistics
Proceedings of the 8th international conference on Mobile systems, applications, and services
Reaching Available Public Parking Spaces in Urban Environments Using Ad Hoc Networking
MDM '11 Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 01
Dissemination of spatial-temporal information in mobile networks with hotspots
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Pricing of parking for congestion reduction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Spatio-temporal matching algorithms for road networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
iPark: identifying parking spaces from trajectories
Proceedings of the 16th International Conference on Extending Database Technology
Probabilistic parking queries using aging functions
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
An intelligent driver location system for smart parking
Expert Systems with Applications: An International Journal
Sharing with caution: Managing parking spaces in vehicular networks
Mobile Information Systems
| Hi-index | 0.00 |
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.