A "Quantal Regret" Method for Structural Econometrics in Repeated Games

N. Nisan, Gali Noti
{"title":"A \"Quantal Regret\" Method for Structural Econometrics in Repeated Games","authors":"N. Nisan, Gali Noti","doi":"10.1145/3033274.3085111","DOIUrl":null,"url":null,"abstract":"We suggest a general method for inferring players' values from their actions in repeated games. The method extends and improves upon the recent suggestion of (Nekipelov et al., EC 2015) and is based on the assumption that players are more likely to exhibit sequences of actions that have lower regret. We evaluate this \"quantal-regret\" method on two different datasets from experiments of repeated games with controlled player values: those of (Selten and Chmura, AER 2008) on a variety of two-player 2x2 games and our own experiment on ad-auctions (Noti et al., WWW 2014). We find that the quantal-regret method is consistently and significantly more precise than either \"classic\" econometric methods that are based on Nash equilibria, or the \"min-regret\" method of (Nekipelov et al., EC 2015).","PeriodicalId":287551,"journal":{"name":"Proceedings of the 2017 ACM Conference on Economics and Computation","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033274.3085111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We suggest a general method for inferring players' values from their actions in repeated games. The method extends and improves upon the recent suggestion of (Nekipelov et al., EC 2015) and is based on the assumption that players are more likely to exhibit sequences of actions that have lower regret. We evaluate this "quantal-regret" method on two different datasets from experiments of repeated games with controlled player values: those of (Selten and Chmura, AER 2008) on a variety of two-player 2x2 games and our own experiment on ad-auctions (Noti et al., WWW 2014). We find that the quantal-regret method is consistently and significantly more precise than either "classic" econometric methods that are based on Nash equilibria, or the "min-regret" method of (Nekipelov et al., EC 2015).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
重复博弈中结构计量经济学的“定量后悔”方法
我们建议一种从玩家在重复游戏中的行为推断其价值的通用方法。该方法扩展并改进了Nekipelov等人(EC 2015)的最新建议,并基于玩家更有可能表现出具有较低后悔的行动序列的假设。我们在两个不同的数据集上评估了这种“量子后悔”方法,这些数据集来自控制玩家价值的重复游戏实验:一个是(Selten和Chmura, AER 2008)关于各种双人2x2游戏的数据集,另一个是我们自己的广告拍卖实验(Noti et al., WWW 2014)。我们发现,与基于纳什均衡的“经典”计量经济学方法或(Nekipelov et al., EC 2015)的“最小后悔”方法相比,量子后悔方法始终且明显更精确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation Making Right Decisions Based on Wrong Opinions Learning in the Repeated Secretary Problem Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions Deferred-Acceptance Auctions for Multiple Levels of Service
×
引用
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