Prerequisites: MATH 010A with a grade of “C-” or better
Description: Examines games in extensive, normal, and characteristic form as models of conflict and/or cooperation. Covers two-person zero- sum games, minimax theorem, and relation to linear programming. Includes non-zero-sum games, Nash equilibrium theorem, bargaining, the core, and the Shapley value. Addresses economic market games.