This video from Game Theory Online (www.game-theory-class.org) introduces iterative removal of strictly dominated strategies and works through some examples. It features Matt Jackson (Stanford).
Пікірлер: 15
@fisher46512 жыл бұрын
Thank you for explaning the inequalities and iterativly process so clearly!
@JoeM3706 ай бұрын
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
@sarrahsaasa97068 жыл бұрын
Thank you! This really helped me understand the process :)
@umutkaya14105 жыл бұрын
Thank you man, I've been successful thanks to your videon
@aaronchien88352 жыл бұрын
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?
@oosmanbeekawoo2 жыл бұрын
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.
@karnavalos11 ай бұрын
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?
@beataszendrey7863 жыл бұрын
And do players play just weakly dominant strategies?
@yunaay55516 жыл бұрын
Thanks so much!!
@VicmexTV9 жыл бұрын
good Job sir!
@katiebrennan56714 жыл бұрын
Thanks for the help :)
@ItsOnlyShift4 жыл бұрын
So there’s no Nash equilibrium then
@unclecelery38478 жыл бұрын
thumb up for good instruction and handsome looking
@nataliaalonso13972 жыл бұрын
a joan y a mi no nos sirve este video, haz otro, gracias.
@nataliaalonso13972 жыл бұрын
ya nos ha servido, gracias de nuevo, perdon por no ver el video del todo