arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.3609cs.GTmath.OC
收藏

关于有无信号博弈中可接近性的统一框架

On an unified framework for approachability in games with or without signals

Vianney Perchet, Marc Quincampoix

摘要:

我们统一的标准框架,无论是在全部或部分监控的可接近性定义了一个新的抽象游戏,称为“纯粹的信息游戏”,在每个阶段的结果是最大的信息玩家可以获得,表示为一些概率测度。玩家的目标可以重写为这些概率测度的平均值序列的收敛(到某个给定集合)。我们得到了新的结果扩展的可接近性理论开发的Blackwell此外,这个新的抽象框架使我们能够描述可接近集,像往常一样,一个非常简单和清晰的凸集的重新制定。将这些结果转化为原来的博弈,成为任意集合可逼近的第一个充分必要条件,它们覆盖和推广了以前已知的凸集结果。我们还研究了一类特定的游戏,由于一些不寻常的定义的平均值和凸性,我们再次获得了一个完整的表征的可接近的集合,随着收敛速度。

英文摘要:

We unify standard frameworks for approachability both in full or partial monitoring by defining a new abstract game, called the "purely informative game", where the outcome at each stage is the maximal information players can obtain, represented as some probability measure. Objectives of players can be rewritten as the convergence (to some given set) of sequences of averages of these probability measures. We obtain new results extending the approachability theory developed by Blackwell moreover this new abstract framework enables us to characterize approachable sets with, as usual, a remarkably simple and clear reformulation for convex sets. Translated into the original games, those results become the first necessary and sufficient condition under which an arbitrary set is approachable and they cover and extend previous known results for convex sets. We also investigate a specific class of games where, thanks to some unusual definition of averages and convexity, we again obtain a complete characterization of approachable sets along with rates of convergence.

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

↑