Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Game theory
(section)
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!
===Symmetric / asymmetric=== {{Payoff matrix |Name=An asymmetric game |2L=E |2R=F |1U=E |UL=1, 2 |UR=0, 0 |1D=F |DL=0, 0 |DR=1, 2}} {{main|Symmetric game}} A symmetric game is a game where each player earns the same payoff when making the same choice. In other words, the identity of the player does not change the resulting game facing the other player.<ref>{{Cite web |last=Shor |first=Mike |date=2006 |title=Symmetric Game |url=https://www.gametheory.net/dictionary/Games/SymmetricGame.html |website=Game Theory.net}}</ref> Many of the commonly studied 2Γ2 games are symmetric. The standard representations of [[game of chicken|chicken]], the prisoner's dilemma, and the [[stag hunt]] are all symmetric games. The most commonly studied asymmetric games are games where there are not identical strategy sets for both players. For instance, the [[ultimatum game]] and similarly the [[dictator game]] have different strategies for each player. It is possible, however, for a game to have identical strategies for both players, yet be asymmetric. For example, the game pictured in this section's graphic is asymmetric despite having identical strategy sets for both players.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)