TY - GEN
T1 - Learning to price vehicle service with unknown demand
AU - Yu, Haoran
AU - Wei, Ermin
AU - Berry, Randall A.
N1 - Publisher Copyright:
© 2020 ACM.
PY - 2020/10/11
Y1 - 2020/10/11
N2 - It can be profitable for vehicle service providers to set service prices based on users' travel demand on different origin-destination pairs. Prior studies on the spatial pricing of vehicle service rely on the assumption that providers know users' demand. In this paper, we study a monopolistic provider who initially does not know users' demand and needs to learn it over time by observing the users' responses to the service prices. We design a pricing and vehicle supply policy, considering the tradeoff between exploration (i.e., learning the demand) and exploitation (i.e., maximizing the provider's short-term payoff). Considering that the provider needs to ensure the vehicle flow balance at each location, its pricing and supply decisions for different origin-destination pairs are tightly coupled. This makes it challenging to theoretically analyze the performance of our policy. We analyze the gap between the provider's expected time-average payoffs under our policy and a clairvoyant policy, which makes decisions based on complete information of the demand. We prove that after running our policy for D days, the loss in the expected time-average payoff can be at most O((ln D)1/2D-1/4), which decays to zero as D approaches infinity.
AB - It can be profitable for vehicle service providers to set service prices based on users' travel demand on different origin-destination pairs. Prior studies on the spatial pricing of vehicle service rely on the assumption that providers know users' demand. In this paper, we study a monopolistic provider who initially does not know users' demand and needs to learn it over time by observing the users' responses to the service prices. We design a pricing and vehicle supply policy, considering the tradeoff between exploration (i.e., learning the demand) and exploitation (i.e., maximizing the provider's short-term payoff). Considering that the provider needs to ensure the vehicle flow balance at each location, its pricing and supply decisions for different origin-destination pairs are tightly coupled. This makes it challenging to theoretically analyze the performance of our policy. We analyze the gap between the provider's expected time-average payoffs under our policy and a clairvoyant policy, which makes decisions based on complete information of the demand. We prove that after running our policy for D days, the loss in the expected time-average payoff can be at most O((ln D)1/2D-1/4), which decays to zero as D approaches infinity.
KW - exploration and exploitation
KW - flow balance
KW - pricing with unknown demand
KW - spatial pricing
KW - vehicle service
UR - http://www.scopus.com/inward/record.url?scp=85093980611&partnerID=8YFLogxK
U2 - 10.1145/3397166.3409129
DO - 10.1145/3397166.3409129
M3 - Conference contribution
AN - SCOPUS:85093980611
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 161
EP - 170
BT - MobiHoc 2020 - Proceedings of the 2020 International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
PB - Association for Computing Machinery
T2 - 21st ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2020
Y2 - 11 October 2020 through 14 October 2020
ER -