| ||Elliot Anshelevich|
Algorithms and theoretical computer science, especially issues at the intersection of Economics and Computation. Algorithms for large decentralized networks, including networks with strategic agents. Particular interests include: network formation, networked markets, algorithmic game theory, local and decentralized routing algorithms, approximation algorithms, graph algorithms, and information propagation in both social and computer networks. If you are a student who wants to work with me, please also read this.
See my Publications (chronological list, or sorted by topic with descriptions) and Research Statement for more info.
Office Hours - Tuesday and Thursday 3pm-3:50pm (or by appointment)
Spring 2020: CSCI 4020 Design and Analysis of AlgorithmsCSCI 2300 Introduction to Algorithms: Spring 2016, Fall 2016, Spring 2019
Current Graduate Students:
Ben Abramowitz, joined 2016, currently on leave at the Weizmann Institute until Fall 2020.
Wennan Zhu, joined 2016.
Former Graduate Students:
Shreyas Sekar, PhD 2017, now postdoc at Harvard, formerly at University of Washington.
John Postl, PhD 2016, now at Bloomberg.
Onkar Bhardwaj, PhD 2015, now at Akamai, formerly postdoc at IBM Watson.
Ameya Hate, PhD 2012, now at Akamai, formerly at National Bureau of Economic Research (NBER).
Bugra Caskurlu, PhD 2010, now at TOBB Economics and Technology University (Ankara, Turkey), formerly at West Virginia University.
Stephen Gross, RPI class of 2017.
Michael Usher, RPI class of 2013, graduate study at Cornell University.
Matthew Gerrior, RPI class of 2012.
Yonatan Naamad, RPI class of 2010, graduate study at Princeton University.
(Full chronological list)
(Selected publications sorted by topic)