Reviews: Dying Experts: Efficient Algorithms with Optimal Regret Bounds

In addition to the upper bound the reviewers found the lower bounds of interest. The reviewers are unanimous in their opinion that this paper should be accepted.