Course Outline of Record

Item	Value
Curriculum Committee Approval Date	Print Materials Online Materials
Top Code	220400 - Economics
Units	3 Total Units
Hours	54 Total Hours (Lecture Hours 54)
Total Outside of Class Hours	0
Course Credit Status	Credit: Degree Applicable (D)
Material Fee	No
Basic Skills	Not Basic Skills (N)
Repeatable	No
Grading Policy	Standard Letter (S),  Pass/No Pass (B)
Local General Education (GE)	GWC Mathematic Competency (GB2)

Course Description

Formerly: Game Theory. This course provides an introduction to the mathematics of game theory. The course will explore game strategies and interactions between rational decision makers. It will use mathematical techniques and probabilities to calculate and maximize outcomes of multiplayer games. The course will build game theory frameworks to apply to games including Prisoner's Dilemma, games of chance, strategic games, and real world applications of market competition and international relations. PREREQUISITE: Course taught at the level of intermediate algebra or appropriate math placement. Transfer Credit: CSU; UC.

Course Level Student Learning Outcome(s)

1. Course Outcomes
2. Solve linear systems for mixed strategy probabilities.
3. Use game matrices and game trees to solve for optimal decisions of multiplayer games.
4. Apply game theory strategies to real world decision making.

Course Objectives

• 1. Describe mathematical techniques used in game theory decision making.
• 2. Use algebraic techniques, including linear models and systems of equations, in game theory applications.
• 3. Apply ideas of probability to game theory applications.
• 4. Identify strategies and equilibrium in game theory matrices.
• 5. Describe players and payoffs in vectors.
• 6. Solve zero-sum and non-zero-sum games for optimal strategies and equilibrium.
• 7. Calculate the expected value of mixed strategy games.
• 8. Transform matrices to extensive form game trees.

---

Lecture Content

Game Matrices and Payoff Vectors Players Matrices 2x2 games 2x3 games Larger matrices Symmetric versus asymmetric Compute Payoff Matrices Evaluate numerical options to determine payoffs in a matrix Calculate probabilities of outcomes Calculate all possible outcomes Payoffs: u0, uii=0 Sets, Probability, and Expected Values Sets and subsets of decisions Evaluate elements in sets AuB, A.B Subsets Combinations Solve for the number of combinations of n taken r at a time: nCr=n!/r!(n-r)!  Permutations Solve for the number of permutations of n taken r at a time: nPr=n!/(n-r)! Trees/Extensive Form Games Decision nodes Calculate the number of possible outcomes in a decision tree Solve for the expected probability of each outcome: P(x)=n(E)/n(S) Subgames Games of Chance Solve for the probability of outcomes and the expected value of payoff: EV=.P(x)x Game applications Rolling dice Roulette Poker Perfect Information Preferences with uncertain outcomes Equilibrium Nash/Best Response < Solve for the best response of each player against other players simultaneously Maximize gains of player i

Lab Content

all other players Strategy profile s for every player i: ui(si,s-i).ui(si,s-i) Bayesian Conditional probability of event X based on occurrence of event Y Bayes Theorem: P(X

Method(s) of Instruction

• Lecture (02)
• DE Live Online Lecture (02S)
• DE Online Lecture (02X)

Instructional Techniques

Y)=(P(Y

Reading Assignments

X)P(X))/(P(Y)) Pair Deadlock Selten/subgame perfect Strategies Pure Zero randomization Dominant Strictly dominant ui(.i,s-i)>ui(si,s-i) Weakly dominant Mixed Equations of expected value using payoff matrix Unknown variables Algebraic substitution Mixed strategy algorithm Probability of mixed strategy Efficiency Graphical Solutions Equation of a Line: y=mx+b Systems of Equations Algebraic Substitution Types of Games Zero-sum games Non-zero sum games Discrete game   Continuous rounds Simultaneous decisions Sequential decisions First move advantage Iterated Elimination  Backward Induction Analyze numerical payoffs of a game from back to front Calculate possible outcomes of decision tree nodes Solve for equilibrium Prisoners Dilemma Cooperation Tit for Tat Nash equilibrium: .*=((0,1),(0,1)) S ample Games Matching Pennies Chicken Tic Tac Toe Rock-Paper-Scissors Second price auction Applications Price fixing Price wars Duopolistic competition Quid pro quo International trade and tariffs Arms races/escalation

Demonstration of Critical Thinking

Problem solving exercises related to game theory applications and decisions Written solutions to homework problemsStudents will calculate and solve math problems related to games, and decision making strategy

Required Writing, Problem Solving, Skills Demonstration

Written solutions to homework, quiz, and test problems

Eligible Disciplines

Economics: Masters degree in economics OR bachelors degree in economics AND masters degree in business, business administration, business management, business education, finance, or political science OR the equivalent. Masters degree required.

Software Resources

1. Required Nordstrom, J. Introduction to Game Theory: a Discovery Approach, ed. Jennifer Firkins Nordstrom (OER)(Latest), 2020 2. Required Bonanno, G. Game Theory, 2nd ed. CreateSpace (OER)(Latest), 2018 Rationale: . 3. Required Spaniel, W. Game Theory 101: The Complete Textbook, ed. William Spaniel (Latest), 2020 4. Required Faigle, Ulrich. Mathematical Game Theory, ed. World Scientific Publishing, 2022