Skip to content

Workshop Programme

for period 16 - 20 December 2002

Topics in Computer Communication and Networks

16 - 20 December 2002

Timetable

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

Back to top ∧