IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v87y2016icp44-63.html
   My bibliography  Save this article

Stochastic Poisson game for an online decentralized and coordinated parking mechanism

Author

Listed:
  • Du, Lili
  • Gong, Siyuan

Abstract

This paper proposes a decentralized and coordinated online parking mechanism (DCPM), which seeks to reduce parking congestion at multiple parking facilities in a central business district (CBD) through guiding the parking decisions of a parking coordination group. To establish this DCPM, this study develops a stochastic Poisson game to model the competitions among parking vehicles en route at multiple parking facilities. The equilibrium condition for the proposed stochastic Poisson game is formulated through involving travelers’ parking choice behavior described by multinomial logit model. Furthermore, we prove that the stochastic Poisson game is a potential game with a unique equilibrium. A simultaneously updating distributed algorithm is developed to search the equilibrium solution of the DCPM. Its convergence is proved by both mathematical analysis and numerical experiments. The numerical experiments are conducted to test the efficiency of the DCPM, based on a real-world CBD covering Guicheng Community, Nanhai District at Foshan in China. The performance of the DCPM is compared to three greedy strategies following the nearest first, cheapest first, and least cruise first policies, respectively. The experimental results demonstrate that the DCPM significantly reduces cruise vehicles and average cruise distance per vehicle from all other three greedy strategies; the least cruise first strategy, which takes advantage of the real-time open spots information at parking facilities, performs better than the nearest first and the cheapest first strategies without the access to real-time information. The DCPM can further improve the benefit of the real-time information. Additionally, in terms of walking distance and parking cost, the DCPM provide a trade-off solution between the nearest first and the cheapest first strategies.

Suggested Citation

  • Du, Lili & Gong, Siyuan, 2016. "Stochastic Poisson game for an online decentralized and coordinated parking mechanism," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 44-63.
    • Handle: RePEc:eee:transb:v:87:y:2016:i:c:p:44-63
    DOI: 10.1016/j.trb.2016.02.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516000400
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.02.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shoup, Donald C., 2006. "Cruising for parking," Transport Policy, Elsevier, vol. 13(6), pages 479-486, November.
    2. Lam, William H.K. & Li, Zhi-Chun & Huang, Hai-Jun & Wong, S.C., 2006. "Modeling time-dependent travel choice problems in road networks with multiple user classes and multiple parking facilities," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 368-395, June.
    3. Lambe, Thomas A., 1996. "Driver choice of parking in the city," Socio-Economic Planning Sciences, Elsevier, vol. 30(3), pages 207-219, September.
    4. Roger B. Myerson, 1998. "Population uncertainty and Poisson games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 375-392.
    5. Liya Guo & Shan Huang & Jun Zhuang & Adel Sadek, 2013. "Modeling Parking Behavior Under Uncertainty: A Static Game Theoretic versus a Sequential Neo-additive Capacity Modeling Approach," Networks and Spatial Economics, Springer, vol. 13(3), pages 327-350, September.
    6. Du, Lili & Han, Lanshan & Li, Xiang-Yang, 2014. "Distributed coordinated in-vehicle online routing using mixed-strategy congestion game," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 1-17.
    7. Shoup, Donald C., 2006. "Cruising for Parking," University of California Transportation Center, Working Papers qt55s7079f, University of California Transportation Center.
    8. Thompson, Russell G. & Richardson, Anthony J., 1998. "A Parking Search Model," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(3), pages 159-170, April.
    9. He, Fang & Yin, Yafeng & Chen, Zhibin & Zhou, Jing, 2015. "Pricing of parking games with atomic players," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 1-12.
    10. Zou, Bo & Kafle, Nabin & Wolfson, Ouri & Lin, Jie (Jane), 2015. "A mechanism design based approach to solving parking slot assignment in the information era," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 631-653.
    11. Monderer, Dov & Shapley, Lloyd S., 1996. "Potential Games," Games and Economic Behavior, Elsevier, vol. 14(1), pages 124-143, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karaliopoulos, Merkouris & Katsikopoulos, Konstantinos & Lambrinos, Lambros, 2017. "Bounded rationality can make parking search more efficient: The power of lexicographic heuristics," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 28-50.
    2. Zhibin Chen & Stephen Spana & Yafeng Yin & Yuchuan Du, 2019. "An Advanced Parking Navigation System for Downtown Parking," Networks and Spatial Economics, Springer, vol. 19(3), pages 953-968, September.
    3. Arnott, Richard & Williams, Parker, 2017. "Cruising for parking around a circle," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 357-375.
    4. Zhang, Fangni & Lindsey, Robin & Yang, Hai & Shao, Chaoyi & Liu, Wei, 2022. "Two-sided pricing strategies for a parking sharing platform: Reselling or commissioning?," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 40-63.
    5. Xu, Su Xiu & Cheng, Meng & Kong, Xiang T.R. & Yang, Hai & Huang, George Q., 2016. "Private parking slot sharing," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 596-617.
    6. Yang, Kaidi & Roca-Riu, Mireia & Menéndez, Mónica, 2019. "An auction-based approach for prebooked urban logistics facilities," Omega, Elsevier, vol. 89(C), pages 193-211.
    7. Leclercq, Ludovic & Sénécat, Alméria & Mariotte, Guilhem, 2017. "Dynamic macroscopic simulation of on-street parking search: A trip-based approach," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 268-282.
    8. Sayarshad, Hamid R. & Sattar, Shahram & Oliver Gao, H., 2020. "A scalable non-myopic atomic game for a smart parking mechanism," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chaniotakis, Emmanouil & Pel, Adam J., 2015. "Drivers’ parking location choice under uncertain parking availability and search times: A stated preference experiment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 82(C), pages 228-239.
    2. Tian, Qiong & Yang, Li & Wang, Chenlan & Huang, Hai-Jun, 2018. "Dynamic pricing for reservation-based parking system: A revenue management method," Transport Policy, Elsevier, vol. 71(C), pages 36-44.
    3. Karaliopoulos, Merkouris & Katsikopoulos, Konstantinos & Lambrinos, Lambros, 2017. "Bounded rationality can make parking search more efficient: The power of lexicographic heuristics," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 28-50.
    4. Sayarshad, Hamid R. & Sattar, Shahram & Oliver Gao, H., 2020. "A scalable non-myopic atomic game for a smart parking mechanism," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    5. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2011. "A multilayer model to simulate cruising for parking in urban areas," Transport Policy, Elsevier, vol. 18(5), pages 735-744, September.
    6. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    7. Caicedo, Felix & Diaz, Alejandra, 2013. "Case analysis of simultaneous concessions of parking meters and underground parking facilities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 49(C), pages 358-378.
    8. Wei Wu & Wei Liu & Fangni Zhang & Vinayak Dixit, 2021. "A New Flexible Parking Reservation Scheme for the Morning Commute under Limited Parking Supplies," Networks and Spatial Economics, Springer, vol. 21(3), pages 513-545, September.
    9. Pel, Adam J. & Chaniotakis, Emmanouil, 2017. "Stochastic user equilibrium traffic assignment with equilibrated parking search routes," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 123-139.
    10. Nourinejad, Mehdi & Wenneman, Adam & Habib, Khandker Nurul & Roorda, Matthew J., 2014. "Truck parking in urban areas: Application of choice modelling within traffic microsimulation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 54-64.
    11. Xiao, Jun & Lou, Yingyan & Frisby, Joshua, 2018. "How likely am I to find parking? – A practical model-based framework for predicting parking availability," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 19-39.
    12. Zhibin Chen & Stephen Spana & Yafeng Yin & Yuchuan Du, 2019. "An Advanced Parking Navigation System for Downtown Parking," Networks and Spatial Economics, Springer, vol. 19(3), pages 953-968, September.
    13. Zhang, Fangni & Lindsey, Robin & Yang, Hai & Shao, Chaoyi & Liu, Wei, 2022. "Two-sided pricing strategies for a parking sharing platform: Reselling or commissioning?," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 40-63.
    14. Boyles, Stephen D. & Tang, Shoupeng & Unnikrishnan, Avinash, 2015. "Parking search equilibrium on a network," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 390-409.
    15. Semeneh Hunachew Bayih & Surafel Luleseged Tilahun, 2024. "Dynamic vehicle parking pricing. A review," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(1), pages 35-59.
    16. Geva, Sharon & Fulman, Nir & Ben-Elia, Eran, 2022. "Getting the prices right: Drivers' cruising choices in a serious parking game," Transportation Research Part A: Policy and Practice, Elsevier, vol. 165(C), pages 54-75.
    17. Yi LIU, 2020. "Impact Of Parking Fees On Social Benefits Based On The Emergence Of Shared Parking," Theoretical and Empirical Researches in Urban Management, Research Centre in Public Administration and Public Services, Bucharest, Romania, vol. 15(1), pages 54-74, February.
    18. Tan, Bing Qing & Xu, Su Xiu & Kang, Kai & Xu, Gangyan & Qin, Wei, 2021. "A reverse Vickrey auction for physical internet (PI) enabled parking management systems," International Journal of Production Economics, Elsevier, vol. 235(C).
    19. Wang, Xiaotian & Wang, Xin, 2019. "Flexible parking reservation system and pricing: A continuum approximation approach," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 408-434.
    20. Levy, Nadav & Benenson, Itzhak, 2015. "GIS-based method for assessing city parking patterns," Journal of Transport Geography, Elsevier, vol. 46(C), pages 220-231.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:87:y:2016:i:c:p:44-63. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.