Algorithmic game theory (NDMI098) - tutorials


Time of the tutorial: Thursday 5:20pm, in the room S4. The course will be taught online via Zoom.

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.
  • You will get the credit if you solve 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. I will give you hints for the most difficult problems after two weeks. After I give you a hint for a problem, the amount of points that you can get for solving this problem reduces to half of the original maximum. If you hand in a better solution after the hint has been given, I will add half of the points from your previous solution to the points from your new solution. It is not possible to get any points for solving the problems after a deadline has passed.
  • You need at least one quarter of all available points, that is 8.5 points, to get credit for the course.
  • Generally, the more points you get, the easier the exam will be for you. For at least 26 points, you will pass the exam.
  • On the day of a deadline, your solutions should be handed in before the lecture.
  • If you wish to see your score on this page, please choose a nickname and write it on the paper with your solutions (as well as your name), or send it by e-mail. Without the nickname I will not make your score public.
  • Current scores:
Přezdívka:   1.1   1.2   1.3   1.4   2.1     2.2     2.3    3.1   3.2   3.3    4.1     4.2a     4.2b     4.3    Total   Credit 
 Max Perfect  2 1 3 2 4 2 3 2 2 3 3 2 3 2 34 ---
 Mafi  2 1 2 2 4 2 2 2 3 3 1.5 1.5 26 YES
 Andílek  2 1 3 2 4 2 2.5 2 2 3 3 2 3 31.5 YES
 Bankai  2 1 3 2 4 2 3 2 2 3 3 2 3 32 YES
 Nina  2 1 3 2 4 2 3 2 2 3 3 2 3 2 34 YES
 woq  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 Fíla  2 1 3 2 4 2 3 2 2 3 3 2 3 2 34 YES
 Qwertu  2 1 3 2 4 1.5 3 2 2 3 3 2 1 1 30.5 YES
 Arthaka  2 1 3 2 4 1 2 2 3 20 YES
 Yongaron  2 1 3 2 4 2 3 2 2 3 3 2 3 2 34 YES
 caeph  2 1 2 2 4 2 2 2 3 3 2 1 26 YES
 OK  2 1 3 2 4 1.5 3 2 2 3 3 2 28.5 YES
 ji59  0.5 1 2 1.5 5
 ML  2 1 3 2 4 3 2.5 2 2.5 1.5 2 0 2 27.5 YES
 cihlička  1.5 1 2 3 2 9.5 YES
 kořenová zelenina  2 1 3 2 4 1.5 3 2 2 3 3 1.5 28 YES
 JV  2 1 3 2 4 2 2.5 2 2 1 21.5 YES
 Alex  2 1 1 1 4 2 3 2 2 3 3 2 3 29 YES
 Pogy  2 1 3 2 3 2 3 2 2 3 3 2 28 YES
 Petr  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 Martin  2 1 3 2 4 1 3 2 2 3 3 2 3 31 YES
 VP  1 1 1 0 3
 MC  1.5 1 1 3.5
 Fanda  2 1 2 2 4 2 2 3 3 2 3 26 YES
 MD  1.5 1 1.5 1 2 1 3 1 12 YES
 VS  1.5 1 2 2 2 1 2.5 1 1 0.5 14.5 YES
 fish  2 2 3 3 2 3 2 17 YES
  
  • Homework assignment 1: [PDF-CZ, PDF-ENG] - assigned 8.10.2020, deadline 29.10.2020.
  • Homework assignment 2: [PDF-CZ, PDF-ENG] - assigned 29.10.2020, deadline 12.11.2020.
  • Homework assignment 3: [PDF-CZ, PDF-ENG] - assigned 3.12.2020, deadline 17.12.2020.
  • Homework assignment 4: [PDF-CZ, PDF-ENG] - assigned 17.12.2020, deadline 7.1.2021.

Tutorials:
up
  • First tutorial (8.10.2020): Introduction, Nash equilibria. The tutorial was held via Zoom [ZIP]. We showed solutions for exercise 1 and we computed Nash's equilibria for the Battle of Sexes game. List of exercises: [PDF-CZ, PDF-EN].
  • Second tutorial (29.10.2020): Lemke–Howson algorithm. Deadline for Homework assignment 1. The tutorial was held via Zoom [ZIP]. We showed solutions for Homework assignment 1 and for exercise 1 (example of complementary pivoting). List of exercises: [PDF-CZ, PDF-EN].
  • Third tutorial (12.11.2020): Epsilon-Nash and correlated equilibria. Deadline for Homework assignment 2. The tutorial was held via Zoom. We showed solutions for Homework assignment 2, exercise 2 from Tutorial 2, and for exercises 2 and 3. List of exercises: [PDF-CZ, PDF-EN].
  • Fourth tutorial (3.12.2020): Regret minimization. The tutorial was held via Zoom. We showed solutions exercises 1 and 3. List of exercises: [PDF-CZ, PDF-EN].
  • Fifth tutorial (17.12.2020): Revenue-maximizing auctions. Deadline for Homework assignment 3. The tutorial was held via Zoom. We showed solutions for exercises 1, 2, and 3. List of exercises: [PDF-CZ, PDF-EN].
  • Sixth tutorial (7.1.2021): Bulow–Klemperer theorem and multi-parameter mechanism design. Deadline for Homework assignment 4. The tutorial was held via Zoom. We showed solutions for exercises 1, 2, and 3. List of exercises: [PDF-CZ, PDF-EN].

Valid XHTML 1.0 Transitional