馃攳
Lecture 27: Sub Game Perfect Equilibrium- Need and Introduction - YouTube
Channel: unknown
[10]
Welcome to Mooc lecture on Strategy, An Introduction
to Game Theory.
[14]
In this module, we are going to discuss a
solution concept named sub game perfect equilibrium.
[21]
By the way, why do we need a new solution concept,
let us go back to the technique that we learntto
[28]
solve an extensive form game.The name of the
technique was backward induction.
[33]
So, just to recap, let us see, how do we do?
[36]
We start towards the end and wego back towards
the beginning.
[41]
So, what happens if player 1given a chance,
player 1would play,if player 1 moves in this
[47]
direction,if player 1 move in this direction
player 1 gets 1,if player 1 moves inthis direction,he
[56]
gets 0.Notice here, there is no strategic
interaction,as soon as the player 1decides
[63]
the game ends,sohe does not have to worry
about anything.
[66]
So, of course, what should you do, heis a
rational player,he is interested in maximizinghis
[72]
payoff, he does not care about the payoff
that player 2 receives.If he cares,then we
[78]
have to build it in the model.
[80]
But,once we have return the payoff,then what
he cares about is maximizing his payoff,he
[86]
does not careabout the payoff of other player.So,as
1 is greater than 0,he will move in this direction
[94]
not in this direction, sogame will proceed
here.Now, player 2 at this point ifplayer
[101]
2 gets a chance to play,player 2 knows thatplayer
1 is rationaland he will move in this direction.
[110]
So, if player 1decides to move in this direction
game will reach here and player2 will get
[119]
0.But,if player 2decides to move in this directions
player 2 will get 2,of course,2 is greater
[126]
than 0, sogame will proceed in this direction
as player 2 is not only rational,player 2knows
[133]
player 1is rational,so game will not proceed
in this direction.Similarly, here we can see
[141]
player 2has to decidebetween two actions,
one action is to move in this direction and
[148]
another is to move in this direction.
[151]
Moving in this direction gives player 2, 4,
moving in this direction gives player 2,3of
[157]
course, 4 is greater than3, sogame will proceed
in this direction not in this direction,coming
[166]
back to here.Why can we go back?Because, not
only player 1is rational,player 1 knows that
[174]
player 2is rational,player 2 is rational and
player 2 knows,player 1 is rationaland soon.
[181]
So, it is the implication of common knowledge,
soplayer 1 sees that if he moves in this direction,game
[189]
will eventually reach to this point and his
payoff will be 2.
[193]
And, if you proceeds in this direction game
will reach here,and his payoff would be 3,
[199]
so of course, 3 is greater than 2, sogame
will proceed in this direction not in this
[206]
direction.So, we know the outcome, let us
say that, if we name this A and Band then
[214]
here C,then we can say the right in the beginning,player
1 will take action Band player 2 will take
[221]
action C.
But,if you want to describe the strategy that
[226]
player 1 will take right in the beginning,
we cannot simply say B, because B is not his
[231]
strategy,player 1 gets to play game at two
nodes, one here and another time here.
[239]
So, his strategy should describe his action
at both of these decision nodes.So, what should
[246]
he do?He should decide to play B here and
let us again,let us give them name X and Y.
[256]
And of course, he should decides to play X
here, soX strategy for player 1 is that he
[264]
should play B X.How about player 2?
[267]
Similarly, we have to see that player 2 decides
to move here and at this node here.
[273]
So, hisstrategy should give act this particular
action here and this particular action hereandthat
[281]
is how, we get the equilibrium.
[285]
But, let us lookat a particular limitation
of this backward inductiontechnique.At this,
[292]
again there is no strategic interaction,player
2 either has to decideto play Xor to playY.Playing
[302]
Ygives him higher, soof course game will move
in this direction,at this point also player
[309]
1 has two actionsA and B.Whichactionsshould
he take?Taking action Ameans that player 2
[317]
will get 1and taking action B means he would
get 1.
[323]
Of course, if player 2 takes actionA here,
and game has reach to this point, the payoff
[329]
forplayer 1 could be 4and if player 2 takesaction
B,payoff offor player 2 would be 0.But,notice
[334]
that hereplayer 2does not player about how
much player 1 is getting,player 2 is interested
[342]
in only maximizing his payoff.
[345]
So, but he is indifferent, he can go in this
direction, he can go in this direction,then
[350]
how should we,what should be do here,what
should we take.
[353]
If, we think player 2 is going to take action
A, then let us say, if we have action Pforplayer
[360]
1and Q for player 1.Of course, ifplayer 1thinks
that player 2is going to play A, then he is
[366]
better off playing Q,because 4 is greater
than 3 or 2.But,if player 1thinks that player
[373]
2is going to play B, then he is better off
by playing P.So,how should here backward induction
[380]
plays?Itdoes not give as any answer and, we
will see,because we have we may have multiple
[386]
equilibrium in this games, sothat is the reasoning.
[389]
Again, coming back to another limitation of
backward induction,again let us say player
[395]
2 has two actionsX and Y.If,player 2 takesaction
X player 2 gets 2, if player 2 takes action
[407]
Y,player 2 gets 3, player 2should take action
Y, sofor all practical purposes, we can deletethis
[414]
part.Because,player 1 knows thatplayer 2 is
rational, soif game reaches to this point,player
[420]
2 is going to play Y.How about here?Can we
sayplayer 2 is going 2?
[427]
Let us say, this is Aand this is Band then,
if this is thecase,we have to have Aand Bpresent
[435]
here.Wecannot havedifferent actionsat the
different nodes of the same information鈥檚
[442]
set.Again, you will have torefer if you are
having difficulty in understanding this,then
[446]
you should look at a module called strategies.
[450]
So, player 2, can we say that player 2decides
do take this actions A, we do notknow.Let
[460]
me tell you that, letme changethis payoff
slightly, then it would become more interesting,
[467]
Let us make it 2.
[469]
So, we now we cannot say that player 2will
take action Aor action B, because player 2does
[477]
notknow whether he,game has reach to this
nodeor this node.If he thinks this node has
[483]
reached,he is better off by taking action
A, because 1is greater than 0.
[488]
If,he thinks this node has reached, then he
is better off bytaking action B, but the problem
[494]
is here, game is off in prefect informationgame
is off imperfect information.
[502]
So, we cannot, the player 2does not know,
where the game has reached.
[508]
So, we cannot decide,we cannot reduce, we
cannot take out one of the branches and say
[514]
this is what player 2 would do, sobackward
induction would not work here.
[520]
We should also, but you may say that why are
you taking about a new solution concept, as
[527]
we already have asolution concept known as
Nash equilibrium.
[531]
So, for that I wantto remind you,that this
was the entrant that we discussed earlier.What
[538]
did we see?That, if we usebackward induction,fortunately
backward induction works here and what did
[543]
we see that entrant inters,here we have entrant and
incumbent accommodates, this is the outcome we get.
[554]
But,when we use the solution concept Nash
equilibrium,we get two different possibilities.
[561]
E and A is of course, one of the possibilities,
but we also get O comma F as another possibility,
[569]
this is really upset,because itdoes notsatisfysequential
rationality, because game is ofcommonknowledge,entrant
[577]
would know if game reaches to this point player
2has no option, but to accommodate.
[582]
So, saying O comma Fit may be rational at
this point, but it is not rational, when game
[589]
reaches to this point.
[591]
So, in that sense O comma F is an observed
outcome recommended by Nashequilibrium.Can
[598]
we have atechnique to get rid of thisobsolete
outcome?Of course, we have that is backward
[606]
induction, but we saw thatbackward induction
does not work in some of the cases.
[611]
So, what do we really need,backward induction
is a good concept for extensive form game,
[616]
but we need some modification in backward
induction to obtain a solutions in more in
[626]
all of the extensive form games.
[630]
So, let us define something called sub game.What
do you mean by a sub game?Again, let usgo
[639]
back before I define sub game.
[641]
Let us, look at this entry game, because game
is moving in a linear fashion,first entrant
[647]
gets todecide, whether to inter or remain
outof the gameand then,incumbent gets to reside.When
[653]
at look at the game at this point, one can
say that a new game is beginning here,whatever
[661]
happen in the past that incumbent takes as
given and now, he has, hedoes not need to
[666]
consider,what has happened in this part.Only
he needs to consider, what is going to happen
[673]
from now on wards, so that is how we get the
concept of sub game.
[678]
We can say, this is the new game which is
beginning at this point,when this node has
[685]
reached and this is a sub game.
[688]
So, every moment you know as we are moving
in the game,we do not we of course,we have
[695]
to consider the past, but only in the sense
that we have to take it as given.If game has
[700]
reachedto this particular node, then nothing
can be done for the past nodesthat can only
[707]
be taken as given, so that is why we define
sub game.
[712]
So,what do we have a sub game,what we say
thatsub game begins at some decision node.Say
[719]
AI am just saying one of the, I am giving
thatname A, which hasa single terminformation set.
[726]
So, very, very clear asub game begins at the
single term in formation set.Why not aninformationset,
[733]
which has more than one element?
[736]
Let uslook at it, here game cannot a sub game
cannot begin at this information said, why
[747]
because play at,let say here we have player
1here, we have player 2,player 2does not know
[752]
whether this has reached or this has reached.
[755]
So, he does not have aclear cut picture form
the past, sothat we cannot say again begins
[761]
here, but incase in case, we have situation
like this, where clear to here,as clarity
[770]
that this node has rest if it have reached.Then,
he does not needs to consider,what ishappening
[776]
here or what is happening here,he will consider
a new beginning of a new game from this on word.
[783]
So, that is what I am saying that sub gamebegins
only at the information sets, which are single
[791]
term,second requirement is that it includes
all the successor arenote.Again, it would
[801]
be,let us say,let us take another example,this
is the case,here we have player 1,here we
[811]
have player 2here we have player 3.What we
are saying?That, if we say that sub gameis
[820]
beginning here, then all the successor nodes
should belong to this sub gamewhy, because
[828]
notice we are deciding now,game is at this
is stage.
[831]
So, we do not know whether game will proceed
in this direction are in this direction or
[837]
in this direction.
[838]
So, we cannot consider,let say this,this,this
and not this, sowhat we say that once we a
[846]
node is included in the sub game all the successor
node of this node would be included in the
[854]
sub game.And, I have already said I just want
to emphasize that if it includes one node
[861]
from the information said, then it includes
all the nodes of that information said.
[867]
Notice, that whole game is also a sub game
of itself, because whole game would satisfy
[875]
all the criteria.
[876]
So, we define again for the shack that we
have something called propersub gameit is
[884]
the part of the game tree whoseroot is I think
I have written it incorrect here,proper sub game
[894]
is all the sub game of the game excluding
the whole game itself.
[902]
And of course, hereeverything is that we have
notion of moment,if game is moving in this
[908]
direction it should be clear.
[910]
So, for example, how many sub games,do we
have in this game one of course,beginning
[918]
write at the initial node, because whole game
issub game of itself.
[922]
So, all the whole game is not proper sub gameof
itself, but it a sub game of itself,another
[928]
is beginning here.
[930]
So, we can say, if we start drawing this is
one sub gamethis is another sub gamethis is
[940]
another sub gameand then, the whole game is
sub game of itself.
[945]
So, how many we get 1 2 3 4 this game has
4sub games 3 proper sub gameshere.
[957]
Another example, how many sub games do we
havein this game,you should pass and think
[962]
before you say I suggest that you write it
in your notebook, that how many sub game do
[968]
we have in this game of course,onesub game
isstarting here.And, another the whole game
[977]
is also sub game of itself, but can we say
a of sub game is starting here,no we cannot
[985]
say,why because the third criteria says that
if a node is included in the sub gamethe node
[994]
belonging to information鈥檚all the nods belonging
to the those information said present in this
[1000]
sub game should also be in the sub game.
[1003]
For example, let me also, let me say it again
that, if let us say this node is present in
[1010]
the sub gamethis node also belongs to the
same information said the information to the
[1016]
information said that this node belongs to,
but if we say this is the sub game,we are
[1021]
excluding this, so this cannot be a sub game.
[1025]
In fact, this gamehasonly two sub games, so
that is it about the sub game, now we are
[1032]
going to learn the solution concepts.
Most Recent Videos:
You can go back to the homepage right here: Homepage





