skip to content
 

Timetable (CMPW03)

Topics in Computer Communication and Networks

Sunday 15th December 2002 to Saturday 21st December 2002

Monday 16th December 2002
08:30 to 10:00 Registration
Session: Topics in Computer Communication and Networks
10:00 to 11:00 F Kelly ([Cambridge])
Congestion pricing and capacity expansion games
Session: Topics in Computer Communication and Networks
INI 1
11:00 to 11:30 Coffee
Session: Topics in Computer Communication and Networks
11:30 to 12:30 B von Stengel (London School of Economics)
Games and computation
Session: Topics in Computer Communication and Networks
INI 1
12:30 to 13:30 Lunch at Wolfson Court
Session: Topics in Computer Communication and Networks
14:00 to 15:00 B Voecking ([MPI])
Pricing equilibria for a congestion game with incomplete information
Session: Topics in Computer Communication and Networks
INI 1
15:00 to 15:30 Tea
Session: Topics in Computer Communication and Networks
15:30 to 16:00 M Luczak ([Cambridge])
On the power of two choices: balls and bins in continous time
Session: Topics in Computer Communication and Networks
INI 1
16:00 to 17:00 J Chayes (Microsoft Research)
A model of directed scale-free graphs$^2$
Session: Topics in Computer Communication and Networks
INI 1
17:15 to 18:15 Wine \& Beer Reception
Session: Topics in Computer Communication and Networks
18:45 to 19:30 Dinner at Wolfson Court
Session: Topics in Computer Communication and Networks
Tuesday 17th December 2002
10:00 to 11:00 C Papadimitriou ([UC Berkeley])
Understanding the internet graph
Session: Topics in Computer Communication and Networks
INI 1
11:00 to 11:30 Coffee
Session: Topics in Computer Communication and Networks
11:30 to 12:30 E Koutsoupias ([Athens])
Co-ordination mechanisms
Session: Topics in Computer Communication and Networks
INI 1
12:30 to 13:30 Lunch at Wolfson Court
Session: Topics in Computer Communication and Networks
14:00 to 15:00 V Vazirani ([Georgia Tech])
How intractable is the "invisible hand"
Session: Topics in Computer Communication and Networks
INI 1
15:00 to 15:30 Tea
Session: Topics in Computer Communication and Networks
15:30 to 16:00 A Vetta ([McGill])
On the quality of competitive equilibria in games with submodular social objective functions
Session: Topics in Computer Communication and Networks
INI 1
16:00 to 16:30 J Nino-Mora ([Pompeu Fabra])
Admission control and routing to parallel queues via Whittle's restless bandit index policy
Session: Topics in Computer Communication and Networks
INI 1
16:30 to 17:00 R Johari ([MIT])
Internet resource allocation and a network congestion game
Session: Topics in Computer Communication and Networks
INI 1
18:45 to 19:30 Dinner at Wolfson Court
Session: Topics in Computer Communication and Networks
Wednesday 18th December 2002
10:00 to 11:00 P Raghavan ([Verity Inc.])
Measurements on the web graph
Session: Topics in Computer Communication and Networks
INI 1
11:00 to 11:30 Coffee
Session: Topics in Computer Communication and Networks
11:30 to 12:30 C Cooper ([Goldsmiths College])
Web graphs: models and algorithms
Session: Topics in Computer Communication and Networks
INI 1
12:30 to 13:30 Lunch at Wolfson Court
Session: Topics in Computer Communication and Networks
14:00 to 15:00 A Karlin ([Washington])
Competitive worst-case analysis of truthful auctions: a survey
Session: Topics in Computer Communication and Networks
INI 1
15:00 to 15:30 Tea
Session: Topics in Computer Communication and Networks
15:30 to 16:00 N Carlsson ([Abo Akademi])
Asymptotic properties of a simple TCP model
Session: Topics in Computer Communication and Networks
INI 1
16:00 to 16:30 I Kaj ([Uppsala])
A limit process for long-range dependent arrival models under critical scaling
Session: Topics in Computer Communication and Networks
INI 1
19:15 to 18:00 Conference Dinner
Corpus Christi College - Dining Hall
Session: Topics in Computer Communication and Networks
Thursday 19th December 2002
10:00 to 11:00 E Tardos ([Cornell])
Network design with selfish agents
Session: Topics in Computer Communication and Networks
INI 1
11:00 to 11:30 Coffee
Session: Topics in Computer Communication and Networks
11:30 to 12:30 T Roughgardern ([Cornell])
Selfish routing and the price of anarchy
Session: Topics in Computer Communication and Networks
INI 1
12:30 to 13:30 Lunch at Wolfson Court
Session: Topics in Computer Communication and Networks
14:00 to 15:00 E Upfal ([Brown])
Building low-diameter peer-to-peer networks
Session: Topics in Computer Communication and Networks
INI 1
15:00 to 15:30 Tea
Session: Topics in Computer Communication and Networks
15:30 to 16:00 A Brooms ([Birkbeck])
Assessing routing behaviour into a shared resource: simulation vs. the Nash equilibrium
Session: Topics in Computer Communication and Networks
INI 1
16:00 to 17:00 J-Y Cai ([Wisconsin])
On REM and SAM-estimation of congestion price using probabilistic packet marking
Session: Topics in Computer Communication and Networks
INI 1
18:00 to 18:30 CUP Reception
Cambridge University Press Bookshop 1 Trinity Street, Cambridge - Wine \& snacks will be served
Session: Topics in Computer Communication and Networks
Friday 20th December 2002
10:00 to 11:00 A Rosen ([Technion])
Dynamic routing on networks with fixed-size buffers
Session: Topics in Computer Communication and Networks
INI 1
11:00 to 11:30 Coffee
Session: Topics in Computer Communication and Networks
11:30 to 12:30 R Gibbens ([Cambridge])
Fixed point models for performance engineering in enterprise IP networks
Session: Topics in Computer Communication and Networks
INI 1
12:30 to 13:30 Lunch at Wolfson Court
Session: Topics in Computer Communication and Networks
15:00 to 15:30 Tea
Session: Topics in Computer Communication and Networks
18:45 to 19:30 Dinner at Wolfson Court
Session: Topics in Computer Communication and Networks
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons