Course Identification

Title:

Algorithmic Game Theory

Code:

20244102

Lecturers and Teaching Assistants

Lecturers:

Prof. Uriel Feige

TA's:

Yotam Gafni

Course Schedule and Location

Year:

2024

Semester:

Second Semester

When / Where:

Tuesday, 14:00 - 16:00, Ziskind, Rm 1

First Lecture:

09/04/2024

End date:

09/07/2024

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Elective; 2.00 points
Chemical Sciences: 2.00 points
Life Sciences (Systems Biology Track): Computer Sciences & Mathematics; 2.00 points
Mathematics and Computer Science (Systems Biology / Bioinformatics): Computer Sciences & Mathematics; 2.00 points

Comments

N/A

Prerequisites

Basic knowledge (at an undergraduate level) of algorithms, computational complexity notions,linear algebra, probability theory.

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

50%

Final:

50%

Evaluation Type

Final assignment

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

3

Syllabus

The course will review basic concepts from game theory, social choice and economics (such as Nash equilibrium, fair division, auctions, mechanism design), and study them from a computer science angle (such as algorithms for computing solutions, relaxations of solution concepts, price of anarchy).

More details about the contents of the course might be added at a later time.

Learning Outcomes

Upon successful completion of this course students should be able to:

[1] Demonstrate familiarity with the basic theory and research directions in the algorithmic game theory.

[2] Read and appreciate research papers in the field of algorithmic game theory.

Reading List

Some lecture notes and additional reading material will be provided during the course.

Website

N/A