Die Informatik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Verwaltung des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Informatik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Mathematik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Universität Bremen


INHALT & PFAD:
Startseite Detail

Bild: Zum Thema ''

Analysis of Equilibria for (Some) Congestion Games



Datum: 08.05.2018
Uhrzeit: 16.00 Uhr s.t.

Ort: MZH 6210


Vortragende(r): Prof. Marc Uetz Homepage - Vortragende(r) (Universiteit Twente)

The three papers that were awarded the Gödel Prize in 2012 deal with the analysis of equilibria for certain resource allocation problems. The term “equilibrium" refers to the fact that the solutions to these problems depend on the behaviour of selfish players, and one assumes that an equilibrium such as e.g. the Nash equilibrium is a possible, stable outcome. It is well known that such equilibria may be suboptimal in terms of some central objective function, and maybe surprisingly, this is even true when this central objective function is the sum of the users’ objectives. Today, the degree of inefficiency of equilibria is well known as the price of anarchy. Congestion games, and more specifically network routing games are the showcase problems in that area. The talk gives a (subjective) view on some recent results in that area, some of them based on my own work with several coauthors.

Biografie
Marc Uetz graduated in Mathematics from the Technical University of Berlin in 1997, and received his PhD in Mathematics from the same university in 2001. His advisor was Rolf Möhring. From 2002 to 2009, he was assistant and associate professor at Maastricht University, in the Department of Economics. Since 2007, he has been the chair of Discrete Mathematics and Mathematical Programming in the Department of Applied Mathematics at the University of Twente. He has been a visiting professor at various places, including the MPI Saarbrücken (2003), TU Vienna (2004), Zhejiang University (2010 & 2012), IBM T.J. Watson USA (2007 & 2011), TU Berlin (2014), and the Simons Institute at UC Berkeley (2016). His research area is in discrete optimization and algorithmic game theory, with fundamental contributions particularly in the theory of scheduling. Since 2011, he has been area editor for Operations Research Letters, and he serves on the boards of Discrete Optimization as well as the Journal of Scheduling. He has graduated more than 12 PhD students since 2009.



Ansprechpartner(in) / Einladende(r):
Nicole Megow


Download:




zurück  

Seitenanfang  -  Impressum Zuletzt geändert durch: jungmann [b]   10.04.2018 Admin-Login