Edinburgh, 2019
Ph.D (Economics) — George Mason University, 2015
B.A. (Economics) — University of Connecticut, 2011
Specializations:
Research interests
My face without a mask, 2021
Ph.D (Economics) — George Mason University, 2015
B.A. (Economics) — University of Connecticut, 2011
Specializations:
Research interests
And why I wear a mask.
Example: A 2-person game
Game theory can be highly abstract and mathematical
Our approach in this class will use some, but not primarily math
You'll be fine if you can:
We will focus on applications and examples of strategic interaction
Where strategy does not matter (i.e. pure chance)
Without strategic interaction between players (i.e. a “single-player” game)
John von Neumann 1903—1956
Oskar Morgenstern 1902—1977
Example: Take out a piece of paper. You will be matched randomly with one other person in class. Neither of you will ever find out who the other person was. Write down either the letter X or Y.
In order to be a useful tool/model, need a solution concept to predict outcome
Game theory models are a special type of equilibrium model, so we want to find the equilibrium of a game
Both players have a dominant strategy to play X
A famous type of game, called a Prisoners’ Dilemma
Much, much more to say about it all this semester
Simultaneous games: players choose strategies simultaneously
Must anticipate what other players are likely to play without knowing
Examples: prisoners' dilemma, coordination game, RTS games, most sports, sealed-bid auction, secret ballot
Sequential games: players make moves one at a time
Often can see the previous moves of all players
Must look to the future of how others will respond in order to determine what is optimal now
Examples: chess, poker, board games, strategy games, bargaining, negotiations
One-shot game: game between players with no history together, occurs only once
Players do not know much about each other, know they will never encounter one another again
Examples: tipping while on vacation, strangers on a subway, game show contestants
Repeated game: game between the same players is played more than once
Players know the history of the game with each other
Finitely-repeated game: has a known final round
Infinitely-repeated game: has no (or an unknown) final round
Reputation and history matters more in repeated games
More role for “emotional” responses
Some strategies may be good for a one-shot interaction but harmful in a repeated game
Examples: bargaining too hard, rude to employees/customers, fraud
Perfect information: all players know all of the rules, possible strategies, payoffs, and move history of all players
All players know that all players know that all players know that ...
Imperfect information: all players don’t necessarily have all information
“Strategic uncertainty”: players may know the game, but not which strategies other players have chosen
Incomplete information: all players don’t have full information about the game (“external uncertainty”)
Asymmetric information: some players have more information than others
Examples: insurance, used cars, education, ordeals
Rules of the game may be fixed and immutable
Or players may be able to manipulate the rules in their favor
Making credible threats or promises with commitment
Examples: constitutions, agenda-setting, strategic voting, entry deterrence
A zero/constant sum game: player(s) gain only at the expense of other player(s)
Examples: sports, board games, division of a surplus
A positive sum game: all players can potential benefit from interaction
A negative sum game: all players can potentially be harmed from interaction
By the end of this course, you will:
Frequency | Assignment | Weight |
---|---|---|
n | Homeworks | 25% (using average HW grade) |
1 | Term Paper | 25% |
1 | Midterm Exam | 25% |
1 | Final Exam | 25% |
Office hours: M/W 10:00-11:00 AM & by appt
Slack channel
#c-316-game
Recorded videos in Blackboard Panopto
Attendance
See the resources page for tips for success and more helpful resources
Keyboard shortcuts
↑, ←, Pg Up, k | Go to previous slide |
↓, →, Pg Dn, Space, j | Go to next slide |
Home | Go to first slide |
End | Go to last slide |
Number + Return | Go to specific slide |
b / m / f | Toggle blackout / mirrored / fullscreen mode |
c | Clone slideshow |
p | Toggle presenter mode |
t | Restart the presentation timer |
?, h | Toggle this help |
o | Tile View: Overview of Slides |
Esc | Back to slideshow |
Edinburgh, 2019
Ph.D (Economics) — George Mason University, 2015
B.A. (Economics) — University of Connecticut, 2011
Specializations:
Research interests
My face without a mask, 2021
Ph.D (Economics) — George Mason University, 2015
B.A. (Economics) — University of Connecticut, 2011
Specializations:
Research interests
And why I wear a mask.
Example: A 2-person game
Game theory can be highly abstract and mathematical
Our approach in this class will use some, but not primarily math
You'll be fine if you can:
We will focus on applications and examples of strategic interaction
Where strategy does not matter (i.e. pure chance)
Without strategic interaction between players (i.e. a “single-player” game)
John von Neumann 1903—1956
Oskar Morgenstern 1902—1977
Example: Take out a piece of paper. You will be matched randomly with one other person in class. Neither of you will ever find out who the other person was. Write down either the letter X or Y.
In order to be a useful tool/model, need a solution concept to predict outcome
Game theory models are a special type of equilibrium model, so we want to find the equilibrium of a game
Both players have a dominant strategy to play X
A famous type of game, called a Prisoners’ Dilemma
Much, much more to say about it all this semester
Simultaneous games: players choose strategies simultaneously
Must anticipate what other players are likely to play without knowing
Examples: prisoners' dilemma, coordination game, RTS games, most sports, sealed-bid auction, secret ballot
Sequential games: players make moves one at a time
Often can see the previous moves of all players
Must look to the future of how others will respond in order to determine what is optimal now
Examples: chess, poker, board games, strategy games, bargaining, negotiations
One-shot game: game between players with no history together, occurs only once
Players do not know much about each other, know they will never encounter one another again
Examples: tipping while on vacation, strangers on a subway, game show contestants
Repeated game: game between the same players is played more than once
Players know the history of the game with each other
Finitely-repeated game: has a known final round
Infinitely-repeated game: has no (or an unknown) final round
Reputation and history matters more in repeated games
More role for “emotional” responses
Some strategies may be good for a one-shot interaction but harmful in a repeated game
Examples: bargaining too hard, rude to employees/customers, fraud
Perfect information: all players know all of the rules, possible strategies, payoffs, and move history of all players
All players know that all players know that all players know that ...
Imperfect information: all players don’t necessarily have all information
“Strategic uncertainty”: players may know the game, but not which strategies other players have chosen
Incomplete information: all players don’t have full information about the game (“external uncertainty”)
Asymmetric information: some players have more information than others
Examples: insurance, used cars, education, ordeals
Rules of the game may be fixed and immutable
Or players may be able to manipulate the rules in their favor
Making credible threats or promises with commitment
Examples: constitutions, agenda-setting, strategic voting, entry deterrence
A zero/constant sum game: player(s) gain only at the expense of other player(s)
Examples: sports, board games, division of a surplus
A positive sum game: all players can potential benefit from interaction
A negative sum game: all players can potentially be harmed from interaction
By the end of this course, you will:
Frequency | Assignment | Weight |
---|---|---|
n | Homeworks | 25% (using average HW grade) |
1 | Term Paper | 25% |
1 | Midterm Exam | 25% |
1 | Final Exam | 25% |
Office hours: M/W 10:00-11:00 AM & by appt
Slack channel
#c-316-game
Recorded videos in Blackboard Panopto
Attendance
See the resources page for tips for success and more helpful resources