.png){kind=icon}
返回
Approachability with constraints
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.11.013.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study the pairs of sets (A, D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Game theory
Approachability
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容