Catastrophe by Design in Population Games: A Mechanism to Destabilize Inefficient Locked-in Technologies

IF 1.1 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS ACM Transactions on Economics and Computation Pub Date : 2023-02-15 DOI:10.1145/3583782
Stefanos Leonardos, Joseph Sakos, C. Courcoubetis, G. Piliouras
{"title":"Catastrophe by Design in Population Games: A Mechanism to Destabilize Inefficient Locked-in Technologies","authors":"Stefanos Leonardos, Joseph Sakos, C. Courcoubetis, G. Piliouras","doi":"10.1145/3583782","DOIUrl":null,"url":null,"abstract":"In multi-agent environments in which coordination is desirable, the history of play often causes lock-in at sub-optimal outcomes. Notoriously, technologies with significant environmental footprint or high social cost persist despite the successful development of more environmentally friendly and/or socially efficient alternatives. The displacement of the status quo is hindered by entrenched economic interests and network effects. To exacerbate matters, the standard mechanism design approaches based on centralized authorities with the capacity to use preferential subsidies to effectively dictate system outcomes are not always applicable to modern decentralized economies. What other types of mechanisms are feasible? In this article, we develop and analyze a mechanism that induces transitions from inefficient lock-ins to superior alternatives. This mechanism does not exogenously favor one option over another; instead, the phase transition emerges endogenously via a standard evolutionary learning model, Q-learning, where agents trade off exploration and exploitation. Exerting the same transient influence to both the efficient and inefficient technologies encourages exploration and results in irreversible phase transitions and permanent stabilization of the efficient one. On a technical level, our work is based on bifurcation and catastrophe theory, a branch of mathematics that deals with changes in the number and stability properties of equilibria. Critically, our analysis is shown to be structurally robust to significant and even adversarially chosen perturbations to the parameters of both our game and our behavioral model.","PeriodicalId":42216,"journal":{"name":"ACM Transactions on Economics and Computation","volume":"11 1","pages":"1 - 36"},"PeriodicalIF":1.1000,"publicationDate":"2023-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

In multi-agent environments in which coordination is desirable, the history of play often causes lock-in at sub-optimal outcomes. Notoriously, technologies with significant environmental footprint or high social cost persist despite the successful development of more environmentally friendly and/or socially efficient alternatives. The displacement of the status quo is hindered by entrenched economic interests and network effects. To exacerbate matters, the standard mechanism design approaches based on centralized authorities with the capacity to use preferential subsidies to effectively dictate system outcomes are not always applicable to modern decentralized economies. What other types of mechanisms are feasible? In this article, we develop and analyze a mechanism that induces transitions from inefficient lock-ins to superior alternatives. This mechanism does not exogenously favor one option over another; instead, the phase transition emerges endogenously via a standard evolutionary learning model, Q-learning, where agents trade off exploration and exploitation. Exerting the same transient influence to both the efficient and inefficient technologies encourages exploration and results in irreversible phase transitions and permanent stabilization of the efficient one. On a technical level, our work is based on bifurcation and catastrophe theory, a branch of mathematics that deals with changes in the number and stability properties of equilibria. Critically, our analysis is shown to be structurally robust to significant and even adversarially chosen perturbations to the parameters of both our game and our behavioral model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
人口博弈中的设计灾难:一种破坏低效锁定技术的机制
在需要协调的多智能体环境中,游戏历史通常会导致锁定在次优结果上。众所周知,尽管成功地开发出更环保和(或)社会效率更高的替代方案,具有重大环境足迹或高社会成本的技术仍然存在。根深蒂固的经济利益和网络效应阻碍了对现状的取代。更糟的是,基于有能力使用优惠补贴来有效规定制度结果的中央当局的标准机制设计方法并不总是适用于现代分散经济。还有其他可行的机制吗?在本文中,我们开发并分析了一种机制,可以诱导从低效的锁定转换到更优的替代方案。这种机制并不会外生地偏向于某一种选择;相反,通过一个标准的进化学习模型,即q学习,在这个模型中,智能体在探索和利用之间进行权衡。对高效技术和低效技术施加同样的瞬态影响,鼓励了探索,并导致了高效技术的不可逆相变和永久稳定。在技术层面上,我们的工作是基于分岔和突变理论,这是数学的一个分支,研究平衡态数量和稳定性的变化。至关重要的是,我们的分析在结构上对我们的游戏和行为模型参数的显著甚至是对抗性选择的扰动具有稳健性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Transactions on Economics and Computation
ACM Transactions on Economics and Computation COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
3.80
自引率
0.00%
发文量
11
期刊介绍: The ACM Transactions on Economics and Computation welcomes submissions of the highest quality that concern the intersection of computer science and economics. Of interest to the journal is any topic relevant to both economists and computer scientists, including but not limited to the following: Agents in networks Algorithmic game theory Computation of equilibria Computational social choice Cost of strategic behavior and cost of decentralization ("price of anarchy") Design and analysis of electronic markets Economics of computational advertising Electronic commerce Learning in games and markets Mechanism design Paid search auctions Privacy Recommendation / reputation / trust systems Systems resilient against malicious agents.
期刊最新文献
Editorial from the New Co-Editors-in-Chief of ACM Transactions on Economics and Computation Price of Anarchy in Algorithmic Matching of Romantic Partners Tractable Binary Contests Topological Bounds on the Price of Anarchy of Clustering Games on Networks Social Cost Analysis of Shared/Buy-in Computing Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1