Isaac Newton Institute for Mathematical Sciences

A Newton Institute Workshop

Topics in Computer Communication and Networks

15 Dec - 21 Dec 2002

Timetable:

List of participants

Monday 16 December

08.30-10.00 Registration

10.00-11.00 F Kelly (Cambridge)

Congestion pricing and capacity expansion games

11.00-11.30 Coffee

11.30-12.30 B von Stengel (London School of Economics)

Games and computation

12.30-13.30 Lunch at Wolfson Court

14.00-15.00 B Voecking (MPI)

Pricing equilibria for a congestion game with incomplete information  More info

15.00-15.30 Tea

15.30-16.00 M Luczak (Cambridge)

On the power of two choices: balls and bins in continous time

16.00-17.00 J Chayes (Microsoft Research)

A model of directed scale-free graphs$^2$

17.15-18.15 Wine & Beer Reception

18.45-19.30 Dinner at Wolfson Court

Tuesday 17 December

10.00-11.00 C Papadimitriou (UC Berkeley)

Understanding the internet graph

11.00-11.30 Coffee

11.30-12.30 E Koutsoupias (Athens)

Co-ordination mechanisms

12.30-13.30 Lunch at Wolfson Court

14.00-15.00 V Vazirani (Georgia Tech)

How intractable is the "invisible hand"

15.00-15.30 Tea

15.30-16.00 A Vetta (McGill)

On the quality of competitive equilibria in games with submodular
social objective functions

16.00-16.30 J Nino-Mora (Pompeu Fabra)

Admission control and routing to parallel queues via Whittle's
restless bandit index policy

16.30-17.00 R Johari (MIT)

Internet resource allocation and a network congestion game  More info

18.45-19.30 Dinner at Wolfson Court

Wednesday 18 December

10.00-11.00 P Raghavan (Verity Inc.)

Measurements on the web graph  More info

11.00-11.30 Coffee

11.30-12.30 C Cooper (Goldsmiths College)

Web graphs: models and algorithms

12.30-13.30 Lunch at Wolfson Court

14.00-15.00 A Karlin (Washington)

Competitive worst-case analysis of truthful auctions: a survey

15.00-15.30 Tea

15.30-16.00 N Carlsson (Abo Akademi)

Asymptotic properties of a simple TCP model

16.00-16.30 I Kaj (Uppsala)

A limit process for long-range dependent arrival models under critical
scaling

19.15 Conference Dinner

Corpus Christi College - Dining Hall

Thursday 19 December

10.00-11.00 E Tardos (Cornell)

Network design with selfish agents

11.00-11.30 Coffee

11.30-12.30 T Roughgardern (Cornell)

Selfish routing and the price of anarchy  More info

12.30-13.30 Lunch at Wolfson Court

14.00-15.00 E Upfal (Brown)

Building low-diameter peer-to-peer networks

15.00-15.30 Tea

15.30-16.00 A Brooms (Birkbeck)

Assessing routing behaviour into a shared resource: simulation vs.
the Nash equilibrium

16.00-17.00 J-Y Cai (Wisconsin)

On REM and SAM-estimation of congestion price using probabilistic
packet marking

18.00-18.30 CUP Reception

Cambridge University Press Bookshop
1 Trinity Street, Cambridge - Wine & snacks will be served

Friday 20 December

10.00-11.00 A Rosen (Technion)

Dynamic routing on networks with fixed-size buffers

11.00-11.30 Coffee

11.30-12.30 R Gibbens (Cambridge)

Fixed point models for performance engineering in enterprise
IP networks

12.30-13.30 Lunch at Wolfson Court

15.00-15.30 Tea

18.45-19.30 Dinner at Wolfson Court


Webmaster
Copyright © 1996 Isaac Newton Institute.
Updated at 10:22 on 23 January 2003