Ride-sharing has the potential of addressing many socioeconomic challenges related to transportation. The rising popularity of ridesharing platforms (e.g., Uber, Lyft, DiDi) in addition to the emergence of new applications like food delivery and grocery shopping which use a similar platform, calls for an in-depth and detailed evaluation of various aspects of this problem. Auction frameworks and mechanism design, have been widely used for modeling ride-sharing platforms. A key challenge in these approaches is preventing the involving parties from manipulating the platform for their personal gain which in turn, can result in a less satisfactory experience for other parties and/or loss of profit for the platform provider. We introduce a latent space transition model for ride-sharing platforms which drivers can exploit and predict the future supply of the drivers (i.e., available drivers) to their own advantage. Following, we propose a pricing model for ride-sharing platforms which is both truthful and individually rational based on Vickery auctions and show how we can manage the loss of revenue in this approach. We compare our predicting model and pricing model with competing approaches through experiments on New York City’s taxi dataset. Our results show that our model can accurately learn the transition patterns of people’s ride requests. Furthermore, our pricing mechanism forces drivers to be truthful and takes away any unfair advantage the drivers can achieve by bidding untruthfully. More importantly, our pricing model forces truthfulness without sacrificing much profit unlike what is typical with second-price auction schemes.
CITATION STYLE
Asghari, M., & Shahabi, C. (2017). An On-line Truthful and Individually Rational Pricing Mechanism for Ride-sharing. In GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (Vol. 2017-January). Association for Computing Machinery. https://doi.org/10.1145/3139958.3139991
Mendeley helps you to discover research relevant for your work.