*Instructor:* Dr. Tamás Király

*Topics covered*:
Combinatorial games, k-nim, sums of games, Sprague-Grundy theory.
Hackenbush game, Erdos–Selfridge Theorem, Hex.
Strategic games, domination, pure and mixed Nash equilibrium, iterated elimination. Repeated games, Tit-for-Tat strategy. Proof of the Nash theorem using Kakutani's fixed point theorem
Maxmin strategies, von Neumann's minimax theorem on two-player 0-sum games, correlated equilibrium.
Top trading cycles algorithm, stable matchings, many-to-one matching.
Cooperative games, spanning tree and spanning arborescence games, Shapley value, convex games.
Vickrey auction, Vickrey-Clarke-Groves mechanism

*
Online resources:
*

- Evolution of trust, https://ncase.me/trust/
- Thomas S. Ferguson, Game Theory, http://www.math.ucla.edu/~tom/Game_Theory/Contents.html
- Yuval Peres, Game Theory, Alive, http://www.stat.berkeley.edu/users/peres/gtlect.pdf
- David Pritchard, Game Theory and Algorithms, http://ints.io/daveagp/gta/
- Stephen A. Fenner, John Rogers, Combinatorial Game Complexity: An Introduction with Poset Games, http://arxiv.org/abs/1505.07416
- Atila Abdulkadiroglu, Tayfun Sönmez, Matching Markets: Theory and Practice https://www2.bc.edu/~sonmezt/WorldCongressSurvey-June22-2011.pdf