Perspective Multi-Player Games

O. Kupferman, Noam Shenwald
{"title":"Perspective Multi-Player Games","authors":"O. Kupferman, Noam Shenwald","doi":"10.1109/LICS52264.2021.9470616","DOIUrl":null,"url":null,"abstract":"Perspective games model multi-agent systems in which agents can view only the parts of the system that they own. Unlike the observation-based model of partial visibility, where uncertainty is longitudinal – agents partially observe the full history, uncertainty in perspective games is transverse – agents fully observe parts of the history. So far, researchers studied zero-sum two-player perspective games. There, the objective of one agent (the system) is to satisfy a given specification, and the objective of the second agent (the environment) is to fail the specification.We study richer and more realistic settings of perspective games. We consider games with more than two players, and distinguish between zero-sum games, where the objectives of the players form a partition of all possible behaviors, zero-sum games among coalitions, where agents in a coalition share their objectives but do not share their visibility, and non-zero-sum games, where each agent has her own objectives and is assumed to be rational rather than hostile. In the non-zero-sum setting, we are interested in stable outcomes of the game; in particular, Nash equilibria.We show that, as is the case with longitudinal uncertainty, transverse uncertainty leads to undecidability in settings with three or more players that include coalitions or non-zero-sum objectives. We then focus on two-player non-zero-sum perspective games. There, finding and reasoning about stable outcomes is decidable, and in fact, unlike the case with longitudinal uncertainty, can be done in the same complexity as in games with full visibility. In particular, we study rational synthesis in the perspective setting, where the goal is to generate systems that satisfy their specification when interacting with rational environments. Our study includes Boolean objectives given by automata or LTL formulas, as well as a multi-valued setting, where the objectives are ${\\text{LTL}}\\left[ {\\mathcal{F}} \\right]$ formulas with satisfaction values in [0, 1], and the agents aim to maximize the satisfaction value of their objectives.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS52264.2021.9470616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Perspective games model multi-agent systems in which agents can view only the parts of the system that they own. Unlike the observation-based model of partial visibility, where uncertainty is longitudinal – agents partially observe the full history, uncertainty in perspective games is transverse – agents fully observe parts of the history. So far, researchers studied zero-sum two-player perspective games. There, the objective of one agent (the system) is to satisfy a given specification, and the objective of the second agent (the environment) is to fail the specification.We study richer and more realistic settings of perspective games. We consider games with more than two players, and distinguish between zero-sum games, where the objectives of the players form a partition of all possible behaviors, zero-sum games among coalitions, where agents in a coalition share their objectives but do not share their visibility, and non-zero-sum games, where each agent has her own objectives and is assumed to be rational rather than hostile. In the non-zero-sum setting, we are interested in stable outcomes of the game; in particular, Nash equilibria.We show that, as is the case with longitudinal uncertainty, transverse uncertainty leads to undecidability in settings with three or more players that include coalitions or non-zero-sum objectives. We then focus on two-player non-zero-sum perspective games. There, finding and reasoning about stable outcomes is decidable, and in fact, unlike the case with longitudinal uncertainty, can be done in the same complexity as in games with full visibility. In particular, we study rational synthesis in the perspective setting, where the goal is to generate systems that satisfy their specification when interacting with rational environments. Our study includes Boolean objectives given by automata or LTL formulas, as well as a multi-valued setting, where the objectives are ${\text{LTL}}\left[ {\mathcal{F}} \right]$ formulas with satisfaction values in [0, 1], and the agents aim to maximize the satisfaction value of their objectives.
视角多人游戏
视角游戏为多智能体系统建模,在这个系统中,智能体只能看到自己拥有的系统部分。不像部分可见性的基于观察的模型,其中不确定性是纵向的——代理部分地观察整个历史,视角博弈中的不确定性是横向的——代理完全观察历史的一部分。到目前为止,研究人员研究的是零和双人视角游戏。在这里,一个代理(系统)的目标是满足给定的规范,而第二个代理(环境)的目标是不满足规范。我们研究视角游戏更丰富、更现实的设置。我们考虑有两个以上参与者的游戏,并区分零和游戏,其中参与者的目标形成了所有可能行为的划分,联盟之间的零和游戏,其中联盟中的代理共享他们的目标但不共享他们的可见性,以及非零和游戏,其中每个代理都有自己的目标,被认为是理性的而不是敌对的。在非零和环境中,我们对游戏的稳定结果感兴趣;特别是纳什均衡。我们表明,与纵向不确定性的情况一样,横向不确定性导致三个或更多参与者(包括联盟或非零和目标)的不确定性。然后我们专注于两方非零和视角游戏。在那里,关于稳定结果的发现和推理是可决定的,事实上,与纵向不确定性的情况不同,可以在具有完全可见性的游戏中以相同的复杂性完成。特别是,我们在透视图设置中研究理性综合,其目标是在与理性环境交互时生成满足其规范的系统。我们的研究包括由自动机或LTL公式给出的布尔目标,以及一个多值设置,其中目标是满足值为[0,1]的${\text{LTL}}\left[{\mathcal{F}} \right]$公式,智能体的目标是最大化其目标的满足值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信