BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1213
DTSTAMP:20230914T125955Z
SUMMARY:Games of Pursuit and Evasion
DESCRIPTION:Speaker: Neeldhara Misra (IIT Gandhinagar)\n\nAbstract: \nPursu
 it-Evasion games typically involve two types of players: those in pursuit 
 (aka cops) and the so-called evaders (aka robbers). The backdrop is usuall
 y a network with specific rules that dictate how the players can move. The
 se are turn-based games\, and one is usually interested in knowing whether
  and how the evaders can be cornered. We often want to do this as inexpens
 ively and quickly as we can\, which leads to questions about optimizing th
 e number of cops we deploy and the number of rounds that the game will las
 t. It turns out that answers to these questions often have deep connection
 s with the structure of the underlying network. This talk will involve a f
 ew glimpses of such connections. We will also discuss how these games can 
 model real-world situations.\n\nBio: Neeldhara Misra (BSc\, Mount Carmel C
 ollege\, Bangalore\; PhD\, IMSc) is a Smt. Amba and Sri. V S Sastry Chair 
 Associate Professor at IIT Gandhinagar in the discipline of Computer Scien
 ce and Engineering. Prior to this\, she was an INSPIRE faculty fellow at t
 he department of Computer Science and Automation at the Indian Institute o
 f Science\, and graduated from the Institute of Mathematical Sciences\, Ch
 ennai. Her current research interests involve tackling computationally har
 d problems with parameterized algorithms.\n
URL:https://www.tcs.tifr.res.in/web/events/1213
DTSTART;TZID=Asia/Kolkata:20220705T170000
DTEND;TZID=Asia/Kolkata:20220705T183000
LOCATION:AG-66
END:VEVENT
END:VCALENDAR
