For students who want to work with me:

I am always looking for good PhD students to work with. I usually don't accept Masters students except in extraordinary circumstances.

Students applying to RPI:
If you are a student who is interested in algorithms, game theory, the study of networks, social choice, or any of the other topics mentioned on my webpage, I highly encourage you to apply to RPI. Please mark "Algorithms and Theory" as your primary or secondary interest, and mention that you would like to work with me in your application. This will ensure that I see your application and it will be given full consideration. Please also feel free to email me if you have any questions. Note that I get a lot of email, and I am much more likely to respond to email which mentions at least something related to my general research interests.

I do not offer summer internships to students who are not already at RPI, so please do not email me about those.

Students already at RPI:
Email me and come talk to me. However, unless you already have an extensive background in algorithms (more than just an introductory course), mathematics, game theory, or optimization, I highly suggest that you begin by taking my course "CSCI 4020 - Computer Algorithms" or "CSCI 6210 - Design and Analysis of Algorithms". After you see that you like these kinds of topics, and are good at them, please come talk to me. A good time would be about half-way through the semester.

My research interests:
My research interests are very broad, please see my webpage and (somewhat outdated) Research Statement. A lot of my research concerns algorithms, especially approximation algorithms. A lot of my work also concerns independent agents and game theory. This type of work considers a system in which there are a large number of agents which we cannot control, and which instead act in their own self-interest. This occurs, for example, in the Internet, in social networks, in transportation networks, in voting mechanisms, in auctions, and in a multitude of other interesting settings. More generally, I am interested in algorithmic and approximation problems in all sorts of settings, including network routing, graph algorithms, information propagation in networks, matching markets, etc.

If you are a student who might like to work with me and wants to learn more about my research, here are some of my papers that can give you the flavor of various problems I have worked on (see here for a full list, but the ones below serve as good starting points):