Two-person zero-sum games, solving matrix games by linear programming, two-person non-zero sum games, noncooperative n-person games, Nash equilibrium points and refinements, cooperative n-person games, core, Shapley value, and other concepts of solution. Applications to cost allocation, fair division, and voting power. Prerequisite: C or better in MATH 3330 or MATH 3319, or consent of the instructor.