This page will provide WWW access to various documents concerning CSC2421. Announcements will also be made on this page.
There are many web accessible courses that indicate the diversity of topics taught in graduate algorithms courses. For example, you may want to consider the following sources:
The fourth week consisted of two presentations: Koosha's presentation for min cost matching with delays, and Noah's presentation of buffers and the QoS problem.
The fifth week consisted of two presentations: Ray's presentation of option pricing and Yuqui's prsentation of the EV charging-pricing-problem.
The sixth week consisted mainly of a presentation by Rebecca regarding online path planning. The remainder of the class was a quick discussion of the secretary problem, prophet inequalities and prophet secretaries as in the text.
The seventh week consisted of a presentation by Randy regarding online max sat and submodular maximization followed by an introduction to bandits and causal models by Arnav. Arnav has porovided his slides in advance of the class.
The eighth week will consist of presentations by Mohammed and Soroush regarding online algorithms and fairness.
The ninth week will consist of presentations by Amanjit regarding the primal dual metod for online problems followed by Esther's presentation on 3 dimensional search and navigation.
In the tenth week Aminjit will finish his presentation of the primal dual method and Fengwei will begin a discussion of social networks, local algorithms and dynmaic graph algorithms.
In the eleventh week, Fengwei finished his presentations of social networks and Noah presented the optimal competitive algorithm for the QoS problem. Arnav started on the completion of his presentation on casual models and will finish that next week.
In the twelth week, Amin gave a presentation on reinforcement learning. Arnav completed of his presentation on casual models and Yuqui finished his presentation regarding EV charging pricing.
In our final week, Mohammed gave a presentation on competitive secretary problems. Ray completed his presentation on robust option pricing. Slides contain links to the relvant papers. In addition to his updated slides, I am posting (in the additional papers below) the DeMarzo et al paper upon which his presentation was based.