BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Robust Networks - Sanjeev Goyal\, Department of Economics\, Univer
 sity of Cambridge
DTSTART:20090506T130000Z
DTEND:20090506T140000Z
UID:TALK18229@talks.cam.ac.uk
CONTACT:Sarah Lilienthal
DESCRIPTION:We study networks which are robust in the face of attacks\n\nT
 he key tension here is that on the one hand\, connections facilitate\ncomm
 unication which is essential for task completion while on the other\nhand\
 , connections expose individuals to indirect infection/detection and\nelim
 ination.\n\nWe study a game between a designer and an adversary. The desig
 ner chooses a\nnetwork while the adversary chooses\nthe nodes to attack. W
 e find that the optimal attack strategy involves\ntargeting a few nodes an
 d ignoring the rest. Faced with this attack\nstrategy\, a robust network c
 onsists of equal size groups whose number grows\n(and size falls) as the a
 ttack budget of the adversary increases.\n\nWe then extend this mode: supp
 ose the designer can choose the\nnetwork and defend nodes. The main insigh
 t is that it is attractive\nto protect central nodes as this minimizes the
  prospects of\nindirect detection/infection. As reliability of defence gro
 ws the designer\nlinks more nodes to the protected nodes\; with perfectly 
 reliable defence\nthe robust network is a star.\n\nThis is based on joint 
 work with Adrien Vigier of Cambridge University.\n\n
LOCATION:MR15\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR