BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Optimization and Incentives Seminar
SUMMARY:Expanding Search on Networks - Steve Alpern (Unive
rsity of Warwick)
DTSTART;TZID=Europe/London:20140218T140000
DTEND;TZID=Europe/London:20140218T150000
UID:TALK49541AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/49541
DESCRIPTION:This joint work with Tom Lidbetter considers searc
hing a network in a different way\, which we call
expanding search. In the discrete case\, where the
Hider is restricted to hiding at one of the k no
des of a network 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 eve
ry other node n(i) is adjacent to a previously se
arched node n(j)\, for some j<\;i. We consider
both the Bayesian problem where the Hider distrib
ution is known\, and the search game where the Hid
er picks his node. The payoff is the expected sear
ch 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\, Wilberfo
rce Road\, Cambridge
CONTACT:Felix Fischer
END:VEVENT
END:VCALENDAR