Cost-Sharing Mechanism Design for Social Cost Minimization in Ridesharing Systems

2021 ◽  
pp. 277-289
Author(s):  
Yangsu Liu ◽  
Chaoli Zhang ◽  
Zhenzhe Zheng ◽  
Guihai Chen
2021 ◽  
Vol 150 ◽  
pp. 410-434
Author(s):  
Shichun Hu ◽  
Maged M. Dessouky ◽  
Nelson A. Uhan ◽  
Phebe Vayanos

2004 ◽  
Vol 3 (4) ◽  
pp. 341-354 ◽  
Author(s):  
Cuihong Li ◽  
Shuchi Chawla ◽  
Uday Rajan ◽  
Katia Sycara

Sensors ◽  
2016 ◽  
Vol 16 (4) ◽  
pp. 481 ◽  
Author(s):  
Zhuojun Duan ◽  
Mingyuan Yan ◽  
Zhipeng Cai ◽  
Xiaoming Wang ◽  
Meng Han ◽  
...  

2019 ◽  
Vol 113 ◽  
pp. 17-37 ◽  
Author(s):  
Konstantinos Georgiou ◽  
Chaitanya Swamy

Author(s):  
Tatsuya Iwase ◽  
Sebastian Stein ◽  
Enrico H. Gerding

Ridesharing has great potential to improve transportation efficiency while reducing congestion and pollution. To realize this potential, mechanisms are needed that allocate vehicles optimally and provide the right incentives to riders. However, many existing approaches consider restricted settings (e.g., only one rider per vehicle or a common origin for all riders). Moreover, naive applications of standard approaches, such as the Vickrey-Clarke-Groves or greedy mechanisms, cannot achieve a polynomial-time, truthful, individually rational and budget balanced mechanism. To address this, we formulate a general ridesharing problem and apply mechanism design to develop a novel mechanism which satisfies all four properties and whose social cost is within 8.6% of the optimal on average.


Sign in / Sign up

Export Citation Format

Share Document