|
|
|
Dec 04, 2024
|
|
MATH 486 - Game Theory (3 units)
Extensive form games; Nash, perfect equilibrium; matrix/bimatrix games; minmax theorem; TU/NTU solutions; marriage, college admissions, and housewrapping games; core; Shapley value; power indices.
Recommended Preparation: MATH 330 .
Grading Basis: Graded
Units of Lecture: 3
Offered: Every Fall
Student Learning Outcomes
Upon completion of this course, students will be able to:
1. model real world problems from the social and biological sciences as cooperative or noncooperative games, and to choose appropriate solution concepts to analyze them.
2. solve strategic form matrix and bimatrix games for both minimax solution and Nash equilibria, use backward induction for finding perfect Nash equilibria in perfect-information extensive form games, find the TU solution for bimatrix games, run the Deferred Acceptance Procedure and Top Trading Cycle algorithms for ordinal preference games, and solve for the core and Shapley Value for n-player TU games.
3. demonstrate an understanding of the underlying theory behind the models, including the minimax theorem, Shapley-Bondareva theorem, Nash’s theorem, the Folk Theorem for repeated games, and the relationship between some of these and linear programming.
4. demonstrate an understanding of some of the subtleties of game theoretic modelling, such as the role and modelling of information, the advantages and disadvantages of modelling using strategic vs extensive form, the difference between cooperative and noncooperative games, and the implications of the “TU-assumption” for cooperative games.
Click here for course scheduling information. | Check course textbook information
Add to Portfolio (opens a new window)
|
|
|