GTO-3-02: Strictly Dominated Strategies and Iterative Removal
ฝัง
- เผยแพร่เมื่อ 5 ต.ค. 2024
- This video from Game Theory Online (www.game-theory...) introduces iterative removal of strictly dominated strategies and works through some examples. It features Matt Jackson (Stanford).
Thank you for explaning the inequalities and iterativly process so clearly!
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
Thank you man,
I've been successful thanks to your videon
Thank you! This really helped me understand the process :)
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?
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.
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?
So there’s no Nash equilibrium then
And do players play just weakly dominant strategies?
Thanks so much!!
Thanks for the help :)
thumb up for good instruction and handsome looking
good Job sir!
a joan y a mi no nos sirve este video, haz otro, gracias.
ya nos ha servido, gracias de nuevo, perdon por no ver el video del todo