Review for NeurIPS paper: Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice

Additional Feedback: Other comments: The MSSR problem mandates that the skier first chooses a shop and then must rent / buy at that same shop for the entire instance. Without this restriction the problem boils down to the standard ski rental problem with rent cost r_i and buy cost b_n since the algorithm can always rent from shop 1 and buy from shop n. It will be good to emphasize the importance of this restriction more in the model. In Lemma 1, the best deterministic online algorithm can choose any of the n shops depending on the argmin of specified term. However, both the randomized and deterministic algorithms that utilize the predictions only buy from either the first shop or the last shop.