Quote:
Originally Posted by Brokenstars
By definition it would not be making any assumptions about the opponent's range.
Well I do understand that the GTO strategy in on itself just
is and doesn't make assumptions, was just wondering about how I can attempt to find it.
Quote:
Originally Posted by Brokenstars
A nash equilibrium would be reached in the situation in which the both players have no incentive to adjust their strategy--neither player can increase their EV by doing something else.
So would I be right in saying that once Nash is reached you are playing GTO? Because according to their definitions, Nash Equilibrium and GTO sound like the same thing, but I also have a feeling that there's a difference.
Quote:
Originally Posted by Brokenstars
When people use solvers to identify a nash equilibrium and input constraints such as ranges/sizings/flops/etc. it's essentially done to limit the size of the game tree such that is solvable. Specifically, if you were to solve for nash in a heads up game including all preflop and all sizings and all stack depths etc. the game tree would be more or less infinite. By adding in various constraints you make it possible to solve.
Yup, this was basically my question. So this is the standard way to approach situations in a GTO way, good to know.
Quote:
Originally Posted by Brokenstars
Multiway games/situations are a bit different, though, and aren't necessarily as clean of an answer.
Not the first time I'm hearing this, can you expand a bit? I watched a Triton Poker interview with Trueteller and Rui Cao, and Trueteller said that Nash equilibrium doesn't exist multiway (but Rui Cao disagreed), is this related to your point?