Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing
Recently, station-free Bike sharing as an environment-friendly transportation alternative has received wide adoption in many cities due to its flexibility of allowing bike parking at anywhere. How to incentivize users to park bikes at desired locations that match bike demands - a problem which we refer to as a rebalancing problem - has emerged as a new and interesting challenge. In this paper, we propose a solution under a crowdsourcing framework where users report their original destinations and the bike sharing platform assigns proper relocation tasks to them. We first prove two impossibility results: (1) finding an optimal solution to the bike rebalancing problem is NP-hard, and (2) there is no approximate mechanism with bounded approximation ratio that is both truthful and budget-feasible. Therefore, we design a two-stage heuristic mechanism which selects an independent set of locations in the first stage and allocates tasks to users in the second stage. We show analytically that the mechanism satisfies location truthfulness, budget feasibility and individual rationality. In addition, extensive experiments are conducted to demonstrate the effectiveness of our mechanism. To the best of our knowledge, we are the first to address 2-D location truthfulness in the perspective of mechanism design.
H. Lv et al., "Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11343 LNCS, pp. 256-267, Springer Verlag, Dec 2018.
The definitive version is available at https://doi.org/10.1007/978-3-030-04618-7_21
12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018 (2018: Dec. 3-4, Dallas, TX)
Keywords and Phrases
Bike sharing; Location truthfulness; Mechanism design
International Standard Book Number (ISBN)
International Standard Serial Number (ISSN)
Article - Conference proceedings
© 2018 Springer Verlag, All rights reserved.