Seminar Algorithmic Game Theory (WS 2011/12)

Basic Information

Lecture time:	Tuesday 10-12
Lecture room:	023, Campus E 1.4
Lecturers:	Rob van Stee
Audience:	The seminar counts as computer science seminar (2 SWS, 7 CP). Talks should be given in English.
Credits:	You earn the usual 7 credit points for a seminar if you (i) give a regular presentation of the paper given to you, and (ii) write a short summary (about 5 pages). The summary should be handed in within four weeks after your presentation. The presentation needs to be discussed with me at least one week before your scheduled talk in the seminar: please make an appointment by mail. This means in particular that you should have your presentation READY one week in advance, so that you can give a practice talk and we may discuss it. If you want credit for the course, please register by sending a short mail.
Schedule:	see below.
Book:	Algorithmic Game Theory

Description

The Internet is a structure that has not been created by a single entity, but rather emerged from the interaction of many agents, individuals or companies. Agents normally aim at maximizing their individual benefits. For example, an individual might want to minimize the cost he pays for an item from an online store, or to maximize the bandwidth they get from a service provider. These agents can be viewed as players in a large, distributed game that aim at maximizing their individual utilities, possibly at the cost of other players.

This seminar will focus on algorithmic aspects of economics and game theory as they arise in modern information networks. We will cover a range of topics at the intersection of classical game theory and algorithm design, such as equilibrium concepts, mechanism design, auctions, non-cooperative and cooperative games, inefficiency of equilibria.

Papers

If some of you would prefer to exchange papers, this is of course fine, but please let me know about it.

Scientific Talks in English, by Olivier Danvy

	Calculating Nash equilibria (Nov 8-15)
Nov 8	Max Schlueter
Nov 15	Wenkai Dai
	Price of anarchy/stability (Nov 22-Dec 6)
Nov 22	Felix Klein
Nov 29	Andrey Chernov
	Algorithmic mechanism design (Dec 6-Jan 24)
Dec 6	Thatchaphol Saranurak
Dec 13	Szymon Matejczyk
Dec 20	Bernhard Schommer
Jan 10	David Pfaff
Jan 17	Sebastian Ott
Jan 24	Banafsheh Sadry
	Fair division (Jan 31-Feb 14)
Jan 31	Sandy Heydrich
Feb 7	Gorav Jindal
Feb 7	Nicholas Merritt

More Courses of the Algorithms and Complexity Group