Mean-field approximation for large-population beauty-contest games

Raihan Seraj, J. Le Ny, Aditya Mahajan
{"title":"Mean-field approximation for large-population beauty-contest games","authors":"Raihan Seraj, J. Le Ny, Aditya Mahajan","doi":"10.1109/CDC45484.2021.9682877","DOIUrl":null,"url":null,"abstract":"We study a class of Keynesian beauty contest games where a large number of heterogeneous players attempt to estimate a common parameter based on their own observations. The players are rewarded for producing an estimate close to a certain multiplicative factor of the average decision, this factor being specific to each player. This model is motivated by scenarios arising in commodity or financial markets, where investment decisions are sometimes partly based on following a trend. We provide a method to compute Nash equilibria within the class of affine strategies. We then develop a mean-field approximation, in the limit of an infinite number of players, which has the advantage that computing the best-response strategies only requires the knowledge of the parameter distribution of the players, rather than their actual parameters. We show that the mean-field strategies lead to an ε-Nash equilibrium for a system with a finite number of players. We conclude by analyzing the impact on individual behavior of changes in aggregate population behavior.","PeriodicalId":229089,"journal":{"name":"2021 60th IEEE Conference on Decision and Control (CDC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 60th IEEE Conference on Decision and Control (CDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC45484.2021.9682877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study a class of Keynesian beauty contest games where a large number of heterogeneous players attempt to estimate a common parameter based on their own observations. The players are rewarded for producing an estimate close to a certain multiplicative factor of the average decision, this factor being specific to each player. This model is motivated by scenarios arising in commodity or financial markets, where investment decisions are sometimes partly based on following a trend. We provide a method to compute Nash equilibria within the class of affine strategies. We then develop a mean-field approximation, in the limit of an infinite number of players, which has the advantage that computing the best-response strategies only requires the knowledge of the parameter distribution of the players, rather than their actual parameters. We show that the mean-field strategies lead to an ε-Nash equilibrium for a system with a finite number of players. We conclude by analyzing the impact on individual behavior of changes in aggregate population behavior.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大人口选美游戏的平均场近似
我们研究了一类凯恩斯主义选美比赛游戏,其中大量异质玩家试图根据自己的观察估计一个共同参数。玩家会因为做出接近平均决策的某个乘法因子的估计而获得奖励,这个因子对每个玩家来说都是特定的。这种模式是由商品或金融市场中出现的情景所驱动的,在这些市场中,投资决策有时部分基于追随趋势。我们提供了一种计算仿射策略类内纳什均衡的方法。然后我们开发了一个平均场近似,在无限玩家数量的限制下,它的优点是计算最佳对策策略只需要了解玩家的参数分布,而不是他们的实际参数。我们证明了平均场策略导致具有有限参与者数量的系统的ε-纳什均衡。最后,我们分析了总体行为变化对个体行为的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Computationally Efficient LQR based Model Predictive Control Scheme for Discrete-Time Switched Linear Systems Stability Analysis of LTI Fractional-order Systems with Distributed Delay Nonlinear Data-Driven Control via State-Dependent Representations Constraint-based Verification of Formation Control Robust Output Set-Point Tracking for a Power Flow Controller via Forwarding Design
×
引用
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