Martin Balko - personal webpage

Algorithmic game theory (NDMI098) - tutorials

Homepage

Time of the tutorial: Monday 5:20pm, in the room S4.

Instructor: Martin Balko and David Ryzák. E-mail: balko (AT) kam.mff.cuni.cz and david.ryzak99 (AT) gmail.com

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. It is not possible to get any points for solving the problems after a deadline has passed.

You need roughly at least one half of all available points, that is 18 points, to get credit for the course.

Generally, the more points you get, the easier the exam will be for you. For at least 31 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 4.1 4.2 4.3 4.4 Total Credit

Max Perfect 2 1 3 2 4 2 3 3 4 2 2 2 4 34 ---

Jidáš 2 1 3 2 4 2 3 3 4 2 2 2 4 34 YES

Havran 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Student Pilný 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Wllader 2 1 3 1 2 1 1.5 3 4 1.5 1.5 2 4 27.5 YES

jirikalvoda 2 1 3 2 8

čučoriedka 1 1 1 1 4

FrogLife 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

JanPro 2 1 1 2 2 8

Rotem 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

tury 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

error 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Alexandr Kafka 2 1 3 2 8

dwolfv 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Thrayld 2 1 3 2 4 2 3 3 4 2 2 2 4 34 YES

Schkliba 1 1 3 2 4 2 1.5 4 1 1 2 2 24.5 YES

Matfyzák na discu 2 1 3 2 4 2 3 3 2.5 1.5 1 2 4 31 YES

Min Imperfect 2 1 1 1 4 2 3 3 1.5 18.5 YES

kurt 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

TR 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Wei 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Leucanthemum 2 1 3 2 4 2 3 3 4 1.5 2 2 4 33.5 YES

nira 2 1 3 1 3 2 3 3 4 2 2 2 4 32 YES

Matezzzz 2 1 3 2 4 2 3 3 4 24 YES

' OR 0=0 /* 2 1 2 2 4 2 3 3 4 2 2 2 4 33 YES

:) 1.5 1 3 1 1.5 2 3 3 4 2 2 2 4 30 YES

Kagalakan 2 1 3 2 4 2 3 3 4 2 2 2 4 34 YES

olcher321 1 1 1 1 4

Vaflovátor 2 1 3 2 4 2 3 3 4 2 2 2 2.5 32.5 YES

f 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Please let me pass 2 1 3 2 4 2 3 3 2 1 2 2 4 31 YES

PP 2 1 3 3 2 1.5 1.5 3 4 2 2 2 4 31 YES

atrokos 2 1 1 2 4 2 2.5 3 4 21.5 YES

Karel 2 1 1 2 4 2 12

mts246 1 1 1 1 4

Hotovo 2 1 3 2 4 2 3 3 4 2 2 2 4 34 YES

Kirdon 2 1 3 2 4 2 3 3 4 1 2 2 4 33 YES

KELEVRA 2 1 3 2 3 2 3 3 4 2 2 2 4 33 YES

Witness 2 1 3 2 4 2 3 3 4 2 2 4 32 YES

kva 2 1 3 2 4 2 3 3 4 1.5 2 2 1.5 31 YES

NejsemTonda 2 1 2 1 2 3 2 4 2 2 2 4 27

Kimrli 2 1 3 2 4 2 3 4 2 2 2 4 31 YES

miskin 2 1 2 1 2 2 3 3 4 2 2 2 4 30 YES

gleb 1 1 1 1 4

hoodwink 1 1 1 1 4

Okayge 0.5 1 2 1.5 2.5 2 3 3 4 19.5 YES

šmik 2 1 3 2 4 2 3 2 19 YES

CLOUD 2 1 2.5 2 4 2 3 3 2 2 2 2 4 31.5 YES

duck 2 1 2.5 2 4 2 3 3 2 2 2 2 4 31.5 YES

gaga 2 1 3 2 4 2 3 3 4 2 2 2 4 34 YES

RostyaRostya 2 1 1 1 5

lena 2 1 2.5 2 1.5 2 3 3 2 19 YES

krevetka 2 1 2 1.5 4 2 3 3 4 2 2 2 4 31.5 YES

ivlana 2 1 2 2 3 2 12

sorx 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

Mercedes-Benz 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

0000 2 1 0.5 4 2 3 4 1.5 2 20 YES

kjmn 2 1 3 2 4 1.5 3 1.5 4 1.5 2 2 3.5 31 YES

12345 2 1 1 4 0 3 3 14

mclovin 2 1 2 4 2 3 14

Vojta 1 1 2.5 4.5

JiriK 1 1 2 1 5

Alkaline 1 1 3 2 4 2 3 3 3 1.5 2 2 4 31.5 YES

Dancars Chicago 2 1 1 2 4 2 3 2 2 19

mt 2 1 0 1 4

dz 2 1 2 2 4 2 3 3 4 2 2 2 4 33 YES

hhehe 2 1 2 2 4 1 3 2 2 2 1 22 YES

qwerty 2 1 3 1 1 1 1.5 3 4 1.5 2 21 YES

invoker 2 1 1 2 3 4 2 2 2 2 21 YES

saril 1 1 2 2 6

kinaj 2 1 3 2 4 2 3 3 4 2 2 2 1 31 YES

gggonext 1.5 1 2 3 2 3 3 4 19.5 YES

unidentifiedV 2 1 2 4 2 3 3 4 2 2 2 4 31 YES

Dien 1 1 3 1 6

sombrero 1 0.5 0 1 4 2 3 4 15.5

termitronator 2 1 2.5 2 4 2 3 3 3.5 1 2 1.5 4 31.5 YES

Ernesto 2 1 2 2 4 2 3 3 4 2 2 2 4 33 YES

99 2 1 3 2 4 2 3 3 4 2 2 4 32 YES

Mrkev 2 1 2 2 4 2 3 3 4 2 2 2 4 33 YES

123456 2 1 3 2 4 2 3 2.5 19.5 YES

KC 1.5 3 1 4 2 3 3 4 2 2 2 4 31.5 YES

Homework assignment 1: [PDF-CZ, PDF-ENG] - assigned 10.10.2022, deadline 31.10.2022.

Homework assignment 2: [PDF-CZ, PDF-ENG] - assigned 31.10.2022, deadline 14.11.2022.

Homework assignment 3: [PDF-CZ, PDF-ENG] - assigned 28.11.2022, deadline 12.12.2022.

Homework assignment 4: [PDF-CZ, PDF-ENG] - assigned 19.12.2022, deadline 31.1.2023.

Tutorials:
up

First tutorial (10.10.2022): Introduction, Nash equilibria. We showed solutions for exercises 1, 2b, and partially 4 and we computed Nash's equilibria for the Battle of Sexes game. List of exercises: [PDF-CZ, PDF-EN].

Second tutorial (24.10.2022): Linear programming boot camp. We showed solutions for exercises 1, 2a, 2b, 3, 4, and 5. List of exercises: [PDF-CZ, PDF-EN].

Third tutorial (31.10.2022): Lemke–Howson algorithm. We showed solutions for Homework assignment 1 and for exercise 1 (example of complementary pivoting). List of exercises: [PDF-CZ, PDF-EN].

Fourth tutorial (14.11.2022): 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].

Fifth tutorial (28.11.2022): Regret minimization. We showed solutions for exercises 1, 2, 3, and 4. List of exercises: [PDF-CZ, PDF-EN].

Sixth tutorial (19.12.2022): Games in extensive form and mechanism design basics. We showed solutions Homework assignment 3 and for exercises 1 and 3. List of exercises: [PDF-CZ, PDF-EN].

Seventh tutorial (2.1.2023): Revenue maximizing auctions. We showed solutions for exercises 1, 2, and 3. List of exercises: [PDF-CZ, PDF-EN].