Algorithmic game theory (NDMI098) - tutorials


Time of the tutorial: Thursday 3:40pm, in the room S9.

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 roughly at least one quarter of all available points, that is 9 points, to get credit for the course.
  • Generally, the more points you get, the easier the exam will be for you. For at least 27 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 ---
 Metyk  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 TS  2 1 1.5 2 4 2 3 2 2 3 3 2 2 29.5 YES
 Miška  2 1 3 2 4 2 3 2 2 3 3 27 YES
 VJ  2 1 3 2 4 2 3 2 2 3 3 1 28 YES
 brot  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 regnet  2 1 3 2 4 2 3 2 2 3 3 27 YES
 Dejf  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 Avelli  2 1 3 2 8
 Basmala  2 1 3 2 4 2 2.5 2 2 3 3 1 27.5 YES
 Jelly Bean  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 sakra  2 1 3 2 4 2 3 1.5 2 3 3 1.5 28 YES
 Matus  2 1 3 2 4 1.5 3 2 2 3 3 2 2 30.5 YES
 riadok  2 1 3 2 3.5 1.5 3 2 2 3 3 2 3 31 YES
 mohy  2 1 3 2 4 2 2.5 2 1.5 3 3 2 28 YES
 jan.ruzicka  2 1 2 2 4 1 3 2 2 3 3 2 0 1 28 YES
 Hamle  2 1 2 2 4 2 3 1.5 2 2 3 1.5 1 1 28 YES
 hynky  2 1 3 2 4 1 3 2 2 3 3 1 27 YES
 Chš  2 1 2 2 4 2 3 2 2 3 3 2 2 30 YES
 LM  1 1 1.5 1 4.5
 Hobití bard  2 1 1 4
 Idefix  2 1 2 2 4 1.5 3 2 2 3 3 1 0 1.5 28 YES
 Frank Sinatra  2 1 2 2 4 2 3 2 2 3 3 1.5 27.5 YES
 ohnivac  2 1 3 2 4 2 3 2 2 2 2.5 2 27.5 YES
 LA  2 1 3 2 4 2 3 2 2 3 3 2 29 YES
 Kyberšutr  2 1 3 2 4 2 3 2 2 3 3 1 28 YES
 TZ  2 1 2.5 2 3.5 1 3 1.5 2 3 3 1 0 2 27.5 YES
 Dafča  2 1 3 2 4 2 3 2 2 3 3 2 1 30 YES
 pheeck  2 1 3 2 3.5 2 3 2 2 3 3 2 28.5 YES
 nutrie  2 1 2 2 4 2 3 2 2 3 3 2 3 31 YES
 monkers  2 1 2 2 7
 Omas  2 1 2 4 2 3 2 2 2.5 3 2 1 1 31.5 YES
 Freddy  2 1 3 2 8
 SZ  2 1 1 4 2 3 2 2 3 3 1 3 2 29 YES
 Anicka  2 1 2 1.5 4 2 3 2 2 3 2 2.5 27 YES
 AK  2 1 1 1.5 3 2 2 2 1.5 16 YES
 JP  2 1 3 2 4 2 3 2 2 3 3 2 1 30 YES
 Jakoma02  2 1 3 2 3 2 2 3 18 YES
 VR  1.5 2 2.5 2.5 1 9.5 YES
  
  • Homework assignment 1: [PDF-CZ, PDF-ENG] - assigned 7.10.2021, deadline 28.10.2021.
  • Homework assignment 2: [PDF-CZ, PDF-ENG] - assigned 4.11.2021, deadline 18.11.2021.
  • Homework assignment 3: [PDF-CZ, PDF-ENG] - assigned 2.12.2021, deadline 16.12.2021.
  • Homework assignment 4: [PDF-CZ, PDF-ENG] - assigned 16.12.2021, deadline 6.1.2022.

Tutorials:
up
  • First tutorial (30.9.2021): Introduction, Nash equilibria. We showed solutions for exercises 1, 2b, and 4 and we computed Nash's equilibria for the Battle of Sexes game. List of exercises: [PDF-CZ, PDF-EN].
  • Second tutorial (4.11.2021): Lemke–Howson algorithm. 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 (18.11.2020): Epsilon-Nash and correlated equilibria. We showed solutions for Homework assignment 2 and exercises 1, 2, and 3. List of exercises: [PDF-CZ, PDF-EN].
  • Fourth tutorial (2.12.2021): Regeret minimization. We showed solutions for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].
  • (9.2.2021). We will have a lecture.
  • Fifth tutorial (16.12.2021): Revenue maximizing auctions. We showed solutions for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].
  • Sixth tutorial (6.1.2022): Bulow–Klemperer theorem and multi-parameter mechanism design (recorded tutorial from last year). 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]. Recorded tutorial: [ZIP].

Valid XHTML 1.0 Transitional