Selfish Routing in Networks

Date and location

• Start: Friday, January 28, 2005, 8 p.m.
• End: Saturday, January 29, 2005, 5 p.m.
• Location: University of Kiel, Ludewig-Meyn-Str. 2, room Ü2

Participants

• Rudolf Ahlswede (Bielefeld)
• Harout Aydinian (Bielefeld)
• Andreas Baltz (Kiel)
• Florian Diedrich (Kiel)
• Martin Gairing (Paderborn)
• Lasse Kliemann (Kiel)
• Thomas Lücking (Paderborn)
• Silvia Schwarze (Kaiserslautern)
• Heiko Schilling (Berlin)
• Anand Srivastav (Kiel)
• Berthold Vöcking (Aachen)

Schedule

Friday

• 20:00 Dinner at restaurant Schöne Aussichten

Saturday

• 9:00 - 9:40 M. Gairing: Computing Nash Equilibria for Scheduling on Restricted Parallel Links
• 9:45 - 10:15 A. Baltz: On worst stable queuing strategies
• Coffee
• 10:35 - 11:15 T. Lücking: The Price of Anarchy for Polynomial Social Cost
• 11:20 - 12:00 L. Kliemann: Selfish Multicast Routing and its Relation to Nonatomic Congestion Games
• Lunch
• 13:30 - 14:15 B. Vöcking: Selfish Routing and Evolutionary Game Theory
• 14:20 - 15:00 R. Ahlswede: Identification Entropy and Problems in Network Coding
• Coffee, Discussion Selfish Routing
• 15:40 - 16:20 H. Aydinian: Construction of Broadcast Self-Routing Limited Connectors
• Final Discussion, Planning of Joint Work