Learning to Price and Stock Under Contextual and Censored Demand
This work proposes an efficient algorithm to achieve regret bound O(K sqrt(T) log T) under concave revenue conditions and O(K^(2/3) T^(2/3) (log T)^(1/2) for the general case, with matching lower bounds confirming optimality.