Frieze, Alan, Pegden, Wesley Random Structures & Algorithms, Vol. 53, No. 2, pp. 327– 351, September 2018

In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing various combinatorial structures (paths, cycles, etc.) in graphs with randomly weighted edges, which are examined and either purchased or discarded one-at-a-time by the purchaser. We discussed three models (POM, ROM, AOM) according to whether the edges were presented in a purchaser-selected order, a random order, or an (adaptive) adversarially selected order.

The statements of Theorems 1.6–1.11 claim O(1) upper bounds in all three models but the proofs presented apply only to the ROM and POM models; as such we withdraw the claims of the AOM upper bounds from these results.

弗里兹，艾伦，佩格登，韦斯利 随机结构和算法，卷。53 , No. 2 , pp. 327 – 351 , 2018年9月

在“不确定性下的在线购买”中，我们证明了有关在具有随机加权边的图中购买各种组合结构（路径、循环等）的成本的定理，由购买者。我们根据边缘是以购买者选择的顺序、随机顺序还是（自适应）对抗性选择的顺序呈现的三种模型（POM、ROM、AOM）。

定理 1.6-1.11 的陈述在所有三个模型中都要求 O(1) 上界，但提供的证明仅适用于 ROM 和 POM 模型；因此，我们从这些结果中撤回了 AOM 上限的要求。