**SYLLABUS (Game Theory, Spring 2018)**

0. What is Game Theory? (Mathematics has provided insight into two types of games - situations which involve "conflict" or the making of decisions: i. combinatorial games include chess, checkers, Nim, Hex, etc. and ii. political and economic games including Prisoner's Dilemma and Chicken. We will deal primarily with the latter but will also deal with related topics such as elections and voting, two-sided markets, bankruptcy, fair division, and apportionment. In particular we will discuss game theory aspects of the November, 2018 US elections (all 435 members of the House of Representatives will be selected as well as about 1/3 of the Senate). Often the issue is to understand what it means to be fair and/or behave in a rational fashion in a wide variety of contexts.)

1. Taxonomy of games (Number of players, zero-sum games, non-zero-sum games, cooperative and non-cooperative games. Utility: transferable and non-transferable utility. Values for games: equilibrium concepts, Shapley value.)

2. 2-person zero-sum games (Matrix games, pure strategies, using spinners to find optimal mixed strategies; fair games; connections with linear programming. Applications in economics and political science.)

3. 2-person non-zero sum games (Prisoner's Dilemma, Chicken, Nash equilibria, congestion games; Braess's Paradox, price of anarchy. Rationality - connections to behavioral and experimental economics.)

4. Two-sided markets (Gale/Shapley models) (Matchings. Stable marriage. Gale/Shapley models, deferred acceptance algorithm; male optimal - female optimal stable solutions; school choice and other applications, kidney exchange.)

5. Elections and voting (Plurality, run-off, Instant run-off elections, Borda count, Condorcet methods, approval voting. Arrow's Theorem.)

6. Bankruptcy (Proportionality, Maimonides gain and loss, the concede and divide rule and the talmudic method.)

7. Apportionment (Hamilton's, Jefferson's, Webster's and Huntington-Hill's methods. House and population monotonicity. Balinski-Young Theorem.)

8. Combinatorial Games (Nim, graph games. Nim addition and hackenbush.)

Note: Game Theory is not a standard topic in the K-12 curriculum. This course will show how game theory topics can be infused into the usual curriculum (including Standards based curriculum) as ways of illustrating results in arithmetic, algebra, geometry, probability and statistics.

Text: (No one book covers what will be treated in this course. Class notes will be available.)

You may want to look at:

Gura, Ein-Ya and M. Maschler, Insights into Game Theory, Cambridge U. Press, New York, 2008.

which originated as a doctoral thesis in mathematics education in Israel.

Other books you might want to look at is:

Straffin, Philip D. Game theory and strategy. Vol. 36. MAA, 1993. (MAA has issued an updated version of this book.)

DeVos, Matt and D. Kent, Game Theory: A Playful Introduction, American Mathematical Society, Providence, 2016.

Assignments will be in the form of handouts and not from these books.

There will be problems sets to be handed in (several weeks after they are distributed in class), no midterm, but an in class final on the last scheduled day of class. Students taking the "doctoral" version of the course will also have to hand in a project towards the end of the semester. The project is optional for other students.