Teor铆a de juegos: Pareto y Nash - YouTube

Channel: unknown

[0]
In this video we're gonna see a last batch of interesting concepts in game theory,
[4]
starting with the Pareto efficiency.
[6]
The Pareto efficiency is a concept that refers to the bettering of a variable
[10]
that doesn't worsen any of the others.
[12]
Let's imagine a simplified version of the Mario Kart racing game, in which each character
[16]
has two variables: speed and weight.
[18]
Speed is how fast you drive and weight is how much strength it takes to accelerate
[22]
so the more speed and weight, the better.
[24]
In this version of the game we have 4 characters:
[26]
Mario, who is the most well-rounded and has 5 points in speed and 5 in weight.
[31]
Bowser, who is heavier but also the slowest, with 6 points in weight and 4 in speed.
[35]
Peach, who is the opposite and thus lighter and faster, with 6 points in speed and
[39]
4 in weight.
[40]
And lastly Luigi, who is like Mario but minus one point in weight.
[43]
Out of these characters, Mario, Bowser, and Peach are what we would call Pareto optimal because
[47]
you can't switch to another character increasing a variable without diminishing the other, the
[52]
only thing you can do is trade speed for weight.
[54]
All of them being Pareto optimal they also form the Pareto frontier, because everything
[58]
that goes over the frontier we know is automatically suboptimal.
[62]
For example we have Luigi who is dominated by Mario because Mario is exactly like him
[66]
except with a higher weight, so from a competitive point of view there's no
[70]
reason to pick Luigi.
[72]
Now let's go onto Nash equilibrium.
[73]
Nash equilibrium is a situation that happens when none of the two players can
[77]
better their situation by changing their strategy if the rest keep the same strategy they've been
[81]
following, as such all players are "forced" to maintain their strategy
[86]
even if they know they're gonna lose.
[88]
Imagine a war game in which your opponent is attacking your castle with their army,
[92]
but you don't have an army, so you simply keep repairing your walls.
[96]
This setting would be a Nash equilibrium because the moment you stop repairing
[99]
your walls the enemy will conquer you over, and if your rival stops attacking
[103]
they'd give you an opportunity to build an army, so neither of you can switch up your
[107]
strategies without making your situation worse.
[109]
One of the classic games that is used to study cooperation strategies
[113]
and that has an interesting Nash equilibrium is the prisoner dilemma.
[116]
The situation is as follows: Two prisoners are caught and put into separate cells
[120]
to be interrogated.
[122]
The prisoners have two options: One is to collaborate with their partner and not
[126]
say anything to the police, with which both would land a year in prison.
[129]
The other option is to betray your partner, with which this prisoner would go free
[133]
and their partner would land 3 years in prison.
[136]
But if both betray each other, then they get 2 years in prison each.
[140]
This situation is interesting because the optimal strategy is to betray your partner
[144]
since it's the only option in which you'd go free and it also stop you from being betrayed.
[148]
Nonetheless, your partner will reach the same conclusion and if both of you betray each other
[152]
the end result is worse than if you'd have worked it together.
[155]
Furthermore, the dynamic of the game changes if you play one round or multiple rounds,
[159]
in which case we could switch the strategy up depending on what our partner picked
[162]
on the previous round.
[164]
In this game, Nash equilibrium is obtained if both of the prisoners betray each other because,
[167]
at that point, none of them can better their situation on their own, because if
[171]
only they switch their strategy, their situation worsens.
[174]
As such, both will keep betraying each other each round even though collaborating
[177]
would be a Pareto optimal option for both.
[180]
It's interesting because even when acting rationally they're both getting the worst result.
[183]
This situation might seem too theoretical, but in reality you see it constantly in
[188]
non-cooperative games with more than 2 players.
[190]
Imagine, for example, that we play a fighting game with 3 players.
[193]
If you and I cooperate and we attack the third player, we take a rival out of the
[197]
game and increase our chances of winning from 33% to 50%, so it's logical.
[202]
But once you've started cooperating your partner will lower their
[205]
guard towards you so it's the perfect moment to stab them in the back
[209]
and take them out of the game while taking the least damage.
[212]
But of course, if we both do this, we're gonna end up fighting among us, with which
[215]
we're dooming each other because the third player is just gonna stand there waiting for us to
[219]
finish each other to then come and finish the survivor off.
[221]
Then what is the best strategy for the prisoner dilemma? Well, it depends on
[225]
if we know how many rounds we're gonna play or not.
[227]
If we know how many rounds we're gonna play, the ideal thing is to collaborate in all of them
[231]
and then betray each other on the last round, because your your partner won't be able to take revenge since there's no more rounds.
[235]
But then, your partner will think the same, so they too will betray you in
[238]
the last round, and as such, you should betray them in the second to last round.
[241]
But, again, your partner will also think the same and then we follow this
[244]
logic until we reach the conclusion that we have to always betray them
[248]
from the beginning. This is the rational strategy.
[250]
However, there also exists the concept of superrationality which is obtained when
[254]
you're perfectly rational, your partner is perfectly rational and both of you
[258]
know each other to be perfectly rational and assume that you'll reach the same conclusion,
[263]
and therefore you pick the same option.
[264]
The superrational strategy then is to always collaborate, given that both of you will
[269]
reach the same conclusion and thus will both pick the same, there is no possibility
[272]
of betrayal. Either both of you betray each other, or both work together, and
[276]
since collaborating is the best result, you will choose to collaborate.
[279]
This changes when we play a lot of rounds but we don't know exactly how many, which we see
[283]
constantly in politics between countries, for example.
[286]
In this case, the strategy of an eye for an eye is the best, which consists of
[291]
initial cooperation until your partner betrays you, then you betray them too and don't switch
[295]
your strategy until your partner chooses to collaborate again, showing good faith.
[299]
That way you're letting the message across that taking advantage of you is not a good option
[303]
in the long run, so, if your partner isn't dumb, they'll have to realize
[307]
that collaborating is always the better option, because if they betray you, they'll end up
[311]
screwing both over, not just you.
[313]
Same thing happens with day to day friendship and in many other situations,
[317]
so think twice before betraying a friend to win just the one round if you wish to
[321]
keep collaborating with them in the future.