Approximations In Dynamic Zero-Sum Games

M. Tidball, E. Altman
{"title":"Approximations In Dynamic Zero-Sum Games","authors":"M. Tidball, E. Altman","doi":"10.1137/s036301299325534x","DOIUrl":null,"url":null,"abstract":"We develop a unifying approach for approximating a ``limit\" zero-sum game by a sequence of approximating games. We discuss both the convergence of the values and the convergence of optimal (or ``almost\" optimal) strategies. Moreover, based on optimal policies for the limit game, we construct policies which are almost optimal for the approximating games. We then apply the general framework to state approximations of stochastic games, to convergence of finite horizon problems to infinite horizon problems, to convergence in the discount factor and in the immediate reward.","PeriodicalId":280771,"journal":{"name":"Game Theory and Information","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Game Theory and Information","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/s036301299325534x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

We develop a unifying approach for approximating a ``limit" zero-sum game by a sequence of approximating games. We discuss both the convergence of the values and the convergence of optimal (or ``almost" optimal) strategies. Moreover, based on optimal policies for the limit game, we construct policies which are almost optimal for the approximating games. We then apply the general framework to state approximations of stochastic games, to convergence of finite horizon problems to infinite horizon problems, to convergence in the discount factor and in the immediate reward.
动态零和游戏中的近似
我们开发了一个统一的方法来近似一个“极限”零和博弈的序列近似的游戏。我们讨论了值的收敛性和最优(或“几乎”最优)策略的收敛性。此外,在极限对策的最优策略的基础上,构造了近似对策的几乎最优策略。然后,我们将一般框架应用于随机对策的状态逼近,有限视界问题的收敛到无限视界问题,贴现因子的收敛和即时奖励的收敛。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信