In certain situations, a matrix game can be reduced to a smaller ...

[jon_i]

In certain situations, a matrix game can be reduced to a smaller game by deleting certain rows and/or columns from the payoff matrix. The optimal strategy for the reduced game will then determine the optimal strategy for the original game.
 
  In what circumstances may a row or column be deleted from the payoff matrix?
  A) A row may be deleted if it is recessive to some other row and a column may be deleted if it is recessive to some other column.
  B) A row may be deleted if it is dominant to some other row and a column may be deleted if it is recessive to some other column.
  C) A row may be deleted if it is dominant to some other row and a column may be deleted if it is dominant to some other column.
  D) A row may be deleted if it is recessive to some other row and a column may be deleted if it is dominant to some other column.

Question 2

In a matrix game with payoff matrix A, how can you find the value (x) of a strategy x to row player R?
 
  A) (x) is the minimum of the inner product of x with each of the columns of A.
  B) (x) is the maximum of the inner product of x with each of the columns of A.
  C) (x) is the minimum of the inner product of x with each of the rows of A.
  D) (x) is the maximum of the inner product of x with each of the rows of A.

[firehawk60]

Answer to Question 1

D

Answer to Question 2

A

[jon_i]

TYSM

[carojassy25]

Thanks for the timely response, appreciate it