“不确定性下的网上购物”的勘误表

IF 0.9 3区数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Random Structures & Algorithms Pub Date : 2021-09-01 DOI:10.1002/rsa.21012

A. Frieze

{"title":"“不确定性下的网上购物”的勘误表","authors":"A. Frieze","doi":"10.1002/rsa.21012","DOIUrl":null,"url":null,"abstract":"In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious 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.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"33 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Corrigendum to “Online purchasing under uncertainty”\",\"authors\":\"A. Frieze\",\"doi\":\"10.1002/rsa.21012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious 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.\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"33 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21012\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/rsa.21012","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 1

摘要

在“不确定条件下的在线购买”一文中，我们证明了关于在具有随机加权边的图中购买各种组合结构(路径、循环等)的成本的定理，这些组合结构由购买者一次一次地检查并购买或丢弃。我们讨论了三种模型(POM, ROM, AOM)，根据边缘是按照购买者选择的顺序、随机顺序还是(自适应的)对抗选择的顺序呈现。定理1.6-1.11的陈述在所有三种模型中都有O(1)上界，但所提出的证明仅适用于ROM和POM模型;因此，我们从这些结果中撤回了AOM上界的要求。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Corrigendum to “Online purchasing under uncertainty”

In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Structures & Algorithms 数学-计算机：软件工程

CiteScore

2.50

自引率

10.00%

发文量

审稿时长

>12 weeks

期刊介绍： It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.