Technical Note—Pricing in On-Demand and One-Way Vehicle-Sharing Networks
提出一种新方法评估单向车辆共享系统中静态定价的表现，通过递归关系得到一系列紧界，并设计出渐近最优的定价策略，适用于多地点、非零旅行时间和任意车辆数的系统。
In this paper, we introduce a new method for evaluating the performance of static pricing in one-way vehicle-sharing systems. Our approach, based on a well-known recursive relationship, leads to a series of increasingly tight bounds on the performance of the static pricing policy. These bounds are valid for systems with multiple locations, nonzero travel times, and an arbitrary number of vehicles. They also apply to systems where the static pricing policy does not lead to a fully connected network. Our method results in a family of asymptotically optimal static pricing policies that improve upon previous results in the literature. The approach applies to the case of a single location and yields a bound that is at least as tight as the best known bound.