BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250425T120000
DTEND;TZID=Asia/Kolkata:20250425T170000
DTSTAMP:20260924T045142
CREATED:20250421T081314Z
LAST-MODIFIED:20250425T112605Z
UID:1492-1745582400-1745600400@homecse.iitd.ac.in
SUMMARY:How many matches does it take to find a champion?
DESCRIPTION:Speaker: Neeldhara Misra\n\nAbstract: Suppose there are n horses and we have a track with k lanes. If we pick k horses to run a race\, a linear ordering is established among the chosen horses\, based only on the finishing order (race time is not considered). How many races do we need to organize to determine the best two horses? How many races are necessary to reveal the full ranking?\n \nTo address this question\, we might assume that there is an overall linear ordering among all horses and that the outcomes of the races are always consistent with this global linear order. However\, this may not be true in real-world tournaments: actual outcomes may deviate from our estimate of the global order. In this talk\, we will discuss some developments around questions of determining the “top k” elements in the general setting of tournaments and the special situation when we are promised that comparisons are consistent with an underlying linear order.\n \nThe results presented are drawn from the following papers:\n \nVariations on the Tournament Problem\nFabrizio Luccio\, Linda Pagli\, Nicola Santoro\nFUN 2024\n \nQuery Complexity of Tournament Solutions\nArnab Maiti\, Palash Dey\nTCS 2024\n \nShort bio: Neeldhara Misra is a Smt. Amba and Sri. V S Sastry Chair Associate Professor of Computer Science and Engineering at the Indian Institute of Technology\, Gandhinagar. She completed her PhD from the Institute for Mathematical Sciences in 2012 in Theoretical Computer Science. Her research interests include the design and analysis of algorithms and computational social choice. She is also interested in visualizations and other methods to communicate computational thinking at an elementary level. She also enjoys learning about new card tricks\, especially self-working ones — even though she can’t remember any!\nhttps://www.neeldhara.com/
URL:https://homecse.iitd.ac.in/event/how-many-matches-does-it-take-to-find-a-champion/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
END:VCALENDAR