This seminar accepts students from ETH and UZH, and is offered jointly with Prof. Dr. Seuken from UZH. A first information meeting will be held Wednesday, February 24, 2016, 12:15-13:45 in room CAB H 53 at ETH. In this meeting, the seminar topics will be presented and assigned to participants.The seminar talks will be given in two blocks on two Saturdays, namely May 20 at UZH and May 21 at ETH, from 9 to 15 h each. All participants are requested to be actively present on both dates.
In the seminar we will get familiar with the current original research in the area of algorithmic game theory by reading and presenting selected research papers in that area.
Learning objective
Develop an understanding of selected problems of current interest in the area of algorithmic game theory, and a practice of a scientific presentation.
Content
Study and understanding of selected topics of current interest in algorithmic game theory such as: Complexity Results (class PPAD, PLS, NP), Sponsored Search, Approximation Algorithms via Algorithmic Game Theory, Price of Anarchy, New paradigms of computation (e.g., envy-fee, truthful), Mechanism Design.
Literature
Selected research articles.
Prerequisites / Notice
You must have passed our "Algorithmic Game Theory" class (or have acquired equivalent knowledge, in exceptional cases).
Performance assessment
Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course