5. Backward Induction, Subgame Perfect Nash Equilibrium & Nash Equilibrium (Game Theory Playlist 6)

In this episode we discuss how to apply backward induction on extensive form games with perfect information. Furthermore, we discuss how to find subgame Perfect Nash equilibrium (SPNE) in these games. We also discuss how to find and verify a Nash equilibrium in such extensive form games.
It's crucial to watch lecture videos in the proper order to ensure effective learning. This is because the concepts in each video build upon those introduced in previous videos. To help you with this, I recommend visiting my website, www.selcukozyurt.com, for a recommended course outline.

[@fruitpunch4767]

Sir you are the best who teach Game Theory and Micro!

[@barneybong7356]

This man deserves a medal

[@beomkomap]

Hi sir, hope you can make more videos and I will spread them to the world. Just to let you know that they are super amazing.

[@nursahayhan2553]

merhaba Selçuk Bey! game theory sınavına hazırlanıyorum, neredeyse bütün videolarınızı izledim ve hiç türkçe yorum görmemiştim bu nedenle yazmak istedim. muhteşemsiniz! ben de bir Boğaziçi mezunuyum ve sizin videolarınızı izlemek beni motive ediyor. her şey için çok teşekkürler. it's a pleasure taking your class!

[@TheZudik]

Thank you so much I didn't know how to write the strategy profile

[@AliCR1]

Great way of simplifying things down, thank you!

[@axelmichaud8301]

So good! Thanks

[@jxzn9144]

top teaching style thanks

[@flavio344]

You are amazing

[@timgoppelsroeder121]

Thank you no abstract/arbitrary explanations the intuition of an economics BA math course and the rigour of a math BA math course

[@user-me1xc7nt3c]

what happpens if for 2 the payoffs would be better consuming x ?

[@SA-jb5rc]

I didnot understand why 7,0,6 is the outcome?

[@lillianxu6296]

why S1 included am, an and bm,bn? if player 1 choose the a or b, m and n won't even happen?

[@mihirdamania3218]

U can find answer in Game Theory 1 Playlist's 5th video

[@yarenkaya7872]

S1 = xA1. This cross means that what are all the possible combinations for different nodes of all possible actions available for p1? For example, in 1st node actions x,y is available; for 2nd node actions z and w are available. Then there are (4,2) combinations that are available for p1 to choose. Whether they will be played does not matter at this stage. Hope it helps.