An online learning approach to dynamic pricing and capacity sizing in service systems. (arXiv:2009.02911v3 [math.PR] UPDATED)

We study a dynamic pricing and capacity sizing problem in a $GI/GI/1$ queue,
where the service provider's objective is to obtain the optimal service fee $p$
and service capacity $\mu$ so as to maximize the cumulative expected profit
(the service revenue minus the staffing cost and delay penalty). Due to the
complex nature of the queueing dynamics, such a problem has no analytic
solution so that previous research often resorts to heavy-traffic analysis
where both the arrival rate and service …

arxiv capacity math online learning pricing systems