BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/22
DTSTAMP:20230914T125907Z
SUMMARY:The Multiarmed Bandit Problem: Variations on a Theme
DESCRIPTION:Speaker: Jay Sethuraman\nIndustrial Engineering and Operations 
 Research\nColumbia University\nUnited States of America\nhtt\n\nAbstract: 
 \nWe survey the classical multi-armed bandit problem and discuss several v
 ariations such as the problem of stochastic search in a forest and the uni
 on branching bandit problem. We will discuss structural results\, algorith
 ms for finding optimal policies\, and highlight some open questions (parts
  of the talk are based on joint work with John Tsitsiklis (MIT) and Uri Ro
 thblum (Technion)).\n
URL:https://www.tcs.tifr.res.in/web/events/22
DTSTART;VALUE=DATE:20090817
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR