Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interaction

Nivasini Ananthakrishnan, Nika Haghtalab, Chara Podimata, Kunhe Yang
{"title":"Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interaction","authors":"Nivasini Ananthakrishnan, Nika Haghtalab, Chara Podimata, Kunhe Yang","doi":"arxiv-2408.08272","DOIUrl":null,"url":null,"abstract":"When learning in strategic environments, a key question is whether agents can\novercome uncertainty about their preferences to achieve outcomes they could\nhave achieved absent any uncertainty. Can they do this solely through\ninteractions with each other? We focus this question on the ability of agents\nto attain the value of their Stackelberg optimal strategy and study the impact\nof information asymmetry. We study repeated interactions in fully strategic\nenvironments where players' actions are decided based on learning algorithms\nthat take into account their observed histories and knowledge of the game. We\nstudy the pure Nash equilibria (PNE) of a meta-game where players choose these\nalgorithms as their actions. We demonstrate that if one player has perfect\nknowledge about the game, then any initial informational gap persists. That is,\nwhile there is always a PNE in which the informed agent achieves her\nStackelberg value, there is a game where no PNE of the meta-game allows the\npartially informed player to achieve her Stackelberg value. On the other hand,\nif both players start with some uncertainty about the game, the quality of\ninformation alone does not determine which agent can achieve her Stackelberg\nvalue. In this case, the concept of information asymmetry becomes nuanced and\ndepends on the game's structure. Overall, our findings suggest that repeated\nstrategic interactions alone cannot facilitate learning effectively enough to\nearn an uninformed player her Stackelberg value.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"68 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.08272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When learning in strategic environments, a key question is whether agents can overcome uncertainty about their preferences to achieve outcomes they could have achieved absent any uncertainty. Can they do this solely through interactions with each other? We focus this question on the ability of agents to attain the value of their Stackelberg optimal strategy and study the impact of information asymmetry. We study repeated interactions in fully strategic environments where players' actions are decided based on learning algorithms that take into account their observed histories and knowledge of the game. We study the pure Nash equilibria (PNE) of a meta-game where players choose these algorithms as their actions. We demonstrate that if one player has perfect knowledge about the game, then any initial informational gap persists. That is, while there is always a PNE in which the informed agent achieves her Stackelberg value, there is a game where no PNE of the meta-game allows the partially informed player to achieve her Stackelberg value. On the other hand, if both players start with some uncertainty about the game, the quality of information alone does not determine which agent can achieve her Stackelberg value. In this case, the concept of information asymmetry becomes nuanced and depends on the game's structure. Overall, our findings suggest that repeated strategic interactions alone cannot facilitate learning effectively enough to earn an uninformed player her Stackelberg value.
知识就是力量?论从战略互动中学习的(不)可能性
在战略环境中学习时,一个关键问题是代理人能否克服其偏好的不确定性,从而取得在没有任何不确定性的情况下也能取得的结果。他们能否仅通过彼此间的互动就做到这一点?我们将这一问题聚焦于代理人实现其斯塔克尔伯格最优策略价值的能力,并研究信息不对称的影响。我们研究了全策略环境中的重复互动,在这种环境中,博弈者的行动是根据学习算法决定的,而学习算法考虑了博弈者的观察历史和对博弈的了解。我们还研究了一个元博弈的纯纳什均衡(PNE),在这个博弈中,棋手选择这些算法作为他们的行动。我们证明,如果一个博弈者对博弈有完全的了解,那么任何初始信息差距都会持续存在。也就是说,虽然总有一个 PNE 能让知情者实现她的 Stackelberg 值,但也存在这样一个博弈,即元博弈中没有一个 PNE 能让部分知情的博弈者实现她的 Stackelberg 值。另一方面,如果博弈双方一开始对博弈都有一定的不确定性,那么仅凭信息的质量并不能决定哪个博弈者能实现自己的 Stackelberg 价值。在这种情况下,信息不对称的概念就变得细致入微,并取决于博弈的结构。总之,我们的研究结果表明,仅靠反复的战略互动并不能有效地促进学习,从而使不知情的博弈者获得其斯泰克尔伯格价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信