一般非平稳有限域不安多武装多行动土匪的渐近最优启发式算法:勘误表

IF 0.9 4区 数学 Q3 STATISTICS & PROBABILITY Advances in Applied Probability Pub Date : 2023-03-22 DOI:10.1017/apr.2022.59
Gabriel Zayas-Cabán, Jiaxin Liang, Stefanus Jasin, Guihua Wang
{"title":"一般非平稳有限域不安多武装多行动土匪的渐近最优启发式算法:勘误表","authors":"Gabriel Zayas-Cabán, Jiaxin Liang, Stefanus Jasin, Guihua Wang","doi":"10.1017/apr.2022.59","DOIUrl":null,"url":null,"abstract":"The above lemma is used to prove Theorems 1–2 and Propositions 1–3 in Sections 4 and 6 of [1]. It has been graciously pointed out to us that the bound in the lemma may not be correct in general. The original proof of this lemma uses a combination of linear program (LP) duality and sensitivity analysis results. The mistake is in the application of a known sensitivity analysis result under a certain assumption that happens to be not necessarily satisfied by our LP. Fortunately, it is possible to correct the bound in the above lemma. The new bound that we will prove in this correction note is as follows:","PeriodicalId":53160,"journal":{"name":"Advances in Applied Probability","volume":"55 1","pages":"1075 - 1083"},"PeriodicalIF":0.9000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits: Corrigendum\",\"authors\":\"Gabriel Zayas-Cabán, Jiaxin Liang, Stefanus Jasin, Guihua Wang\",\"doi\":\"10.1017/apr.2022.59\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The above lemma is used to prove Theorems 1–2 and Propositions 1–3 in Sections 4 and 6 of [1]. It has been graciously pointed out to us that the bound in the lemma may not be correct in general. The original proof of this lemma uses a combination of linear program (LP) duality and sensitivity analysis results. The mistake is in the application of a known sensitivity analysis result under a certain assumption that happens to be not necessarily satisfied by our LP. Fortunately, it is possible to correct the bound in the above lemma. The new bound that we will prove in this correction note is as follows:\",\"PeriodicalId\":53160,\"journal\":{\"name\":\"Advances in Applied Probability\",\"volume\":\"55 1\",\"pages\":\"1075 - 1083\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Applied Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/apr.2022.59\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Applied Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/apr.2022.59","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

摘要

上述引理用于证明[1]第4节和第6节中的定理1 - 2和命题1 - 3。有人慷慨地向我们指出,引理中的界通常可能是不正确的。该引理的原始证明使用了线性规划对偶和灵敏度分析结果的组合。错误在于在一定的假设下应用已知的灵敏度分析结果,而我们的LP不一定满足。幸运的是,上面引理中的界是可以修正的。我们将在这个更正注中证明的新界如下:
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits: Corrigendum
The above lemma is used to prove Theorems 1–2 and Propositions 1–3 in Sections 4 and 6 of [1]. It has been graciously pointed out to us that the bound in the lemma may not be correct in general. The original proof of this lemma uses a combination of linear program (LP) duality and sensitivity analysis results. The mistake is in the application of a known sensitivity analysis result under a certain assumption that happens to be not necessarily satisfied by our LP. Fortunately, it is possible to correct the bound in the above lemma. The new bound that we will prove in this correction note is as follows:
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Advances in Applied Probability
Advances in Applied Probability 数学-统计学与概率论
CiteScore
2.00
自引率
0.00%
发文量
64
审稿时长
6-12 weeks
期刊介绍: The Advances in Applied Probability has been published by the Applied Probability Trust for over four decades, and is a companion publication to the Journal of Applied Probability. It contains mathematical and scientific papers of interest to applied probabilists, with emphasis on applications in a broad spectrum of disciplines, including the biosciences, operations research, telecommunications, computer science, engineering, epidemiology, financial mathematics, the physical and social sciences, and any field where stochastic modeling is used. A submission to Applied Probability represents a submission that may, at the Editor-in-Chief’s discretion, appear in either the Journal of Applied Probability or the Advances in Applied Probability. Typically, shorter papers appear in the Journal, with longer contributions appearing in the Advances.
期刊最新文献
A subgeometric convergence formula for finite-level M/G/1-type Markov chains: via a block-decomposition-friendly solution to the Poisson equation of the deviation matrix APR volume 55 issue 4 Cover and Front matter APR volume 55 issue 4 Cover and Back matter On sparsity, power-law, and clustering properties of graphex processes - ADDENDUM An inaccuracy measure between non-explosive point processes with applications to Markov chains
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1