Course Identification

Title:

Topics in Algorithmic Game Theory

Code:

20264172

Lecturers and Teaching Assistants

Lecturers:

Prof. Uriel Feige, Prof. Shahar Dobzinski

TA's:

Vadim Grinberg

Course Schedule and Location

Year:

2026

Semester:

Second Semester

When / Where:

Monday, 14:15 - 16:00, Jacob Ziskind Building, Rm 155

First Lecture:

13/04/2026

End date:

29/06/2026

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Regular; 2.00 points

Comments

N/A

Prerequisites

No

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

20%

Final:

80%

type of exam/final assigment to be decided

Evaluation Type

Examination

Scheduled date 1

Date / due date

22/07/2026

Location

Ziskind, Rm 1

Time

1000-1300

Remarks

N/A

Scheduled date 2

Date / due date

03/08/2026

Location

Ziskind, Rm 1

Time

1000-1300

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

3

Syllabus

We will discuss topics in algorithmic game theory, including solution concepts (such as minimax and Nash equilibrium) and the complexity of computing them, mechanism design, price of anarchy, fair division, auctions, and more.

Learning Outcomes

The students will get familiar with basic concepts and key results in algorithmic game theory, and will be exposed to open questions that lead to potential research directions.

Reading List

N/A

Website

N/A