Author
Listed:
- Xu, Haowen
- Wang, Pengfei
- Liu, Peng
- Huang, Hai-Jun
- Zhang, Yuankai
Abstract
Crowdshipping offers advantages in terms of cost reduction and operational scalability. However, the uncertain availability and strategic behavior of crowdsourced couriers pose significant challenges to reliable and efficient task allocation. In particular, crowdsourced couriers may inflate their reported detour costs to obtain higher compensation, thereby undermining system efficiency. This study investigates the integrated task allocation and pricing problem in a hybrid crowdshipping system that combines crowdsourced and full-time couriers. Unlike standard approaches that rely on computationally intensive VCG implementation, we build a framework on the Leonard mechanism. Through a dual analysis of the allocation problem, we characterize the minimal competitive equilibrium and derive an incentive-compatible pricing scheme. To support real-world implementation, we propose a self-adaptive auction mechanism. This mechanism ensures incentive-compatible bidding and polynomial-time solvability by integrating ascending-price (modified proxy-DGS) and descending-price (modified proxy-LVD) strategies. Beyond mechanism design, we assess the systemic impacts of crowdshipping on traffic congestion and emissions. Analytical and numerical evaluations identify threshold conditions under which crowdshipping enhances both traffic and environmental performance. This research contributes a novel mechanism design framework for hybrid logistics platforms and provides policy-relevant insights into the operational and environmental implications of crowdshipping systems.
Suggested Citation
Xu, Haowen & Wang, Pengfei & Liu, Peng & Huang, Hai-Jun & Zhang, Yuankai, 2026.
"Incentive-compatible auction mechanisms for crowdshipping: Modeling, solution approach, and systemic impacts,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 212(C).
Handle:
RePEc:eee:transe:v:212:y:2026:i:c:s1366554526002589
DOI: 10.1016/j.tre.2026.104919
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
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:transe:v:212:y:2026:i:c:s1366554526002589. 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.
We have no bibliographic references for this item. You can help adding them by using 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/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.