Question

4. Consider the following matrix game \begin{equation} A = \begin{bmatrix} 1 & 0 & -1 \\ 0 & 0 & 0 \\ -1 & 0 & 1 \end{bmatrix} . \end{equation} a) Verify that A can not be reduced by using domination rules. b) Find the von Neumann value and the optimal strategies for both players by using the general method you have learned in the class: \begin{itemize} \item Write the initial game tableau (dual non-canonical). \item Find a MBFT by using just two pivot transformations---use the algorithm to find appropriate pivots. \item Apply SA to find the optimal solutions. \item Report the optimal strategies and the von Neumann value of the game. \end{itemize} c) Matrix A has a saddle point---find it. Can you directly report the von Neumann value and the optimal strategies for the game? Compare with (b).

          4. Consider the following matrix game
\begin{equation*}
A = \begin{bmatrix} 1 & 0 & -1 \\ 0 & 0 & 0 \\ -1 & 0 & 1 \end{bmatrix} .
\end{equation*}
a) Verify that A can not be reduced by using domination rules.
b) Find the von Neumann value and the optimal strategies for both players by using the
general method you have learned in the class:
\begin{itemize}
    \item Write the initial game tableau (dual non-canonical).
    \item Find a MBFT by using just two pivot transformations---use the algorithm to find
appropriate pivots.
    \item Apply SA to find the optimal solutions.
    \item Report the optimal strategies and the von Neumann value of the game.
\end{itemize}
c) Matrix A has a saddle point---find it. Can you directly report the von Neumann value
and the optimal strategies for the game? Compare with (b).

Show more…

4. Consider the following matrix game

A =
< b m a t r i x >
.

a) Verify that A can not be reduced by using domination rules.
b) Find the von Neumann value and the optimal strategies for both players by using the
general method you have learned in the class:

* Write the initial game tableau (dual non-canonical).

* Find a MBFT by using just two pivot transformations—use the algorithm to find
appropriate pivots.

* Apply SA to find the optimal solutions.

* Report the optimal strategies and the von Neumann value of the game.

c) Matrix A has a saddle point—find it. Can you directly report the von Neumann value
and the optimal strategies for the game? Compare with (b).

Added by Kevin D.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Sri K

08/24/2023

Step 1

To verify this, we need to check if any row or column can be dominated by another row or column. In this case, it can be seen that no row or column can be dominated by another, so the matrix A cannot be reduced using domination rules. Show more…

Show all steps

lock

Thanks for your feedback!

Consider the following matrix game A=[[1,0,-1],[0,0,0],[-1,0,1]]. a) Verify that A can not be reduced by using domination rules. b) Find the von Neumann value and the optimal strategies for both players by using the general method you have learned in the class: Write the initial game tableau (dual non-canonical). Find a MBFT by using just two pivot transformations - use the algorithm to find appropriate pivots. Apply SA to find the optimal solutions. Report the optimal strategies and the von Neumann value of the game. c) Matrix A has a saddle point- find it. Can you directly report the von Neumann value and the optimal strategies for the game? Compare with (b). 4. Consider the following matrix game A= a Verify that A can not be reduced by using domination rules b) Find the von Neumann value and the optimal strategies for both players by using the general method you have learned in the class: - Write the initial game tableau (dual non-canonical) -- Find a MBFT by using just two pivot transformations-use the algorithm to find appropriate pivots. - Apply SA to find the optimal solutions. -- Report the optimal strategies and the von Neumann value of the game. c) Matrix A has a saddle point-find it. Can you directly report the von Neumann value and the optimal strategies for the game? Compare with (b)

Play audio

Feedback

Powered by NumerAI

Sri K and 97 other subject Calculus 3 educators are ready to help you.

Ask a new question

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Recommended Videos

Recommended Textbooks

Transcript

00:01 So in the question we are given that f x comma y is equals to 1 divided by 4 x to the power 4 minus 1 divided by 3 y x cube minus 1 divided by 2 x square plus y x minus 1 divided by 3 y square plus 2 y.

00:18 So in a part of the question del f of x comma y will be equals to df divided by dx and df divided by dy.

00:30 So now we will find the df divided by dx.

00:32 So df divided by dx will be equals to x cube minus y x square minus x plus y and df divided by dy will be equals to minus 1 divided by 3 x cube plus x minus 2 divided by 3 y plus 2.

00:49 So therefore del f x comma y will be equals to x cube minus y x square minus x plus y and minus 1 divided by 3 x cube plus x minus 2 divided by 3 y plus 2.

01:05 So now we will again differentiate it.

01:07 So we will get that d square f divided by dx square will be equals to 3 x square minus 2 x y minus 1 and d square f divided by dy square will be equals to minus x square plus 1.

01:21 So therefore h x comma y will be equals to 3 x square minus 2 x y minus 1 minus x square plus 1 and minus x square plus 1 and minus 2 divided by 3.

01:37 This is the answer for part a.

01:38 Now in b part of the question for substituting points of f that is df divided by dx equals to 0 and df divided by dy equals to 0 we will get that x cube minus y x square minus x y equals to 0 minus x plus y equals to 0.

02:00 So we will get that x minus 1 into x plus 1 into x minus y equals to 0...

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later