Algorithmic Game Theory (Spring 2018) – 0368-4483

Wednesday 14:10-17:00 — Orenstein 103

Instructor: Michal Feldman
Assistant: Kineret Segal

Selected parts of the book Algorithmic Game Theory, Tim Roughgarden and Jason Hartline, Cambridge University Press 2007 (online version),
Selected parts of the book (draft) Approximation in Economic Design (online version)
Some of the classes are based on Tim Roughgarden's courses, which can be found here:
- Algorithmic Game Theory
- Frontiers in Mechanism Design

Class attendance is mandatory!
Problem sets: 3-4 problem sets will be given during the semeter. You should submit them in pairs.
Final project

home

Click here to edit contents of this page.

Click here to toggle editing of individual sections of the page (if possible). Watch headings for an "edit" link when available.

Append content without editing the whole page source.

Check out how this page has evolved in the past.

If you want to discuss contents of this page - this is the easiest way to do it.

View and manage file attachments for this page.

A few useful tools to manage this Site.

See pages that link to and include this page.

Change the name (also URL address, possibly the category) of the page.

View wiki source for this page without editing.

View/set parent page (used for creating breadcrumbs and structured layout).

Notify administrators if there is objectionable content in this page.

Something does not work as expected? Find out what you can do.

General Wikidot.com documentation and help section.

Wikidot.com Terms of Service - what you can, what you should not etc.

Wikidot.com Privacy Policy.

Algorithmic Game Theory