We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $Ω(n \log n)$ queries.

翻译：我们考虑Robertson-Webb模型中的经典蛋糕切割问题，目标为比例公平性。我们证明任何随机算法必须使用$Ω(n \log n)$次查询。