Theory Talk on "Online Algorithms"

11 views
Skip to first unread message

Évariste Club

unread,
May 6, 2020, 2:34:01 PM5/6/20
to Theory
Greetings,
Évariste is holding an online theory talk on "The Competitiveness of Online Assignments" on 7th May (Thursday) from 2 PM to 3 PM. We would share the link to the talk a few minutes before the talk.
Speaker: Varun Ramanathan
Abstract: An "online" problem is one in which an algorithm is sought such that it makes decisions based upon current state without knowing future events. This paradigm is useful in many problems, some inspired by ones we see in "real life": assigning customers or jobs to servers, deciding whether one should buy or rent skis for the remaining winter, etc. There are many more interesting examples. In this talk, we will look at one such problem - online assignments - which was studied by Azar, Naor and Rom in 1992. We will be proving things in this talk.

Regards
Évariste (Maths Club)

Coordinators:
Samarth Singhal
Arsh Verma
Vinayak
Raghav Gupta
Himanshu
Siddhartha Jain
Varun Ramanathan

Évariste Club

unread,
May 7, 2020, 2:37:56 AM5/7/20
to Theory
Hello Everyone
Please find below the Google Meet link for today's Theory Talk at 2PM. 
Please join the call at 1:55 PM so that we can start at 2:00 PM.

Regards
Évariste 
Maths Club

Évariste Club

unread,
May 13, 2020, 8:55:53 AM5/13/20
to Theory, Varun Ramanathan
Hello Everyone
Our apologies for the delay in sharing these slides used in the talk held on 7th May. Link to the slides is attached below. Thanks @Varun, for the amazing talk and the slides.

Regards
Évariste 
Maths Club


Coordinators:
Samarth Singhal
Arsh Verma
Vinayak
Raghav Gupta
Himanshu
Siddhartha Jain
Varun Ramanathan


Reply all
Reply to author
Forward
0 new messages