A Casino Gambling Model Under Cumulative Prospect Theory: Analysis and Algorithm

Manag. Sci. Pub Date : 2022-05-06 DOI:10.1287/mnsc.2022.4414
Sang Hu, J. Obłój, X. Zhou
{"title":"A Casino Gambling Model Under Cumulative Prospect Theory: Analysis and Algorithm","authors":"Sang Hu, J. Obłój, X. Zhou","doi":"10.1287/mnsc.2022.4414","DOIUrl":null,"url":null,"abstract":"We develop an approach to solve the Barberis casino gambling model [Barberis N (2012) A model of casino gambling. Management Sci. 58(1):35–51] in which a gambler whose preferences are specified by the cumulative prospect theory (CPT) must decide when to stop gambling by a prescribed deadline. We assume that the gambler can assist their decision using independent randomization. The problem is inherently time inconsistent because of the probability weighting in CPT, and we study both precommitted and naïve stopping strategies. We turn the original problem into a computationally tractable mathematical program from which we devise an algorithm to compute optimal precommitted rules that are randomized and Markovian. The analytical treatment enables us to confirm the economic insights of Barberis for much longer time horizons and to make additional predictions regarding a gambler’s behavior, including that, with randomization, a gambler may enter the casino even when allowed to play only once and that it is prevalent that a naïf never stops loss. This paper was accepted by Kay Giesecke, finance.","PeriodicalId":18208,"journal":{"name":"Manag. Sci.","volume":"22 1","pages":"2474-2496"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manag. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/mnsc.2022.4414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We develop an approach to solve the Barberis casino gambling model [Barberis N (2012) A model of casino gambling. Management Sci. 58(1):35–51] in which a gambler whose preferences are specified by the cumulative prospect theory (CPT) must decide when to stop gambling by a prescribed deadline. We assume that the gambler can assist their decision using independent randomization. The problem is inherently time inconsistent because of the probability weighting in CPT, and we study both precommitted and naïve stopping strategies. We turn the original problem into a computationally tractable mathematical program from which we devise an algorithm to compute optimal precommitted rules that are randomized and Markovian. The analytical treatment enables us to confirm the economic insights of Barberis for much longer time horizons and to make additional predictions regarding a gambler’s behavior, including that, with randomization, a gambler may enter the casino even when allowed to play only once and that it is prevalent that a naïf never stops loss. This paper was accepted by Kay Giesecke, finance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
累积前景理论下的赌场赌博模型:分析与算法
我们开发了一种方法来解决Barberis赌场赌博模型[Barberis N(2012)]赌场赌博模型。管理科学,58(1):35-51],其中赌徒的偏好由累积前景理论(CPT)指定,必须在规定的期限内决定何时停止赌博。我们假设赌徒可以使用独立随机化来辅助他们的决策。由于CPT中的概率加权,该问题具有固有的时间不一致性,我们研究了预承诺和naïve停止策略。我们将原始问题转化为一个可计算的可处理的数学程序,从中我们设计出一种算法来计算随机和马尔可夫的最优预承诺规则。分析处理使我们能够在更长的时间范围内确认Barberis的经济见解,并对赌徒的行为做出额外的预测,包括随机化,赌徒可能会进入赌场,即使只允许玩一次,并且普遍认为naïf永远不会停止损失。这篇论文被财经的Kay Giesecke接受。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Disclosure in Incentivized Reviews: Does It Protect Consumers? Can Blockchain Technology Help Overcome Contractual Incompleteness? Evidence from State Laws Utility Tokens, Network Effects, and Pricing Power Decentralized Platforms: Governance, Tokenomics, and ICO Design The Conceptual Flaws of Decentralized Automated Market Making
×
引用
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