Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Dean Liu -- 2310 2022-11-28 01:38:11

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Strategy (Game Theory). Encyclopedia. Available online: https://encyclopedia.pub/entry/36857 (accessed on 16 September 2026).
HandWiki. Strategy (Game Theory). Encyclopedia. Available at: https://encyclopedia.pub/entry/36857. Accessed September 16, 2026.
HandWiki. "Strategy (Game Theory)" Encyclopedia, https://encyclopedia.pub/entry/36857 (accessed September 16, 2026).
HandWiki. (2022, November 28). Strategy (Game Theory). In Encyclopedia. https://encyclopedia.pub/entry/36857
HandWiki. "Strategy (Game Theory)." Encyclopedia. Web. 28 November, 2022.
Strategy (Game Theory)
Edit

In game theory, a player's strategy is any of the options which they choose in a setting where the outcome depends not only on their own actions but on the actions of others. The discipline mainly concerns the action of a player in a game affecting the behavior or actions of other players. Some examples of "games" include chess, bridge, poker, monopoly, diplomacy or battleship. A player's strategy will determine the action which the player will take at any stage of the game. In studying game theory, economists enlist a more rational lens in analyzing decisions rather than the psychological or sociological perspectives taken when analyzing relationships between decisions of two or more parties in different disciplines. The strategy concept is sometimes (wrongly) confused with that of a move. A move is an action taken by a player at some point during the play of a game (e.g., in chess, moving white's Bishop a2 to b3). A strategy on the other hand is a complete algorithm for playing the game, telling a player what to do for every possible situation throughout the game. It is helpful to think about a "strategy" as a list of directions, and a "move" as a single turn on the list of directions itself. This strategy is based on the payoff or outcome of each action. The goal of each agent is to consider their payoff based on a competitors action. For example, competitor A can assume competitor B enters the market. From there, Competitor A compares the payoffs they receive by entering and not entering. The next step is to assume Competitor B doesn't enter and then consider which payoff is better based on if Competitor A chooses to enter or not enter. This technique can identify dominant strategies where a player can identify an action that they can take no matter what the competitor does to try and maximize the payoff. This also helps players to identify Nash equilibrium which are discussed in more detail below. A strategy profile (sometimes called a strategy combination) is a set of strategies for all players which fully specifies all actions in a game. A strategy profile must include one and only one strategy for every player.

algorithm equilibrium turn on

References

  1. Chiappori, P. -A.; Levitt, S.; Groseclose, T. (2002). "Testing Mixed-Strategy Equilibria when Players Are Heterogeneous: The Case of Penalty Kicks in Soccer". American Economic Review 92 (4): 1138. doi:10.1257/00028280260344678. http://pricetheory.uchicago.edu/levitt/Papers/ChiapporiGrosecloseLevitt2002.pdf. 
  2. Aumann, R. (1985). "What is Game Theory Trying to accomplish?". in Arrow, K.; Honkapohja, S.. Frontiers of Economics. Oxford: Basil Blackwell. pp. 909–924. http://www.ma.huji.ac.il/raumann/pdf/what%20is%20game%20theory.pdf. 
  3. Rubinstein, A. (1991). "Comments on the interpretation of Game Theory". Econometrica 59 (4): 909–924. doi:10.2307/2938166.  https://dx.doi.org/10.2307%2F2938166
  4. Harsanyi, John (1973). "Games with randomly disturbed payoffs: a new rationale for mixed-strategy equilibrium points". Int. J. Game Theory 2: 1–23. doi:10.1007/BF01737554.  https://dx.doi.org/10.1007%2FBF01737554
  5. Aumann, Robert; Brandenburger, Adam (1995). "Epistemic Conditions for Nash Equilibrium". Econometrica 63 (5): 1161–1180. doi:10.2307/2171725.  https://dx.doi.org/10.2307%2F2171725
  6. Shimoji, Makoto (2012-05-01). "Outcome-equivalence of self-confirming equilibrium and Nash equilibrium" (in en). Games and Economic Behavior 75 (1): 441–447. doi:10.1016/j.geb.2011.09.010. ISSN 0899-8256. https://www.sciencedirect.com/science/article/abs/pii/S0899825611001746. 
  7. Kak, Subhash (2017). "The Absent-Minded Driver Problem Redux". arXiv:1702.05778 [cs.AI]. //arxiv.org/archive/cs.AI
More
Upload a video for this entry
Information
Subjects: Others
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
View Times: 3.2K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 28 Nov 2022
Notice
You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
OK
Confirm
Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
Yes
No
${ textCharacter }/${ maxCharacter }
Submit
Cancel
There is no comment~
${ textCharacter }/${ maxCharacter }
Submit
Cancel
${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
Submit
Cancel
Confirm
Are you sure to Delete?
Yes No
Academic Video Service