Sir, you basically saved my life!!!!! I genuinely don't know how I would have passed this Game theory course if it wasn't for your videos!!! Thank you so so so sooooo much.
I really like the way you set this up as the same exact game just with and without perfect information! I think it makes the idea of information sets and Nash Equilibrium for both perfect information and asymmetric information sequential games super clear and easier to understand! Love the explanation! Sometimes I like to draw a dotted ellipse around the decision where a player makes a decision to sort of represent a "cloud of uncertainty". Great video overall!
You are an exceptionally good teacher, I cannot emphasise enough how much I appreciate your thorough and crucially, without needless nomenclature and obfuscating elaborations. Much appreciation, this is pure gold.
Do you have a video of this same game but with three players, and where the first player moves first and the second and third player move simultaneously?
thank you so much for this video. for the second example with imperfect information for player 2, how would one find Nash equilibrium that is not sub perfect?? I have understood how to find SPNE for such a case , but how to just find NE??
Pausing at 16:29, what happens if in the blue markered tree, the right node has payoff of say (3, 1) and the left node is a prisoners dilema game (Hence with no NE in the encirlced inperfect game.). What can we say about NE and SPNE in terms of pure strategies for the whole game. What are the NE and SPNE(if any)?
Thank you for grouping the videos as per their main topic. I wanted to know if the playlists build on top of each other? Would you recommend us to view them from playlist 1 to 10 and so on? Or is there any set order in which you want us to view the topics?
Yes playlists are built on top of each other. So, I recommend starting from playlist 1 and then playlist 2, and so on. Also vidoes are built on top of each other. Therefore, in a given episode, I strongly suggest going from video 1 first, then second and so on. Finally, you can check the syllabus that I follow in my courses (please see the description below any video).
Because if the player chooses L, the player 2 will choose U, which gives him 2, not 0. This behavior leads to that player 1 will eventually get 1, not 3.
Is this known as "Generalized Backwards Induction?" I'm reading Leyton-Brown & Shoham (2008) and find no mention of this algorithm. But it seems Kaminski came up with it after 2008.
if player 2 doesnt know at what node she is, UNTIL 1 has played. if R then she chooses D and if L she chooses U. If she is at R, why would she think of what is going to happen L, because she doesnt know R and L. She just know her own node! This reasoning is going circular and doesnt match.
you, sir, are a LIFESAVER. I've learned more in one day from ur videos than in a whole year of classes! thank you! keep it up
THE WAY YOU EXPLAINED EVERYTHING IS MAGNIFICENT!!!!! THANK YOU SO MUCH!!!!
These videos are gold for those like me, who are doing a MSc in economics. Thank you Professor.Fond regards from Colombia.
hola colombia
@@selcukozyurt
Sir, you basically saved my life!!!!! I genuinely don't know how I would have passed this Game theory course if it wasn't for your videos!!! Thank you so so so sooooo much.
I really like the way you set this up as the same exact game just with and without perfect information! I think it makes the idea of information sets and Nash Equilibrium for both perfect information and asymmetric information sequential games super clear and easier to understand! Love the explanation! Sometimes I like to draw a dotted ellipse around the decision where a player makes a decision to sort of represent a "cloud of uncertainty". Great video overall!
You are an exceptionally good teacher, I cannot emphasise enough how much I appreciate your thorough and crucially, without needless nomenclature and obfuscating elaborations.
Much appreciation, this is pure gold.
Thank you. Your video is the clearest video I've ever watched.
I love you man. Regards from Spain.
Brilliantly explained
I am one of fans right now! Thank you very much!
Thanks for your explanation. It is really clear and understandable!!
Thank you sir, ur video really help me save quite a lot of time reviewing for my examination!!!
life saver for the college class thanks!
hocam allah razı olsun. sizin gibi adam bu güne kadar yeminle göremdim. betan yetmez
now I get it! thank you
Thank you very much!!
It was really helpful, Thank you!
Brilliant videos and website. Thank you!
Grateful!
IT WAS VERY VERY HELPFUL. THANK YOU SO MUCH
Do you have a video of this same game but with three players, and where the first player moves first and the second and third player move simultaneously?
best and complete idea .. Great explanation
It is very helpful, thank you!
Great video by the way, helped explain a lot.
beautifully explained, thankyou so much man!
Thanks so much! Very informative!
Señor lo amo
thank you so much for this video. for the second example with imperfect information for player 2, how would one find Nash equilibrium that is not sub perfect?? I have understood how to find SPNE for such a case , but how to just find NE??
Can we write DU for second player; I mean is UD or DU same
Pls confirm
Thanks a lot sir 😊
Pausing at 16:29, what happens if in the blue markered tree, the right node has payoff of say (3, 1) and the left node is a prisoners dilema game (Hence with no NE in the encirlced inperfect game.). What can we say about NE and SPNE in terms of pure strategies for the whole game. What are the NE and SPNE(if any)?
i was having the same doubt
Thank you for grouping the videos as per their main topic. I wanted to know if the playlists build on top of each other? Would you recommend us to view them from playlist 1 to 10 and so on? Or is there any set order in which you want us to view the topics?
Yes playlists are built on top of each other. So, I recommend starting from playlist 1 and then playlist 2, and so on. Also vidoes are built on top of each other. Therefore, in a given episode, I strongly suggest going from video 1 first, then second and so on. Finally, you can check the syllabus that I follow in my courses (please see the description below any video).
@@selcukozyurt Thank you so much.
So game 2 is not SPNE because its not perfect?
Hello:) Can you, please, explain, why does the player 1 chooses R, not L? Cause 3 is more than 2.
Because if the player chooses L, the player 2 will choose U, which gives him 2, not 0. This behavior leads to that player 1 will eventually get 1, not 3.
hocam türkçe çok az kaynak var türkçe video da çekmeyi düşünüyor musunuz
Is this known as "Generalized Backwards Induction?" I'm reading Leyton-Brown & Shoham (2008) and find no mention of this algorithm. But it seems Kaminski came up with it after 2008.
Siento una gran pena. El idioma es una limitante para el avance del conocimiento y la ciencia. Pero gracias profesor.
if player 2 doesnt know at what node she is, UNTIL 1 has played. if R then she chooses D and if L she chooses U. If she is at R, why would she think of what is going to happen L, because she doesnt know R and L. She just know her own node! This reasoning is going circular and doesnt match.
i love u
13:15
Thanks a lot sir ❤️