Document Type

Report

Publication Date

2022

Faculty Adviser

David Roberts

Abstract

The concept of a zero-sum game in Game Theory is widely studied in fields such as Mathematics and Economics in order to analyze situations and determine optimal courses of actions. Although a game or situation with fewer decisions can be solved by hand, we can turn to the Simplex Algorithm to efficiently solve larger games. This paper examines how the Simplex Algorithm can be implemented as a linear program in order to solve m x n zero-sum games.

Primo Type

Text Resource

Included in

Mathematics Commons

Share

COinS