I use probability heuristics to put my opponent on a range of arguments and then game theory to randomly determine how frequently to attribute each argument to them. My own arguments are a binary range of extremely strong and extremely weak arguments, to keep them guessing.
-
This Tweet is unavailable.
-
This Tweet is unavailable.
-
-
This Tweet is unavailable.
-
Replying to @PereGrimmer
You're forgetting folding equity: a bad argument pressed aggressively enough just becomes an incomprehensible or unfalsifiable argument, therefore obfuscating my actual range.
1 reply 0 retweets 1 like -
This Tweet is unavailable.
-
Replying to @PereGrimmer
Not if my argument strategy is actually GTO, no. Optimally, you should be indifferent to engaging or not engaging my arguments if my ranges are properly selected.
2 replies 0 retweets 0 likes -
This Tweet is unavailable.
-
Replying to @PereGrimmer
Yeah, I was basically just applying Janda-esque poker theory to the realm of argumentation :p
1 reply 0 retweets 0 likes -
This Tweet is unavailable.
Yes, but read Sklansky first for the basics. Sklansky + Janda is sufficient for pretty much everything except tournaments, which are stupid and unprofitable anyway (though arguably more fun). Though keep in mind, the hidden skills in Poker are bankroll and variance management.
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.