Open Side Menu Go to the Top
Register
[0,1] Game #6: The Raising Game (MOP Pg. 184) [0,1] Game #6: The Raising Game (MOP Pg. 184)

09-11-2014 , 06:54 PM
Can somebody explain why we are justified in making the assumption that:

y2 = Rx1 ==> x3 = Ry2 (?)


In other words, why does R remain constant over the nth bet?

I see absolutely no reason for this to be true, or not to be true.

They give absolutely no explanation, except for a vague "X is now in the same position Y was in". I don't understand how that is anything close to a tangible argument.

Whenever I try to show this through direct calculation, I end up with a slightly different result.
[0,1] Game #6: The Raising Game (MOP Pg. 184) Quote
09-13-2014 , 11:00 AM
Their situations are indistinguishable because it is a game which permits an infinite number of raises.
[0,1] Game #6: The Raising Game (MOP Pg. 184) Quote
09-13-2014 , 03:52 PM
It seems like some kind of argument that the game is composed of sub-games which are all equivalent to one another, and so (by some step) we can conclude the the optimal fraction of hands to raise for putting in the second bet is the same as that fraction for putting in the third bet, it's only the ranges that change.
[0,1] Game #6: The Raising Game (MOP Pg. 184) Quote
09-13-2014 , 04:48 PM
What problem do you have with that argument?
[0,1] Game #6: The Raising Game (MOP Pg. 184) Quote
09-13-2014 , 09:46 PM
I don't have a problem with it, I just wasn't familiar with a lot of game theory terminology before I started reading the book.
[0,1] Game #6: The Raising Game (MOP Pg. 184) Quote

      
m