Course Websites

Subject offerings of new and developing areas of knowledge in industrial engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: Approved for Letter and S/U grading. May be repeated in the same or separate terms if topics vary.

Prerequisites: IE 310 or equivalent; basic knowledge of optimization, probability, and linear algebra; mathematical maturity. This course explores topics at the intersection of game theory, economics, and optimization, with a focus on real-world applications such as matching medical residents to hospitals, allocating students to schools, assigning seats in courses, kidney exchange, public housing allocation, online ad auctions, and task allocation. We will study foundational concepts in game theory, mechanism design, and market-based resource allocation, including Nash equilibrium, correlated equilibrium, bargaining, Shapley value, core stability, and competitive equilibrium. These models naturally give rise to a variety of optimization problems, including linear, convex, non-convex, and complementarity formulations. A central emphasis will be on the computational and optimization techniques used to model and solve these problems effectively and efficiently.