An Auction Based Task Dispatching and Pricing Mechanism in Bike-sharing
Abstract As a green and low-carbon transportation way, bike-sharing provides lots of convenience in the daily life. However, the daily usage of sharing bikes results in dispatching problems, i.e. dispatching bikes to the specific destinations. The bike-sharing platform can hire and pay to workers in order to incentivize them to accomplish the dispatching tasks. However, there exist multiple workers competing for the dispatching tasks, and they may strategically report their task accomplishing costs (which are private information only known by themselves) in order to make more profits, which may result in inefficient task dispatching results. In this paper, we first design a dispatching algorithm named GDY-MAX to allocate tasks to workers, which can achieve good performance. However it cannot prevent workers strategically misreporting their task accomplishing costs. Regarding this issue, we further design a strategy proof mechanism under the budget constraint, which consists of a task dispatching algorithm and a worker pricing algorithm. We theoretically prove that our mechanism can satisfy the properties of incentive compatibility, individual rationality and budget balance. Furthermore we run extensive experiments to evaluate our mechanism based on a dataset from Mobike. The results show that the performance of the proposed strategy proof mechanism and GDY-MAX is similar to the optimal algorithm in terms of the coverage ratio of accomplished task regions and the sum of task region values, and our mechanism has better performance than the uniform algorithm in terms of the total payment and the unit cost value.