 Online acceptance probability approximation in peer-to-peer transportationRosemonde Ausseil, Marlin W. Ulmer and Jennifer A. Pazour Omega, 2024, vol. 123, issue C Abstract: Crowdsourced transportation by independent suppliers (or drivers) is central to urban delivery and mobility platforms. While utilizing crowdsourced resources has several advantages, it comes with the challenge that suppliers are not bound to assignments made by the platforms. In practice, suppliers often decline offered service requests, e.g., due to the required travel detour, the expected tip, or the area a request is located. This leads to inconveniences for the platform (ineffective assignments), the corresponding customer (delayed service), and also the suppliers themselves (non-fitting assignment, less revenue). Therefore, the objective of this work is to analyze the impact of a platform approximating and incorporating individual suppliers’ acceptance behavior into the order dispatching process and to quantify its impact on all stakeholders (platform, customers, suppliers). To this end, we propose a dynamic matching problem where suppliers’ acceptances or rejections of offers are uncertain. Suppliers who accept an offered request are assigned and reenter the system after service looking for another offer. Suppliers declining an offer stay idle to wait for another offer, but leave after a limited time if no acceptable offer is made. Every supplier decision reveals only their acceptance or rejection information to the platform, and in this paper, we present a corresponding mathematical model and an approximation method that translates supplier responses into updated approximations of the likelihood of a specific supplier to accept a specific future offer and use this information to optimize subsequent offering decisions. We show via a computational study based on crowdsourced food delivery that online approximation and incorporating individual supplier acceptance estimates into order dispatching leads to overall more successful assignments, more revenue for the platform and most of the suppliers, and less waiting for the customers to be served. We also show that considering individual supplier behavior can lead to unfair treatment of more agreeable suppliers. Keywords: Peer-to-peer transportation; Dynamic matching; Supplier-side choice; Stochastic acceptance behavior; Restaurant meal delivery (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:123:y:2024:i:c:s0305048323001573 Ordering information: This journal article can be ordered from DOI: 10.1016/j.omega.2023.102993 Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.