Algorithmic game theory (NDMI098) - tutorials


Time of the tutorial: Thursday 5:20pm, in the room S11.

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 to get credit for the course.
  • Generally, the more points you get, the easier the exam will be for you.
  • 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.a   2.1.b   2.2   2.3   3.1   3.2   3.3   4.1   4.2.a   4.2.b   4.3   Total   Credit 
 Max Perfect  2 1 3 2 2 2 2 3 2 3 2 3 2 3 2 34 ---
 JS  2 1 3 2 2 2 2 3 2 3 2 3 2 3 2 34 YES
 Lukáš  2 1 3 2 2 2 1.5 13.5 YES
 Martesing  2 1 3 2 2 2 2 3 1.5 2.5 2 3 26 YES
 Jarys  2 1 3 2 2 2 2 3 2 3 2 3 2 29 YES
 Johann  2 2.5 1 2.5 8
 Konicek  2 1 2 2 2 2 1 3 2 3 2 3 2 1 28 YES
 JK  2 1 2 2 3 10 YES
 Spanelka  1.5 1 0.5 1.5 1 1.5 1 0.5 0 8.5 YES
 jurkis  2 1 2 1.5 2 2 2 2 2 3 3 2 0 1.5 26 YES
  
  • Homework assignment 1: [PDF-CZ, PDF-ENG] - assigned 10.10.2019, deadline 31.10.2019.
  • Homework assignment 2: [PDF-CZ, PDF-ENG] - assigned 31.10.2019, deadline 14.11.2019.
  • Homework assignment 3: [PDF-CZ, PDF-ENG] - assigned 5.12.2019, deadline 19.12.2019.
  • Homework assignment 4: [PDF-CZ, PDF-ENG] - assigned 19.12.2019, deadline 9.1.2020.

Tutorials:
up
  • First tutorial (10.10.2019): Introduction, Nash equilibria. We showed solutions for exercises 1, 2a, 4, 5b and we showed the result of 5a. List of exercises: [PDF-CZ, PDF-EN].
  • Second tutorial (31.10.2019): Lemke–Howson algorithm. Deadline for Homework assignment 1. We showed solutions for Homework assignment 1 and for exercises 1 (example of complementary pivoting), 2, and 3. List of exercises: [PDF-CZ, PDF-EN].
  • Third tutorial (14.11.2019): Epsilon-Nash and correlated equilibria. Deadline for Homework assignment 2. We showed solutions for Homework assignment 2 and for exercises 1, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].
  • (28.11.2019): We had a lecture.
  • Fourth tutorial (5.12.2019): Regret minimization. We showed solutions for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].
  • Fifth tutorial (19.12.2019): Revenue maximizing auctions. We showed solutions for Homework assignment 3 and for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].
  • Sixth tutorial (9.1.2020): Bulow–Klemperer theorem and multi-parameter mechanism design. We showed solutions for Homework assignment 4 and for exercises 1, 2, and 3. List of exercises: [PDF-CZ, PDF-EN].

Valid XHTML 1.0 Transitional