The St. Petersberg Paradox is described as follows:
A gambler pays an entry fee $M$ dollar to play the following game: A fair coin is tossed repeated until the first head occurs and you win $2^{n-1}$ amount of money where $n$ is the total number of tosses. And the question is what is the fair amount of $M$?
By some simple probability knowledge we can get the "Expected Winning Money" is $$E(2^{n-1})=\sum\limits_{k=1}^\infty 2^{k-1}\times\frac1{2^k}=\infty$$
But Bernoulli claims that $M$ is not worth infinity because of utility. And log-utility is considered here, which intuitively means that 1000 dollars are not equally significant to a pauper and a rich man.
But I am confused that if so, then $M$ will be set to some finite amount. But if we only focus on the number itself, since the "Expected Winning Money" is infinity, then the game holder is 100% certain to lose money to hold this game(Or to be more precise, the game holder will definitely lose money when the number of people to play this game is large enough)?
Can anyone help me? Thank you!!