Workshop on Advances in Algorithmic Game Theory

The workshop will take place in room L120 (new building). Once you enter CWI, please follow the indicated directions.

The final program of the workshop is given below. It is also available as pdf file: program (excl. abstracts) and program (incl. abstracts)

Update: The slides of the talks (as provided by the speakers) are given below.

Thursday, September 2, 2010

9:50-10:00
Opening

10:00-11:00
Tim Roughgarden (Stanford University, USA)
Smoothness arguments and the price of anarchy
slides

Coffee break

11:20-11:45
Constantinos Daskalakis (MIT, USA)
Geometrically embedded local search

11:45-12:10
Tobias Harks (Technical University Berlin, Germany)
Pure Nash equilibria and potential functions in weighted congestion games
slides

12:10-12:35
Martin Hoefer (RWTH Aachen University, Germany)
Coalitions and dynamics in network routing games

12:35-13:00
Evangelos Markakis (Athens University of Economics and Business, Greece)
Coalition formation and price of anarchy in Cournot oligopolies
slides

Lunch break

14:00-15:00
Michal Feldman (Hebrew University of Jerusalem, Israel)
Truth and justice: envy-freeness, truthfulness and the interplay between them

Coffee break

15:20-15:45
Ahuva Mu'alem (California Institute of Technology, USA)
On scheduling mechanisms: theory, practice and pricing
slides

15:45-16:10
Rob van Stee (MPI for Informatics, Germany)
Truthful approximations for machine covering

16:10-16:35
Rene van den Brink (VU University Amsterdam, The Netherlands)
Cooperative games with a permission structure: axiomatization and computation of solutions
slides

16:35-17:00
Piotr Krysta (University of Liverpool, UK)
Combinatorial auctions with verification are tractable

19:30
Workshop dinner at the IJ Kantine

Friday, September 3, 2010

10:00-11:00
Jason Hartline (Nothwestern University, USA)
Approximation in mechanism design
slides

Coffee break

11:20-11:45
Robert Kleinberg (Cornell University, USA)
Bayesian algorithmic mechanism design in multi-dimensional settings
slides

11:45-12:10
Rudolf Müller (Maastricht University, The Netherlands)
Path-monotonicity and incentive compatibility
slides

12:10-12:35
Patrick Briest (University of Paderborn, Germany)
Pricing lotteries
slides

12:35-13:00
Nicole Immorlica (Northwestern University, USA)
Pricing information cascades

Lunch break

14:00-15:00
Ioannis Caragiannis (University of Patras, Greece)
Efficient coordination mechanisms for selfish scheduling
slides

Coffee break

15:20-15:45
Giorgios Christodoulou (MPI for Informatics, Germany)
Improving the price of anarchy for selfish routing via coordination mechanisms

15:45-16:10
Orestis Telelis (INRIA Sophia-Antipolis, France)
Discrete strategies in keyword auctions and their inefficiency for locally aware bidders

16:10-16:35
Stefano Leonardi (Sapienza University of Rome, Italy)
Combinatorial auctions with budgets
slides