Algorithmic Game
Theory Seminar
Seminar - 0368.3354
Seminar outline
- Intro +
chapters assignments
19.10.2020
myself
- Chapter
2: Two-person
zero-sum games (sections
2.1-2.5) 26.10.2020 David Dvash
- Chapter
4: General-sum games (sections 4.1-4.5) 2.11.2020
Matan Roet
- Chapter
8: The price of anarchy (sections 8.1-8.2) 9.11.2020
Omri Arad
- Chapter
8: The price of anarchy (sections 8.3-8.4) 16.11.2020
Yahav Zarfati
- Chapter
10: Stable matching (sections 10.1-10.4) 23.11.2020
Yael Lerech
- Chapter
14: Auctions (sections 14.1-14.6)
30.11.2020
Guy Dankovich
- Chapter
14: Auctions (sections 14.7-14.11)
7.12.2020
Yotam Hadas
- Chapter
15: Truthful auctions in
win/lose settings (sections 15.1-15.6) 14.12.2020 Omer Sade
- Chapter
16: VCG and scoring rules (sections 16.1-16.3) 21.12.2020 Shlomo Libo Feigin
- Chapter
17: Matching markets (sections 17.1-17.6)
28.12.2020 Noa Leshem
- Chapter
11: Fair division (sections 11.1-11.2: needs 5.2.2 + figures 5.2,5.3) 4.1.2021 Maor Fiengold
- Chapter
13: Social choice and
voting (sections 13.1-13.7) 11.1.2021
Requirements/Suggestions:
1. Each student prepares his/her
talk by himself (herself)
2. The talk should last at most two sessions
of 45 minutes each
3. The slides can be in
Hebrew/English – the talk is in Hebrew
4. You can use ppt,
pdf or any other software
5. Do not write long text: use
bullets of preferable one line (not more than 2 lines)
6. Do not overload a slide (use more
slides instead)
7. Use overlays
8. Use colors
9. Use Tables, technical figures and
fun figures
10. Proofs should be presented with
intuition
11. Please prepare a question or two
for the audience for each session
12. Email me the presentation 2 days
before the meeting
13. Bring your laptop or
disk-on-key and check before the meeting that it works
14. Grade is based on: (a)
understanding (b) the slides (c) the presentation
Last updated
October 19, 2020