MAT 347 Game Theory and Linear Programming

An introduction to the mathematical theory of games of strategy. Matrix games. Optimal strategies for zero-sum two-person games. Convex sets in Euclidean n-space, systems of linear inequalities, linear programming, and the simplex method. Nperson games and non-zero-sum games. 

Credits:

3

Hours

3

Requirement Designation

Regular Liberal Arts

Offered

Fall-Spring

Prerequisite

One course in linear algebra.