Algorithmic game theory (NDMI098) - tutorials

Time of the tutorial: Tuesday 10:40am, in room S1.

Instructor: Martin Balko E-mail: balko (AT) kam.mff.cuni.cz

Lectures.
Information:
up
  • The tutorials take place every week according to the preliminary schedule shown below.
  • You can earn up to 100 points in total by successfully completing 4 tests assigned during the semester. On average, you will be able to earn approximately 25 points from each test.
  • To receive the course credit, you need to earn at least 50 points. In general, the more points you earn, the easier the exam will be. If you earn at least 85 points, you will not be required to solve the exam problem.
  • To help you prepare for the tests, more difficult exercises will also be assigned for practice at home. You may consult their solutions, but no points will be awarded for them.
  • All results will be available via Sovička. To enroll in the course, use the token eee5367177a1.
Tutorials:
up
  • First tutorial (29.9.2026): Introduction, linear programming boot camp. We showed solutions for exercises 1, 3, 4, and 5. List of exercises: [PDF].
  • Second tutorial (6.10.2026): Nash equilibria. We showed solutions for exercises 1, 2, 3b, and 4 and we computed Nash's equilibria for the Battle of Sexes game. List of exercises: [PDF].
  • Third tutorial (13.10.2026): Pure Nash equilibria. We showed solutions for exercises 1, 2, 3, and 4c. List of exercises: [PDF].
  • Fourth tutorial (20.10.2026): To be added. First test.
  • Fifth tutorial (27.10.2026): To be added.
  • Sixth tutorial (3.11.2026): To be added.
  • Seventh tutorial (10.11.2026): To be added. Second test.
  • (17.11.2026): The tutorial is cancelled (Struggle for Freedom and Democracy Day).
  • Eighth tutorial (24.11.2026): To be added.
  • Ninth tutorial (1.12.2026): To be added. Third test.
  • Tenth tutorial (8.12.2026): To be added.
  • Eleventh tutorial (15.12.2026): To be added.
  • Twelfth tutorial (5.1.2026): To be added. Fourth test.
Valid XHTML 1.0 Transitional