Prophet inequalities are fundamental optimal stopping problems, where a decision-maker observes sequentially items with values sampled independently from known distributions, and must decide at each new observation to either stop and gain the current value or reject it irrevocably and move to the next step. This model is often too pessimistic and does not adequately represent real-world online selection processes. Potentially, rejected items can be revisited and a fraction of their value can be recovered. To analyze this problem, we consider general decay functions $D_1,D_2,\ldots$, quantifying the value to be recovered from a rejected item, depending on how far it has been observed in the past. We analyze how lookback improves, or not, the competitive ratio in prophet inequalities in different order models. We show that, under mild monotonicity assumptions on the decay functions, the problem can be reduced to the case where all the decay functions are equal to the same function $x \mapsto \gamma x$, where $\gamma = \inf_{x>0} \inf_{j \geq 1} D_j(x)/x$. Consequently, we focus on this setting and refine the analyses of the competitive ratios, with upper and lower bounds expressed as increasing functions of $\gamma$.

翻译：先知不等式是基础的最优停止问题，其中决策者顺序观察从已知分布中独立采样的物品价值，必须在每次新观察时决定是停止并获得当前价值，还是不可撤销地拒绝该物品并进入下一步。该模型通常过于悲观，不能充分代表现实世界中的在线选择过程。实际上，被拒绝的物品可能被重新考虑，并且可以回收其价值的一部分。为了分析该问题，我们考虑一般的衰减函数$D_1,D_2,\ldots$，这些函数根据物品在过去被观察的时间距离，量化了从被拒绝物品中可回收的价值。我们分析了在不同顺序模型中，回溯如何改善或不改善先知不等式中的竞争比。我们证明，在衰减函数满足温和单调性假设的条件下，该问题可以简化为所有衰减函数都等于同一函数$x \mapsto \gamma x$的情况，其中$\gamma = \inf_{x>0} \inf_{j \geq 1} D_j(x)/x$。因此，我们聚焦于该设定，并细化了对竞争比的分析，给出了以$\gamma$的递增函数形式表达的上界和下界。