Algorithmic game theory (NDMI098) - tutorials

Time of the tutorial: Wednesday 12:20pm, in the room S7.

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

Lectures.
Information:
up
  • The tutorials take place irregularly according to the preliminary schedule shown below.
  • Yon can get up to 35 points for solving enough problems assigned during the semester. Each problem is evaluated according to its difficulty. Usually you will have three weeks to solve the problems and write your solutions. It is not possible to get any points for solving the problems after a deadline has passed.
  • You can also get up to 15 points for a test that will be assigned roughly after the first half of the semester. The test will consist of several problems, each again evaluated according to its difficulty.
  • You need roughly at least one half of all available points, that is 25 points, to get credit for the course.
  • Generally, the more points you get, the easier the exam will be for you. For at least 42 points, you will pass the exam.
  • On the day of a deadline, your solutions should be handed in before the tutorial.
  • All exercises from tutorials as well as all homeworks will be available at Sovička To sign in for the course, use the token e922e083a912. All exercises from tutorials as well as all homeworks will be also available here on this website.
  • Homework assignment 1: [PDF-CZ] - assigned 11.10.2023, deadline 1.11.2023.
  • Homework assignment 2: [PDF-CZ] - assigned 1.11.2023, deadline 15.11.2023.
  • Homework assignment 3: [PDF-CZ] - assigned 29.11.2023, deadline 20.12.2023.
  • Homework assignment 4: [PDF-CZ] - assigned 20.12.2023, deadline 31.1.2024.
Tutorials:
up
  • First tutorial (4.10.2023): Introduction, linear programming boot camp. We showed solutions for exercises 1, 2, 3, 4, and 5. List of exercises: [PDF-CZ].
  • Second tutorial (11.10.2023): Nash equilibria. We showed solutions for exercises 1, 2a, and partially 2b and 4 and we computed Nash's equilibria for the Battle of Sexes game. List of exercises: [PDF-CZ].
  • Third tutorial (25.10.2023): Bimatrix games. We showed solutions for exercises 1, 2, 3, and 5. List of exercises: [PDF-CZ].
  • Fourth tutorial (1.11.2023): Lemke-Howson algorithm. We showed solutions for exercises 1 and 2 and we showed solutions of problems from Homework 1. List of exercises: [PDF-CZ].
  • Fifth tutorial (15.11.2023): Epsilon-Nash and correlated equilibria. We showed solutions for Homework assignment 2 and exercises 1, 2, 3, and partially 4. List of exercises: [PDF-CZ].
  • Sixth tutorial (22.11.2023): We had a test.
  • Seventh tutorial (29.11.2023): Regret minimization. We showed solutions for exercises 1, 2, and 3. List of exercises: [PDF-CZ].
  • Eighth tutorial (6.12.2023): Internal regret and swap regret. We showed solutions for exercises 1, 2, and 4. List of exercises: [PDF-CZ].
  • Ninth tutorial (20.12.2023): Games in extensive form and mechanism design basics. We showed solutions Homework assignment 3 and for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ].
  • Tenth tutorial (10.1.2024): Revenue maximizing auctions. We showed solutions for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ].
Valid XHTML 1.0 Transitional