Math 432, Fall 2017
Dr. Jim Haglund, email@example.com
Course webpage: http://www.math.upenn.edu/~jhaglund/432/
Office hours: T 11:00-11:50am, R 10:00-10:50am in DRL 4E2B
Also, I have an office hour on Fridays from 9-9:45 am in the basement lobby area of ARCH.
Office Phone: 215-573-9093
Lecture: MWF 10-10:50am in DRL A4
Grader: Adam Clearwater, firstname.lastname@example.org
Office hours: M 3:30-4:30pm, R 11am-noon in DRL 3C13
Office Phone: 215-898-2949
Course: Game Theory is a relatively new and exciting field of mathematics which has applications to economics and many other areas. This course covers standard topics in game theory such as combinatorial games, two person (zero-sum and general-sum) games, noncooperative games, and Nash's equilibrium theorem. We will focus on the mathematics involved.
Text: The text for this course is "
Game Theory" by Thomas S. Ferguson, available free online at his
UCLA webpage. Some auxillary sources which may be helpful to consult,
on reserve in the Math/Physics Library in DRL 3N1, are
"Winning Ways for your Mathematical Plays" by Berlekamp, Conway, and Guy, and
"A Course in Game Theory" by M. J. Osborne and A. Rubenstein.
Notes on Group Actions and Invariance
Exams and Grades:
There will be three midterm exams and a final exam. Midterm exam 1 counts for 15% of your grade,
while Midterm 2 and Midterm 3 each count for 20% of your grade. The final exam counts for
35% of your grade, while hw and quizzes together count for 10%.
Midterm 1 will be on Wednesday, September 27,
Midterm 2 on Wednesday, November 1, and Midterm 3 on Wednesday,
Nov. 29. All three midterms are during our normal lecture time, from 10-10:50am in our
normal lecture room - DRL A4. The final exam will
be on Tuesday, Dec. 19 from 9:00-11:00am in ??.
Midterm 1: Covers all of Part I: Impartial Combinatorial Games. Games you may be asked to find winning moves for
include Nim, Lasker's Nim, Moore's Nim_k,
Misere Nim, Subtraction Games,
Directed Graph Games, Kayles, Turtles, Twins, Mock Turtles, Ruler, Turning Corners, Tartan Games,
Green Hackenbush, sums of games. SG functions for Kayles and Turning Corners will be provided, if they appear in a question. You
should know the SG functions for Lasker's Nim and Mock Turtles.
You may be asked to
prove a given pattern for an SG function holds using induction. You may
also be asked to explain parts of any of the proofs of theorems discussed in class, such as why in the sum of games G1 + G2,
the SG-value of a position (x,y) equals the Nim sum of the SG-value of x in G1 and the SG-value of y in G2,
the proof of the Colon Principle from Green Hackenbush, or proving something by induction.
Midterm 1 is closed book; no notes, calculators, cell phones, etc. are allowed.