Skip over navigation

Course Offerings

Course Evaluation Results

Course Details

Fall 2012-2013
* COS 445   Graded A-F, P/D/F, Audit

Networks, Economics and Computing

Mark Braverman

Computation and other aspects of our lives are becoming increasingly intertwined. In this course we will study a variety of topics on the cusp between economics and computation. Topics to be covered include: games on networks, auctions, mechanism and market design, reputation, computational social choice. The aim of the course is two-fold: (1) to understand the game-theoretic issues behind systems involving computation such as online networks, and (2) to learn how algorithms and algorithmic thinking can help with designing better decision and allocation mechanisms in the offline world.

Sample reading list:
D. Easley and J. Kleinberg, Networks, Crowds and Markets
Nisan et al. (eds.), Algorithmic Game Theory

Reading/Writing assignments:
Bi-weekly assignments involving problems and implementations; a take-home midterm test.

Requirements/Grading:
Mid Term Exam - 15%
Paper in lieu of Final - 40%
Class/Precept Participation - 5%
Problem set(s) - 40%

Prerequisites and Restrictions:
COS226, MAT 175 or MAT 202 or 204 or 217, or instructor's permission..

Schedule/Classroom assignment:

Class numberSectionTimeDaysRoomEnrollmentStatus
23028 L01 3:00 pm - 4:20 pm M W   Friend Center   101   Enrolled:93 Limit:150
23164 P01 7:30 pm - 8:20 pm W   Friend Center   112   Enrolled:40 Limit:52
23225 P01A 7:30 pm - 8:20 pm W   Friend Center   109   Enrolled:0 Limit:1
23204 P02 1:30 pm - 2:20 pm F   Friend Center   008   Enrolled:16 Limit:25
23205 P03 2:30 pm - 3:20 pm F   Friend Center   008   Enrolled:13 Limit:25
23302 P04 7:30 pm - 8:20 pm M   Bobst Hall   105   Enrolled:23 Limit:32
24196 P04A 7:30 pm - 8:20 pm M   Friend Center   112   Enrolled:1 Limit:1 Closed