BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Expanding Search on Networks - Steve Alpern (University of Warwick
 )
DTSTART:20140218T140000Z
DTEND:20140218T150000Z
UID:TALK49541@talks.cam.ac.uk
CONTACT:Felix Fischer
DESCRIPTION:This joint work with Tom Lidbetter considers searching a netwo
 rk in a different way\, which we call expanding search. In the discrete ca
 se\, where the Hider is restricted to hiding at one of the  k nodes of a n
 etwork  Q\, such a search is a sequence of distinct nodes  n(1)\, n(2)\,..
 .\,n(k)\, where  n1 is a given 'root' or 'starting' node\, and every other
  node  n(i) is adjacent to a previously searched node  n(j)\, for some  j&
 lt\;i. We consider both the Bayesian problem where the Hider distribution 
 is known\, and the search game where the Hider picks his node. The payoff 
 is the expected search time. We also consider the case where the Hider can
  hide at any point on the network (where arcs have\ngiven lengths).
LOCATION:MR15\, Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR