BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Robust Networks - Sanjeev Goyal\, University of Cambridge\, Econom
 ics Department
DTSTART:20081119T141500Z
DTEND:20081119T151500Z
UID:TALK13302@talks.cam.ac.uk
CONTACT:Timothy G. Griffin
DESCRIPTION:We study the architecture of networks which are robust to atta
 cks by an intelligent adversary. \n\nWe start with a model in which design
 er chooses a network with a view to maximizing communication between nodes
 \, and the adversary can choose to attack nodes. Our analysis focuses on a
  simple trade-off: better connected agents are more likely to succeed in c
 ompleting the task. Monitoring on the part of the adversary however induce
 s a cost to connecting agents since detection of a single node in the netw
 ork may lead to the detection of other connected nodes. We first character
 ize optimal networks faced with a uniform attack probability of all nodes.
  We show that optimal networks are constituted of cells which increase in 
 number (and decrease in size) as the intensity of monitoring grows. We the
 n examine the optimality of uniform attack strategy: symmetric attacks are
  optimal if adversary has very large budgets\, but asymmetric attacks are 
 optimal otherwise. Interestingly\, optimal networks are constituted of equ
 al size cells\, irrespective of adversary budget size!\n\nWe then allow fo
 r designer to choose a network as well as to defend individual nodes. The 
 robustness of networks now depends on the efficacy of defense and attack t
 echnologies. If nodes can be made attack-proof and designer has small budg
 ets then star network and its variants are optimal.  \n\n
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR