Workshop on Network design: Optimization and Algorithmic Game TheoryAugust 14-16, 2006Program |
|||
|
||||||||||
Monday, August 14, 2006 |
||||||||
|
|
||||||||
|
Session - Afternoon
Meeting room(s) : 6214 |
|
14:00 - 14:40
|
|
|
14:40 - 15:20
|
Gordon Wilfong
(Bell Laboratories, Lucent Technologies) The Border Gateway Protocol (BGP) and Harmonious Routings | Abstract |
|
15:20 - 15:50
|
Coffee break
|
Room(s) 6245
|
|
15:50 - 16:30
|
Kamal Jain
(Microsoft Research) Primal-dual algorithm for convex optimization - a work in progress | Abstract |
|
16:45
|
Welcoming reception
|
Room(s) 6245
|
Tuesday, August 15, 2006 |
||||||||
|
|
||||||||
|
09:00 - 09:30
|
Coffee & Croissants
|
Room(s) 6245
|
|
Session - Morning
Meeting room(s) : 6214 |
|
09:30 - 10:10
|
Vahab S. Mirrokni
(Microsoft Research) Convergence and Approximation in Games | Abstract |
|
10:10 - 10:50
|
Seffi Naor
(Microsoft Corporation) Non-Cooperative Multicast and Facility Location Games | Abstract |
|
10:50 - 11:20
|
Coffee break
|
Room(s) 6245
|
|
11:20 - 12:00
|
Nahum Shimkin
(Technion) Capacity Management and Equilibrium for Proportional QoS | Abstract |
|
12:00 - 14:00
|
Lunch Break
|
|
Session - Afternoon
Meeting room(s) : 6214 |
|
14:00 - 14:40
|
Kate Larson
(University of Waterloo) Mechanism Design with Limited Information | Abstract |
|
14:40 - 15:20
|
Jason Hartline
(Microsoft Research) Collusion Resistant Mechanism Design | Abstract |
|
15:20 - 15:50
|
Coffee break
|
Room(s) 6245
|
|
15:50 - 16:30
|
Bruce Shepherd
(McGill University) Robust Minimum Cost Networks | Abstract |
|
19:00
|
Workshop Dinner
Bistro L’Entrepont 4622, rue Hôtel-de-ville (Metro Mont-Royal) |
Wednesday, August 16, 2006 |
||||||||
|
|
||||||||
|
09:00 - 09:30
|
Coffee & Croissants
|
Room(s) 6245
|
|
Session - Morning
Meeting room(s) : 6214 |
|
09:30 - 10:10
|
Mohammad Taghi Hajiaghayi
(Carnegie Mellon University) Auctions for dynamic environments: WiFi, last-minute tickets and grid computing | Abstract |
|
10:10 - 10:50
|
Nicole Immorlica
(Microsoft Research) Matroids, Secretary Problems, and Online Mechanisms | Abstract |
|
10:50 - 11:20
|
Coffee break
|
Room(s) 6245
|
|
11:20 - 12:00
|
Yishay Mansour
(Tel Aviv University) Strong Price of Anarchy | Abstract |
|
12:00 - 14:00
|
Lunch Break
|
|
Session - Afternoon
Meeting room(s) : 6214 |
|
14:00 - 14:40
|
Tim Roughgarden
(Stanford University) Approximately Efficient Cost-Sharing Mechanisms for Network Design | Abstract |
|
14:40 - 15:20
|
Jochen Konemann
(University of Waterloo) An Efficient Cost-Sharing Mechanism for the Prize-Collecting Steiner Forest Problem | Abstract |
|
15:20 - 15:50
|
Coffee break
|
Room(s) 6245
|
|
15:50 - 16:30
|
Andreas S. Schulz
(MIT) On the computational complexity of congestion games | Abstract |
Last modified : Monday, April 14, 2014 11:22