Probability Theory | Coin Tossing Problems (TBC) | 概率论中的抛硬币问题 (未完待续)

本文探讨了一个概率论中的游戏问题:连续掷骰子最多三次,每次可以拿走显示的金额或者继续投掷。通过数学分析得出在不同投掷次数下预期的赢利,并使用动态规划思想来解决此问题。
摘要由CSDN通过智能技术生成

Q1

Question:

Suppose we play a game. I roll a die up to three times. Each time I roll, you can either take the number showing as dollars, of roll again. What is your expected winnings?

Solution:

Let random variable X k X_k Xk be the winnings for rolling a die up to k times.
The key is to formulate the following strategy: after rolling a dice, if the number showing is greater than the expected winnings of rollings the rest of the times, you should take the money. Expressing this with math:

E [ X k ] = E [ max ⁡ E[X_k] = E [ \max E[Xk]=E[max (number for this toss, E [ X k − 1

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值