Download Presentation - The PPT/PDF document "Game Theory" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation on theme: "Game Theory"— Presentation transcript:
By Ben Cutting &
Game Theory: General Definition
Mathematical decision making tool
Used to analyze a competitive situation in order to determine the optimal course of action
Involves at least two players who usually must choose an action from at least two options
A player’s payoff (what they gain/lose from the game) is determined by both their own choice and the choices of other players
Players act “rationally” in their decision
making, try to maximize their payoff
John von Neumann published a series of papers in 1928 pertaining to game theory
Theory of Games and Economic Behavior
by John von Neumann and Oskar Morgenstern (1944)
Initially developed to analyze competitions in which one individual does better at another’s expense (zero sum games)
Developed extensively in the 1950s by many scholars to treat a wide class of interactions
state in which each player has a given strategy that provides them with their maximum payoff. Therefore no player has an incentive to change their strategy unilaterally
a player’s plan of action that accounts for all possible game scenarios.
a player’s behavior
Two classical representations: matrix form and tree formMatrix form is traditionally associated with simultaneous move games
1, 1 3, 4 4, 2 -1, -1
Tree formOutcomes often change if the type of game is changed
Types of Games
Zero Sum games
Imperfect Information games
Strategies of both players are the sameCommon in many classical 2x2 games such as the Prisoners DilemmaNash equilibrium is where both confess and betray the otherBoth have the same strategy: Always choose to confess
1, 1 10, 0 0, 10 5, 5
Zero Sum Games
Game in which all payoffs add to zeroExample: Matching pennies gameEach player chooses either odd or even before flipping their pennies simultaneouslyIf both pennies come up either heads or tails, Even wins. Otherwise Odd wins*Notice the total sum of the payoffs = 0
1, -1 -1, 1 -1, 1 1, -1
A game is cooperative if the players are able to form binding commitmentsCommunication among players is allowed in cooperative gamesPlayers coordinate their strategies to attain the maximum combined payoff
3, 3 0, 5 5, 0 1, 1
Using earlier example, except now Player B does not know Player A’s choice of actionIn this case Player B will be tempted to choose option 2 to get a payoff of 4 (assuming Player A chooses option 1), not knowing A’s strategy
Games in which there is not a discrete number of players, moves, and/or outcomes
The strategy set for each player is also continuous
Example: Cops and Robbers (pursuit & evasion game)
A group of players trying to capture another group (the number of players varies)
Game does not have a finite length or outcome (some robbers may never get caught)
Bargaining, duopolies, fair division, etc.
Political economy, public choice, social choice theory, etc.
Computer Science & Logic
Interactive computations, multi-agent systems
Assumptions made by game theorists are sometimes violated
Human behavior often deviates from game theory models due to irrationality and different motives (altruism)
What is the equilibrium outcome of this game?
Chip (C) and Dale (D) are negotiating over how to divide a pile of 100 acorns. The order of events is:
First Round: C makes D an initial offer. D accepts or rejects. If D accepts, the game ends and C and D get their acorns. If D rejects, 10 acorns rot because of the delay and the game continues with 90 acorns to be divided.
Second Round: D makes an offer. C accepts or rejects. If C accepts, the game ends and C and D get their acorns. If C rejects, 10 acorns rot because of the delay and the game continues with 80 acorns to be divided.
Third Round: C makes a final offer. D accepts or rejects. If D accepts, then C and D get their acorns. If D rejects, the game ends and neither C nor D get any acorns.