In Game Theory, Nash equilibrium represents a state in which it would do a player no good to change their strategy, since they could obtain no more gain from a strategy change. In other words, no matter what a second player does, player one's best bet is to choose a particular strategy (the Nash equilibrium).
Interestingly enough, the Nash equilibrium can be found with an algorithm when considering 'mixed strategies' of a game. This is when the players' choices deviate from one another. I found a great video that describe this in 9 minutes. It might be a challenge to present this information to our class in half the time.
No comments:
Post a Comment