Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Nash equilibrium
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Nash equilibria in a payoff matrix === There is an easy numerical way to identify Nash equilibria on a payoff matrix. It is especially helpful in two-person games where players have more than two strategies. In this case formal analysis may become too long. This rule does not apply to the case where mixed (stochastic) strategies are of interest. The rule goes as follows: if the first payoff number, in the payoff pair of the cell, is the maximum of the column of the cell and if the second number is the maximum of the row of the cell{{snd}} then the cell represents a Nash equilibrium. We can apply this rule to a 3Γ3 matrix: {| class="wikitable floatleft" style="text-align:center; font-size:95%; margin-right:1em; margin-bottom:1ex" |+ A payoff matrix β Nash equilibria in bold !scope="col" rowspan="2"| Player 1<br/> strategy !scope="col" colspan="3"| Player 2 strategy |- !scope="col"| Option A !scope="col"| Option B !scope="col"| Option C |- !scope="row"| Option A | 0, 0 | '''25, 40''' | 5, 10 |- !scope="row"| Option B | '''40, 25''' | 0, 0 | 5, 15 |- !scope="row"| Option C | 10, 5 | 15, 5 | '''10, 10''' |} Using the rule, we can very quickly (much faster than with formal analysis) see that the Nash equilibria cells are (B,A), (A,B), and (C,C). Indeed, for cell (B,A), 40 is the maximum of the first column and 25 is the maximum of the second row. For (A,B), 25 is the maximum of the second column and 40 is the maximum of the first row; the same applies for cell (C,C). For other cells, either one or both of the duplet members are not the maximum of the corresponding rows and columns. This said, the actual mechanics of finding equilibrium cells is obvious: find the maximum of a column and check if the second member of the pair is the maximum of the row. If these conditions are met, the cell represents a Nash equilibrium. Check all columns this way to find all NE cells. An NΓN matrix may have between 0 and NΓN [[pure strategy|pure-strategy]] Nash equilibria. {{clear}}<!-- layout fix for wide screens -->
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Nash equilibrium
(section)
Add topic