2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

21 - 30 of 108 results for: all courses

CS 161: Design and Analysis of Algorithms

Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching. Prerequisite: 103 or 103B; 109 or STATS 116.
Terms: Aut, Win, Spr, Sum | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci, WAY-FR

ECON 50: Economic Analysis I

Individual consumer and firm behavior under perfect competition. The role of markets and prices in a decentralized economy. Monopoly in partial equilibrium. Economic tools developed from multivariable calculus using partial differentiation and techniques for constrained and unconstrained optimization. Prerequisites taken for letter grades: Econ 1 or 1A or 1V, and Math 51 or CME 100 or CME 100A. Must be taken for a Letter grade if majoring/minoring in Economics.
Terms: Aut, Win, Sum | Units: 5 | UG Reqs: GER:DB-Math, WAY-FR, WAY-SI

ECON 51: Economic Analysis II

Neoclassical analysis of general equilibrium, welfare economics, imperfect competition, externalities and public goods, risk and uncertainty, game theory, adverse selection, and moral hazard. Multivariate calculus is used. Prerequisite: ECON 50.
Terms: Win, Spr, Sum | Units: 5 | UG Reqs: WAY-FR, WAY-SI

ECON 136: Market Design

Use of economic theory and analysis to design allocation mechanisms and market institutions. Course focuses on three areas: the design of matching algorithms to solve assignment problems, with applications to school choice, entry-level labor markets, and kidney exchanges; the design of auctions to solve general resource allocation problems, with applications to the sale of natural resources, financial assets, and advertising; and the design of platforms and exchanges, with applications to internet markets. Emphasis on connecting economic theory to practical applications. Students must write term paper. Prerequisites: recommended: ECON 51.
Terms: Win | Units: 5 | UG Reqs: WAY-FR

ECON 137: Decision Modeling and Information

Effective decision models consider a decision maker's alternatives, information and preferences. The construction of such models in single-party situations with emphasis on the role of information. The course then evolves to two-party decision situations where one party has more information than the other. Models examined include: bidding exercises and the winner's curse, the Akerlof Model and adverse selection, the Principal-Agent model and risk sharing, moral hazard and contract design. Prerequisite: ECON 102A or equivalent. Recommended: Econ 50, Optimization and simulation in Excel.
Terms: Aut | Units: 5 | UG Reqs: WAY-AQR, WAY-FR

ECON 160: Game Theory and Economic Applications

Introduction to game theory and its applications to economics. Topics: strategic and extensive form games, dominant strategies, Nash equilibrium, subgame-perfect equilibrium, and Bayesian equilibrium. The theory is applied to repeated games, voting, auctions, and bargaining with examples from economics and political science. Prerequisites: Working knowledge of calculus and basic probability theory.
Terms: Win | Units: 5 | UG Reqs: WAY-FR, WAY-SI

ECON 180: Honors Game Theory

Rigorous introduction to game theory and applications. Topics include solution concepts for static and dynamic games of complete and incomplete information, signaling games, repeated games, bargaining, and elements of cooperative game theory. Applications mainly from economics, but also political science, biology, and computer science. Prerequisites: Experience with abstract mathematics and willingness to work hard. No background in economics required.
Terms: Spr | Units: 5 | UG Reqs: WAY-SI, WAY-FR, GER:DB-SocSci

ECON 182: Honors Market Design

Rigorous introduction to the theory of matching and resource allocation, and its application to practical market design. Theory covers two-sided matching, "house allocation" problems, random assignment, and their variants. Applied topics include school choice, labor market, house allocation, and organ allocation for transplantation. Final paper required.nForms a sequence with ECON 180 and ECON 181, but can be taken independently.nPrerequisites: Experience with abstract mathematics and willingness tonwork hard. No prior knowledge of economics is required, although basic knowledge in game theory is useful.
Terms: Aut | Units: 5 | UG Reqs: WAY-FR
Instructors: Kojima, F. (PI)

EE 41: Physics of Electrical Engineering (ENGR 40P)

How everything from electrostatics to quantum mechanics is used in common high-technology products. Electrostatics are critical in micro-mechanical systems used in many sensors and displays, and Electromagnetic waves are essential in all high-speed communication systems. How to propagate energy on transmission lines, optical fibers,and in free space. Which aspects of modern physics are needed to generate light for the operation of a DVD player or TV. Introduction to semiconductors, solid-state light bulbs, and laser pointers. Hands-on labs to connect physics to everyday experience. Prerequisites: Physics 43
Last offered: Winter 2014 | UG Reqs: GER:DB-EngrAppSci, WAY-FR, WAY-SMA

EE 102A: Signal Processing and Linear Systems I

Concepts and tools for continuous- and discrete-time signal and system analysis with applications in signal processing, communications, and control. Mathematical representation of signals and systems. Linearity and time invariance. System impulse and step responses. System frequency response. Frequency-domain representations: Fourier series and Fourier transforms. Filtering and signal distortion. Time/frequency sampling and interpolation. Continuous-discrete-time signal conversion and quantization. Discrete-time signal processing. Prerequisite: MATH 53 or CME 102.
Terms: Win, Sum | Units: 4 | UG Reqs: GER:DB-EngrAppSci, WAY-AQR, WAY-FR
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints