Course Identification

Title:

Algorithmic mechanism design

Code:

20184011

Lecturers and Teaching Assistants

Lecturers:

Prof. Shahar Dobzinski

TA's:

N/A

Course Schedule and Location

Year:

2018

Semester:

First Semester

When / Where:

Sunday, 10:00 - 12:00, Ziskind, Rm 1

First Lecture:

05/11/2017

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points

Comments

N/A

Prerequisites

Basic knowledge of algorithms, complexity, and probability.

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

40%

Final:

60%

Evaluation Type

Take-home exam

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

3

Syllabus

Algorithmic game theory is a field in the intersection of computer science, game theory, and economics. This course will focus on mechanism design, a subfield that deals with the design of algorithms that take into account the incentives of the participants. We will learn how to design good algorithms that work well even if the users are selfish and do not necessarily cooperate with the algorithm.

Learning Outcomes

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

Demonstrate familiarity with the basic notions of algorithmic game theory and algorithmic mechanism design.
Understand some current important research directions in algorithmic mechanism design.

Reading List

N/A.

Website

N/A