Algorithms & Economics of the Internet, CSCI-GA.3033-003
Instructors. Vahab Mirrokni (Google Research) and Richard Cole
Contact info: mirrokni_at_gamil.com;
cole_at_cs.nyu.edu, 417 WWH, tel: 998-3119.
Instructional Assistant. TBA.
Class time. 5:10-7:00pm, Thursday, room 202 WWH.
First meeting. Thursday,
Office hours. Thursday, 3:30-4:30pm..
Course Description. We will be studying
algorithmic and economic problems related to Internet search, online
advertizing, social networks, and online markets. We will discuss
important economic aspects: the ideas behind Internet ad auctions, and
the game theoretic analysis of self-interested agents interacting over
the Internet. We will also cover the central algorithmic ideas behind
the large-scale analysis of the huge data sets supporting Internet
search. Our goal is to obtain a rigorous understanding of the
properties of such environments and to explore these properties to
solve the data mining and optimization problems emerging in these
environments. The main areas include computational economics,
computational advertising, (social) network analysis, commerce
applications, and large-scale distributed computation.
Algorithms or a similar algorithms course; Mathematical Techniques For
CS Applications, or knowledge of linear algebra and discrete
Assessment. Homework 40%; reading from the literature with
brief written reports 10%; final project: this will likely be an
implementation project, but could also be a survey paper or even a
research paper; all groups will make a 5-10 minute presentation at the
final class session.
Academic Integrity. Please take note of the
course and departmental policy on this matter: http://www.cs.nyu.edu/web/Academic/Undergrad/academic_integrity.html
Required text. None.
Last modified: November 16, 2013