|1||8/28 First class||8/30 Read:S. Ch 1,2,3
Read D: Ch. 1,2.
|2||9/4 No class
Do:S: 2:1-5; 3:1
|3||9/11 Read:S. 3,4,5
Do:S: 3: 3-5,7
|9/13 Read: S:7
Do:Hex problems (from class)
D: Ch. 3
Do: S:7: 1,4,5,6
Handout on Linear Programming
and Zero Sum Matrix Games
|5||9/25 Read: Continue reading Handout and
Online Tutorial on LP.
Do: Handout p679: 3-5, 7; p680: 11
|9/27 Read: D: Ch.4
|6||10/2 Read: D: Ch.4
|10/4 Do:S:9: 4,5|
|7||10/9 No Class.
Watch Kenneth Arrow "Kieval" lecture on choice
|10/11 Read: S:Ch.11, 19
D: Ch 5 up to but not including "order of play."
Do: Ch 11:1
|8||10/16 Read: S 11 and 12
Do: Ch. 11: 2,4
|10/18 Read: S: 19|
|9||10/23 :Midterm Exam||10/25 Read:
Do:Ch: 11 solve game 11.2 with LH Algorithm
|10||10/30 Read:S 19
D: ch 6 through Characteristic Function Form.
|11/2 Read read: S 20:
Do: S 20 : 1-3
|11||11/6 Read: S 26,27,28
D: ch 6: The Shapley Value
Do: S 27:1, 28:1
|11/8 Read:S 26-28; 23
|12||11/13 Read: S: 23
D: ch6 Von N-M Theory - Final comments on N-M
|11/25 Read: Same as 11/13
Do:S: 23: 2
|13||11/20 No Class||11/22 No Class|
|14||11/27 Read: S: 23 &25
Do: S: 23 : 1,3,4,6
|15||12/4 Read: S: 25
|12/6 Read: S:16, 29
D: Ch 5: Nash Arbitration Scheme
|1||8/28 Introduction:What game?
Representations: (Normal)Matrix, (Extensive)Tree
|8/30 2-Person 0-Sum Matrix games:
Equilibria & Saddles
Combinatorial Games I (Hex in 2 space -FAQ & IAQ)
|2||9/4 Labor Day, No class||9/6 Intro to Prob.& Mixed Strategies
Equilibria with Mixed Strategies
Combinatorial Games II (More on Hex)
|3||9/11 Finish Hex (?)
More on Mixed Strategies.
|9/13 More on Mixed strategies
A brief excursion into Linear Programming
Games in Tree Form
Nim Presentation by P. Chinn
|9/20 Linear Programming and Matrix Games|
|5||9/25 Some closing remarks on LP and duality.
Combinatorial Games III (Tic-Tac-Toe in 2 and 3 space and on a torus)
|6||10/2 End of Utility
Begin Bi-matrix games.
|10/4 Bi-Matrix games.
Begin Social choice problem.
|7||10/9 No class.(watch video lecture)||10/11 Continue Bi-Matrix games.
Comb'l games IV(Dots and Boxes)
|8||10/ 16 More on Lemke-Howson Algorithm||10/18 Finish L-H Algorithm|
|9||10/23 Midterm Examination||10/25 Proof of Nash's theorem for 2 (or n) - players.|
|10||10/30 Brower Fixed Point theorem.
Political Applications and power indices.
|11/1 More on power: Characteristic function form of a game, Shapley value, Shapley-Shibik and Banzhaf Power indices.|
|11||11/6 Joe Bruce presentation on an application to anthropology (S: ch 26)||11/8More on the Shapley value of a game.|
|12||11/13 Tyler Ludlow presentation on The Prisoners' Dilemma.||11/15 Imputations and Stable Sets.
|11/20 No Class||11/22|
|14||11/27 Examples of Stable Sets and an empty core.||11/29 Le
The Best Way to Knock 'em Down
|15||12/4 Riley Williams presentation on the Football Draft.
|12/6 n- person Bargaining
Hypercube Tic Tac Toe
|16||12/11 Student Talks||12/13 Student Talks
Multistage games? Infinite games?
Games, models and the infinite: strategies, players
|17 Final Exam?|
Description: The mathematical theory of games provides
a conceptual model for many social, political, and economic contexts. This
course will explore several different models for games with their applications
both informally and with mathematical rigor.
Prerequisite: Familiarity with Matrix algebra ( for example: Math 104, Math 213, or Math 241) or permission of instructor.
Notice that as little as 35% , and at most 45% of your grade is from examinations, so regular participation is essential to forming a good foundation for your grades as well as your learning.** See the course schedule for the dates related to the following:
Missing more than 6 hours of class time may lower your final grade for poor participation.
Back to HSU Math. Department :}
Last updated: 8/17/00