EECS 395: Algorithmic Research for E-Commerce

Department of Electrical Engineering and Computer Science
Northwestern University

Winter 2007

4:00--5:15 MWF
(twice weekly)

Tech MG28

Class URL: www.cs.northwestern.edu/~kao/eecs395-ecommerce

Copyright (c) 2002--2007, Ming-Yang Kao
(last updated 1/25/2007)

Synopsis:

The intellectual goal of this course is to study the interplay between computer science and economics. This interplay gives rise to two complementary directions of basic research. One is to use computer science tools to solve economics problems; the other is to use economics ideas to solve computer science problems. E-commerce algorithms provide a concrete context, although not the only one, in which we can pursue these directions. Specific topics of this course will change as our understanding of this interplay expands; they will center around e-commerce but will not be limited to it. The educational goal of this course is to help students learn how to formulate and approach research problems through novel combinations of classical computer science and economics ideas, in hopes that such interactions of ideas will some day result in fundamental advances in both disciplines.

Instructor:

Ming-Yang Kao
Office: Tech M324
Phone: 847-230-9867
Email: kao@cs.northwestern.edu
URL: http://www.cs.northwestern.edu/~kao
Office Hours: 3:00-4:00 MWF or by appointment.

Prerequisites:

CS 336 Design and Analysis of Algorithms.

Course Work and Grading Policy:

  • There will be no midterm or final examination. The course grade will be based on a project (50%) and classroom presentations (50%).
  • Project: The project may be any meaningful combination of implementation of algorithms, in-depth survey, and original research.
  • Presentations: The instructor will give the first 8 lectures (1/5--1/29). Afterwards, the students will take turns to give lectures and lead discussions with the help of the instructor.

Textbooks and Course Materials:

Tentative Topics and Schedule:

The following topics and the reading lists for them will be updated as the seminar progresses and will depend on the participants' interests.
  1. Algorithmic Mechanism Design
  2. Computational Complexity of Equilibriums
  3. Applications of Economics to Computer Science
  4. Others

The following schedule will be updated as needed:

1/03
Wednesday
  • organizational meeting
1/05
Friday
  • algorithmic mechanism design (Kao)
1/08
Monday
  • no class (away for conference)
1/10
Wednesday
  • algorithmic mechanism design (Kao)
1/12
Friday
  • algorithmic mechanism design (Kao)
1/15
Monday
  • no class (university policy for Martin Luther King Jr. Day)
1/17
Wednesday
  • algorithmic mechanism design (Kao)
1/19
Friday
  • computational complexity of equilibriums (Kao)
1/22
Monday
  • computational complexity of equilibriums (Kao)
1/24
Wednesday
  • computational complexity of equilibriums (Kao)
1/26
Friday
  • no class
1/29
Monday
  • computational complexity of equilibriums (Kao)
1/31
Wednesday
  • computational complexity of equilibriums (Kao)
2/02
Friday
  • no class
2/05
Monday
  • TCP and game theory (Amit Mondal)
2/07
Wednesday
  • TCP and game theory (Amit Mondal)
2/09
Friday
  • no class
2/12
Monday
  • routing and game theory (Ao-Jan Su)
2/14
Wednesday
  • routing and game theory (Ao-Jan Su)
2/16
Friday
  • make-up class for 2/21, combinatorial auction (Tae-Hyuk Ahn)
2/19
Monday
  • combinatorial auction (Tae-Hyuk Ahn)
2/21
Wednesday
  • no class (away for conference)
2/23
Friday
  • no class
2/26
Monday
  • combinatorial auction (Tae-Hyuk Ahn)
2/28
Wednesday
  • no class
3/02
Friday
  • epsilon-Nash equilibriums (Michael Shalak)
3/05
Monday
  • modeling selfish routing (Karl Deng)
3/07
Wednesday
  • modeling selfish routing (Karl Deng)
3/09
Friday
  • no class
3/12
Monday
  • no class (final exam period)
3/14
Wednesday
  • no class (final exam period)
3/16
Friday
  • no class (final exam period)
  • the final project due via email by midnight