In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...