Incentives and Information in Networks

Instructor: Yaron Singer
Time: M./W. 10-11:30 am
Room: Pierce Hall 100F
Email:yaron@seas.harvard.edu


Scribing: We'll be using this template to scribe lecture notes. Scribes are done in pairs and each student will be scribing once or twice during the semester. Some of the lectures will be presentations by students in the class, in which case the students presenting are also responsible to scribe their lecture. Please send your scribes to Bo (bwaggoner at fas dot harvard dot edu) two days after the lecture.



Wed., Sep. 4

  • Lecture notes 9.4.13

  • Mon., Sep. 9   

  • Lecture notes 9.9.13

  • Wed., Sep. 11

  • Lecture notes 9.11.13

  • Mon., Sep. 16

  • Lecture notes 9.16.13

  • Wed., Sep. 18

  • Lecture notes 9.18.13

  • Mon., Sep. 23

  • Lecture notes 9.23.13

  • Wed., Sep. 25

  • Lecture notes 9.25.13

  • Mon., Sep. 30

  • Lecture notes 9.30.13

  • Wed., Oct. 2

    Guest lecture by Wei Pan on the Red Balloon Challenge

    Mon., Oct. 7

  • Lecture notes 10.7.13

  • Wed., Oct. 9

  • Lecture notes 10.9.13

  • Mon., Oct. 14

    Columbus Day
    Wed., Oct. 16

  • Lecture notes 10.16.13

  • Mon., Oct. 21

  • Lecture notes 10.21.13

  • Wed., Oct. 23

  • Lecture notes 10.23.13

  • Mon., Oct. 28

    Guest lecture by Mickey Brautbar on nearly optimal-time algorithms for influence maximization

    Additional Material:
  • The structure and function of complex networks
    by Mark Newman
  • A brief history of generative models for power law and lognormal distributions
    by Michael Mitzenmacher







  • SEAS