arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.07162eess.SYcs.GTcs.SYmath.OC
收藏

非信号近似与随机团队问题

Non-signaling Approximations of Stochastic Team Problems

Naci Saldi, Can Deha Karıksız, Maxim Raginsky, Eric Chitambar

AI总结:

本文研究了有限随机团队问题的非信号近似,提出了一种分层的团队决策规则体系,并通过可扩展的非信号策略对序列团队的最优策略进行近似,最后提出了关于量子相关策略最优值计算的开放性问题。

摘要:

在本文中,我们考虑了有限随机团队问题的非信号近似。我们首先引入了一种分层的团队决策规则体系,可以按递增顺序分类为随机策略、量子相关策略和非信号策略。然后,我们通过可扩展的非信号策略对序列团队的最优策略进行近似。我们证明了当扩展足够大时,可扩展非信号策略与去中心化策略之间的距离较小。利用这一结果,我们建立了序列团队的线性规划(LP)近似。最后,我们提出了关于计算量子相关策略最优值的开放性问题。

英文摘要:

In this paper, we consider non-signaling approximation of finite stochastic teams. We first introduce a hierarchy of team decision rules that can be classified in an increasing order as randomized policies, quantum-correlated policies, and non-signaling policies. Then, we establish an approximation of team-optimal policies for sequential teams via extendible non-signaling policies. We prove that the distance between extendible non-signaling policies and decentralized policies is small if the extension is sufficiently large. Using this result, we establish a linear programming (LP) approximation of sequential teams. Finally, we state an open problem regarding computation of optimal value of quantum-correlated policies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑