Campus Event Calendar
Event Entry
What and Who
Game theoretic analysis of networks
Giorgos Christodoulou
Max-Planck-Institut für Informatik - D 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 31 October 2006
13:30
45 Minutes
E1 4
024
Saarbrücken
Abstract
We study the performance of systems, where selfish users share resources. We consider congestion games, a general class of games with interesting properties, that captures nicely such situations. The main tool of our analysis is the Price of Anarchy, that measures the worst-case selfish cost, comparing to the optimal system cost.
In order to cope with selfishness, we consider mechanisms (algorithms). A mechanism aims at implicitly leading
the players to system-desirable equilibria, by appropriately modifying the parameters of the game. We discuss the mechanism
design version of scheduling in unrelated machines.
Contact
Khaled Elbassioni
--email hidden
passcode not visible
logged in users only
Khaled Elbassioni, 10/23/2006 14:20
Khaled Elbassioni, 10/23/2006 14:04 -- Created document.
Khaled Elbassioni, 10/23/2006 14:04 -- Created document.