Gambling problem/ standard deviation

misu200
Messages
2
Reaction score
0
Read gambling problem/Standard deviation
Posted: May 23, 2007 4:57 AM
Click to edit this message... Click to see the message monospaced in plain text Plain Text Click to reply to this topic Reply

I'm analyzing some data from online gambling sites.I'm trying to prove they are stealing the customers.
I'm not an expert in math ...just having "common sense" knowledge.

Here is the problem I need to solve:

I have a series of N independent event where I have a chance ( W ) to win some money ( P )

At the end of day my mathematical expectation is :
E= sum after i (W*P)

In reality I will have won R dollars after these N independe events.

If N is big then R and E should converge somehow.


Is it possible to apply here some Standard deviation/Chebyshev's inequality/Weighted standard deviation to get some statistical interpretation about this?

I would really like a formula that will say to me something like this:
There is a 80% chance that the possible values of R to be in (E-x,E+x) range.
 
Physics news on Phys.org
Assume R is distributed F (e.g. the normal distribution, even as an approximation). Normalize E = 0. Then you can calculate the probability R in (E-x, E+x) = (-x, x) as prob(-x,x) = 1 - 2F(-x). You can also solve for x* such that 1 - 2F(-x*) = 0.8.

F doesn't have to be the normal. This approach will work for other distributions as well.
 
Last edited:
EnumaElish said:
Assume R is distributed F (e.g. the normal distribution, even as an approximation). Normalize E = 0. Then you can calculate the probability R in (E-x, E+x) = (-x, x) as prob(-x,x) = 1 - 2F(-x). You can also solve for x* such that 1 - 2F(-x*) = 0.8.

F doesn't have to be the normal. This approach will work for other distributions as well.

Thanks. I will try to apply what you said.

Until now I've tried to use http://www-minos.phyast.pitt.edu/disdocs/weightsd.pdf"

with the weights being W(i):
w(i)=W(i)

and x(i) to be the outcome at the moment t(i)
x(i) = {
0, if you loose
P(i),if you won
}but probable that's not good.
 
Last edited by a moderator:
Example:
F is the uniform dist. over [-1,1]. Then F(x) = (x+1)/2.

1 - 2F(-x*) = 1 - 2(-x*+1)/2 = 1 - (-x*+1) = 0.8 ===> x* = 0.8.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top