GTO-3-02: Strictly Dominated Strategies and Iterative Removal

[@fisher4651]

Thank you for explaning the inequalities and iterativly process so clearly!

[@JoeM370]

This content is a masterpiece. I delved into a book with similar themes that had a dramatic effect on my life. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell

[@umutkaya1410]

Thank you man, I've been successful thanks to your videon

[@sarrahsaasa9706]

Thank you! This really helped me understand the process :)

[@karnavalos]

in the last example I think that exists strictly dominance bettween right and left 3>1 and 2>1 why we take the weak dominance?Just to show how it works or this is the right way?

[@aaronchien8835]

How do we consider comparing column L and R at 5:12? I understand that C options are better than R, but do we just elimante the column if we prefer another column over it no matter what?

[@oosmanbeekawoo]

The reasoning goes this way, "for column user, whatever Outcome will result, L goes from 0-1 but C goes from 1-2". Would you like a job that pays $0-1000 or $1000-2000? Column user can never choose $0-1000 when it's free to choose $1000-2000. So $0-1000 is completely eliminated.

[@beataszendrey786]

And do players play just weakly dominant strategies?

[@ItsOnlyShift]

So there’s no Nash equilibrium then

[@yunaay5551]

Thanks so much!!

[@katiebrennan5671]

Thanks for the help :)

[@VicmexTV]

good Job sir!

[@unclecelery3847]

thumb up for good instruction and handsome looking

[@nataliaalonso1397]

a joan y a mi no nos sirve este video, haz otro, gracias.

[@nataliaalonso1397]

ya nos ha servido, gracias de nuevo, perdon por no ver el video del todo