Links

    CS 228. Computational Learning Theory (Spring 2014)

    Possibilities of and limitations to performing learning by computational agents. Topics include computational models, polynomial time learnability, learning from examples and learning from queries to oracles. Applications to Boolean functions, automata and geometric functions.

    CS 286r. Topics at the Interface between Computer Science and Economics (Matching and Market Design) (Spring 2014)

    Markets are the basic mechanism by which resources are allocated to agents. In recent years, computer scientists and economists have re-engineered markets with a particular eye towards efficiency (i.e., that the market optimizes the designer's objective) and stability (i.e., that the...

    Read more about CS 286r. Topics at the Interface between Computer Science and Economics (Matching and Market Design) (Spring 2014)