Algorithmic Game Theory

(summer semester 2017-2018)

(Homepage of the course. Exercises freely inspired from this.)

Resources

Tutorials

  1. Graph-games, Hex, Nim, impartial games, Sprague–Grundy's theorem [cw1.pdf].
  2. Non-determined games, Banach-Mazur, impartial games, mex [cw2.pdf].
  3. Chomp, Ordinal chomp, Ordinal Nim, Silver dollar [cw3.pdf].
  4. Strategies, Game isomorphisms, One-player parity games, First cycle games [cw4.pdf].
  5. First cycle games (cont.). Büchi, coBüchi, 1-Rabin, 1-Street, 2-Büchi [cw5.pdf].
  6. Reachability games in linear time, Büchi games in quadratic time, Büchi & parity as Muller [cw6.pdf].
  7. Recursive algorithm for parity games. Three player games are not determined [cw7.pdf].
  8. Muller memory lower-bound. Closure properties of Muller conditions. Computing memoryless winning strategies [cw8.pdf].
  9. Register-index. Game simulations [cw9.pdf].
  10. Examples of two-player, zero- and nonzero-sum games [cw10.pdf].
  11. Computing pure equilibria. Computing mixed equilibria for 2 and >2 player games [cw11.pdf].
  12. Symmetric equilibria. Tragedy of the commons. Zero-sum >2 player games [cw12.pdf].
  13. Mean-payoff games: examples, infinite-memory, 1-player PTIME [cw13.pdf].
  14. Discounted games, simple stochastic games [cw14.pdf].

HOMEWORK

  1. First homework. Deadline: 09/05/2018. Send PDF to me.
  2. Second homework. Deadline: 26/06/2018. Send PDF to me.
  3. September homework. Deadline: 11/09/2018. Send PDF to me.