Matrix-game optimization problem

The row player solves

max_{p, v} v subject to A^{T} p \geq v e, q u a d e^{T} p = 1, q u a d p \geq 0.

 Ancestors (7)

 Incoming links (1)

Past exam of the mathematics course of the University of Cambridge / 2023 / ib / Paper 4 / 18H / Solution

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version