Quote:
Originally Posted by AmyIsNo1
If the continuous [0,1] game is descretized to e.g. [0, 0.001, 0.002, .... 0.999] do we expect the solution to be of similar structure or could it be radically different? (I can't solve continuous games...)
|
I strongly suspect the solution remain almost the same.
Or you can try to solve [0, 0.01, 0.02, .... 0.99] game and then add a lot of state for each bucket X that have a different strategy from the previous or next bucket. (so solve [0, 0.01, 0.02, .... 0.06, 0.062, 0.064, 0.066, 0.068, 0.07, 0.08 .... 0.99]), and possibily iterate few times. Every iteration add only a fixed number of new bucket for every change in strategy, so this should be computationally feasible.
(and you can merge bucket too, if they share the same strategy)
(as a side note, has anyone done studies on the [0-1] game with infinite stack, infinite round of betting and optimal bet size? or with finite stack size but no restriction on number of possible bet and size of the bet? where can I find such research?)
The conjecture seems reasonable and interesting to me too.
The problem for infinite stack (so no betting cap) don't seem a real problem, there should be an infinite number of region that start with check or with a bet, I think it's not well defined the strategy for "the last hand".
Eg. you have that hand in 0.999-0.9999 start with checking, hand in 0.9999-0.99999 with a bet, hand in 0.99999-0.999999 a check, and so on.