IDEAS home Printed from https://ideas.repec.org/a/ddj/fseeai/y2024i1p177-181.html
   My bibliography  Save this article

A Comprehensive Overview of Deep Learning for Algorithmic Pricing in Ride-Sharing Platforms

Author

Listed:
  • Mioara Chirita

    (Dunarea de Jos University of Galati, Romania)

  • George Chirita

    (Dunarea de Jos University of Galati, Romania)

Abstract

This study extends the current scholarship on algorithmic pricing within the sharing economy. By leveraging the capabilities of deep learning, we seek to generate valuable knowledge for stakeholders in the ride-sharing domain, including platform operators, users, and policymakers. This research contributes to the field of economic science by demonstrating the potential application of deep learning in algorithmic pricing models for sharing economy platforms. Through a comparative analysis of various methodologies, we aim to provide actionable insights that can inform platform design, regulatory frameworks, and ultimately lead to a more efficient, equitable, and sustainable transportation system.

Suggested Citation

  • Mioara Chirita & George Chirita, 2024. "A Comprehensive Overview of Deep Learning for Algorithmic Pricing in Ride-Sharing Platforms," Economics and Applied Informatics, "Dunarea de Jos" University of Galati, Faculty of Economics and Business Administration, issue 1, pages 177-181.
  • Handle: RePEc:ddj:fseeai:y:2024:i:1:p:177-181
    DOI: 10.35219/eai15840409404
    as

    Download full text from publisher

    File URL: http://eia.feaa.ugal.ro/images/eia/2024_1/Chirita_Chirita.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.35219/eai15840409404?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
    ---><---

    References listed on IDEAS

    as
    1. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.
    2. Sai Wang & Jianjun Wang & Chicheng Ma & Dongyi Li & Lu Cai, 2024. "The Real-Time Dynamic Prediction of Optimal Taxi Cruising Area Based on Deep Learning," Sustainability, MDPI, vol. 16(2), pages 1-23, January.
    Full references (including those not matched with items on IDEAS)

    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. Li, Manzi & Jiang, Gege & Lo, Hong K., 2022. "Pricing strategy of ride-sourcing services under travel time variability," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    2. Ausseil, Rosemonde & Ulmer, Marlin W. & Pazour, Jennifer A., 2024. "Online acceptance probability approximation in peer-to-peer transportation," Omega, Elsevier, vol. 123(C).
    3. Zhao, Meng & Li, Bin & Ren, Jiali & Hao, Zhihua, 2023. "Competition equilibrium of ride-sourcing platforms and optimal government subsidies considering customers’ green preference under peak carbon dioxide emissions," International Journal of Production Economics, Elsevier, vol. 255(C).
    4. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    5. Shetty, Akhil & Li, Sen & Tavafoghi, Hamidreza & Qin, Junjie & Poolla, Kameshwar & Varaiya, Pravin, 2022. "An analysis of labor regulations for transportation network companies," Economics of Transportation, Elsevier, vol. 32(C).
    6. Nikhil Garg & Hamid Nazerzadeh, 2022. "Driver Surge Pricing," Management Science, INFORMS, vol. 68(5), pages 3219-3235, May.
    7. Ke, Jintao & Chen, Xiqun (Michael) & Yang, Hai & Li, Sen, 2022. "Coordinating supply and demand in ride-sourcing markets with pre-assigned pooling service and traffic congestion externality," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    8. Li, Xiaonan & Li, Xiangyong & Wang, Hai & Shi, Junxin & Aneja, Y.P., 2022. "Supply regulation under the exclusion policy in a ride-sourcing market," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 69-94.
    9. Lei, Zengxiang & Ukkusuri, Satish V., 2023. "Scalable reinforcement learning approaches for dynamic pricing in ride-hailing systems," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    10. Bahrami, Sina & Nourinejad, Mehdi & Yin, Yafeng & Wang, Hai, 2023. "The three-sided market of on-demand delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    11. Alex Chin & Zhiwei Qin, 2023. "A Unified Representation Framework for Rideshare Marketplace Equilibrium and Efficiency," Papers 2302.14358, arXiv.org.
    12. Zhan, Xingbin & Szeto, W.Y. & (Michael) Chen, Xiqun, 2022. "A simulation–optimization framework for a dynamic electric ride-hailing sharing problem with a novel charging strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    13. Zhan, Xingbin & Szeto, W.Y. & (Michael) Chen, Xiqun, 2022. "The dynamic ride-hailing sharing problem with multiple vehicle types and user classes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    14. Chen, Junlin & Xiong, Jinghong & Chen, Guobao & Liu, Xin & Yan, Peng & Jiang, Hai, 2024. "Optimal instant discounts of multiple ride options at a ride-hailing aggregator," European Journal of Operational Research, Elsevier, vol. 314(2), pages 718-734.
    15. Zhang, Huili & Luo, Kelin & Xu, Yao & Xu, Yinfeng & Tong, Weitian, 2022. "Online crowdsourced truck delivery using historical information," European Journal of Operational Research, Elsevier, vol. 301(2), pages 486-501.
    16. Zhou, Xizhen & Lv, Mengqi & Ji, Yanjie & Zhang, Shuichao & Liu, Yong, 2023. "Pricing curb parking: Differentiated parking fees or cash rewards?," Transport Policy, Elsevier, vol. 142(C), pages 46-58.
    17. Shi, Junxin & Li, Xiangyong & Aneja, Y.P. & Li, Xiaonan, 2023. "Ride-matching for the ride-hailing platform with heterogeneous drivers," Transport Policy, Elsevier, vol. 136(C), pages 169-192.
    18. Soppert, Matthias & Steinhardt, Claudius & Müller, Christian & Gönsch, Jochen & Bhogale, Prasanna M., 2023. "Matching functions for free-floating shared mobility system optimization to capture maximum walking distances," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1194-1214.

    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:ddj:fseeai:y:2024:i:1:p:177-181. 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: Gianina Mihai (email available below). General contact details of provider: https://edirc.repec.org/data/fegalro.html .

    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.