Finding values such that the game is strictly determinable
$begingroup$
Please help me to solve these two problems.
Q1)Find the range of values of p and q that will make the entry (2,2) a saddle point of the game.
$$
begin{pmatrix}
&player B\
2 & 4 & 5 \
10 & 7 & q \
4 & p & 6 \
end{pmatrix}
$$
Q2)For what values of p, the game with following payoff matrix is strictly determinable?
$$
begin{pmatrix}
&player B\
p & 6 & 2 \
-1 & p & -7 \
-2 & 4 & p \
end{pmatrix}
$$
Please help me to understand how to think when solving this kind of problems.I got the correct answers but that was with a lot of guess and check and it takes a lot of time and I am not sure of the answers.
game-theory
$endgroup$
add a comment |
$begingroup$
Please help me to solve these two problems.
Q1)Find the range of values of p and q that will make the entry (2,2) a saddle point of the game.
$$
begin{pmatrix}
&player B\
2 & 4 & 5 \
10 & 7 & q \
4 & p & 6 \
end{pmatrix}
$$
Q2)For what values of p, the game with following payoff matrix is strictly determinable?
$$
begin{pmatrix}
&player B\
p & 6 & 2 \
-1 & p & -7 \
-2 & 4 & p \
end{pmatrix}
$$
Please help me to understand how to think when solving this kind of problems.I got the correct answers but that was with a lot of guess and check and it takes a lot of time and I am not sure of the answers.
game-theory
$endgroup$
add a comment |
$begingroup$
Please help me to solve these two problems.
Q1)Find the range of values of p and q that will make the entry (2,2) a saddle point of the game.
$$
begin{pmatrix}
&player B\
2 & 4 & 5 \
10 & 7 & q \
4 & p & 6 \
end{pmatrix}
$$
Q2)For what values of p, the game with following payoff matrix is strictly determinable?
$$
begin{pmatrix}
&player B\
p & 6 & 2 \
-1 & p & -7 \
-2 & 4 & p \
end{pmatrix}
$$
Please help me to understand how to think when solving this kind of problems.I got the correct answers but that was with a lot of guess and check and it takes a lot of time and I am not sure of the answers.
game-theory
$endgroup$
Please help me to solve these two problems.
Q1)Find the range of values of p and q that will make the entry (2,2) a saddle point of the game.
$$
begin{pmatrix}
&player B\
2 & 4 & 5 \
10 & 7 & q \
4 & p & 6 \
end{pmatrix}
$$
Q2)For what values of p, the game with following payoff matrix is strictly determinable?
$$
begin{pmatrix}
&player B\
p & 6 & 2 \
-1 & p & -7 \
-2 & 4 & p \
end{pmatrix}
$$
Please help me to understand how to think when solving this kind of problems.I got the correct answers but that was with a lot of guess and check and it takes a lot of time and I am not sure of the answers.
game-theory
game-theory
asked Dec 24 '13 at 6:55
clarksonclarkson
86611533
86611533
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Q1)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp I read that
" A saddle point is a payoff that is simultaneously a row minimum and a column maximum."
So you must ask yourself under which conditions on $p$ and $q$ this is satisfied. Is it clear to you how to do so?
Q2)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp again, I read
"A game is strictly determined if it has at least one saddle point."
So from the former definition this is equivalent to the payoff matrix having an entry which is a minimum of its row and a maximum of its column. A systematic way to tackle this problem would be as follows:
- Consider entry $(1,1)$. Under which values of $p$ can entry $(1,1)$ be a saddle point? Define the set of such values as $P_{(1,1)}$ ( if it is an interval of values, you may denote it $(underline{p}^{(1,1)},bar{p}^{(1,1)})$ for instance).
- Consider entry $(1,2)$. Under which values of $p$ can entry $(1,2)$ be a saddle point? Define the set of such values as $P_{(1,2)}$.
- ...
Then the set of values of $p$ such that the game is strictly determinable is $P_{(1,1)}cup P_{(1,2)}cup dots cup P_{(3,2)} cup P_{(3,3)}$ or shortly $bigcup_{i=1}^3 bigcup_{j=1}^3 P_{(i,j)}$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f617130%2ffinding-values-such-that-the-game-is-strictly-determinable%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Q1)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp I read that
" A saddle point is a payoff that is simultaneously a row minimum and a column maximum."
So you must ask yourself under which conditions on $p$ and $q$ this is satisfied. Is it clear to you how to do so?
Q2)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp again, I read
"A game is strictly determined if it has at least one saddle point."
So from the former definition this is equivalent to the payoff matrix having an entry which is a minimum of its row and a maximum of its column. A systematic way to tackle this problem would be as follows:
- Consider entry $(1,1)$. Under which values of $p$ can entry $(1,1)$ be a saddle point? Define the set of such values as $P_{(1,1)}$ ( if it is an interval of values, you may denote it $(underline{p}^{(1,1)},bar{p}^{(1,1)})$ for instance).
- Consider entry $(1,2)$. Under which values of $p$ can entry $(1,2)$ be a saddle point? Define the set of such values as $P_{(1,2)}$.
- ...
Then the set of values of $p$ such that the game is strictly determinable is $P_{(1,1)}cup P_{(1,2)}cup dots cup P_{(3,2)} cup P_{(3,3)}$ or shortly $bigcup_{i=1}^3 bigcup_{j=1}^3 P_{(i,j)}$.
$endgroup$
add a comment |
$begingroup$
Q1)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp I read that
" A saddle point is a payoff that is simultaneously a row minimum and a column maximum."
So you must ask yourself under which conditions on $p$ and $q$ this is satisfied. Is it clear to you how to do so?
Q2)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp again, I read
"A game is strictly determined if it has at least one saddle point."
So from the former definition this is equivalent to the payoff matrix having an entry which is a minimum of its row and a maximum of its column. A systematic way to tackle this problem would be as follows:
- Consider entry $(1,1)$. Under which values of $p$ can entry $(1,1)$ be a saddle point? Define the set of such values as $P_{(1,1)}$ ( if it is an interval of values, you may denote it $(underline{p}^{(1,1)},bar{p}^{(1,1)})$ for instance).
- Consider entry $(1,2)$. Under which values of $p$ can entry $(1,2)$ be a saddle point? Define the set of such values as $P_{(1,2)}$.
- ...
Then the set of values of $p$ such that the game is strictly determinable is $P_{(1,1)}cup P_{(1,2)}cup dots cup P_{(3,2)} cup P_{(3,3)}$ or shortly $bigcup_{i=1}^3 bigcup_{j=1}^3 P_{(i,j)}$.
$endgroup$
add a comment |
$begingroup$
Q1)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp I read that
" A saddle point is a payoff that is simultaneously a row minimum and a column maximum."
So you must ask yourself under which conditions on $p$ and $q$ this is satisfied. Is it clear to you how to do so?
Q2)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp again, I read
"A game is strictly determined if it has at least one saddle point."
So from the former definition this is equivalent to the payoff matrix having an entry which is a minimum of its row and a maximum of its column. A systematic way to tackle this problem would be as follows:
- Consider entry $(1,1)$. Under which values of $p$ can entry $(1,1)$ be a saddle point? Define the set of such values as $P_{(1,1)}$ ( if it is an interval of values, you may denote it $(underline{p}^{(1,1)},bar{p}^{(1,1)})$ for instance).
- Consider entry $(1,2)$. Under which values of $p$ can entry $(1,2)$ be a saddle point? Define the set of such values as $P_{(1,2)}$.
- ...
Then the set of values of $p$ such that the game is strictly determinable is $P_{(1,1)}cup P_{(1,2)}cup dots cup P_{(3,2)} cup P_{(3,3)}$ or shortly $bigcup_{i=1}^3 bigcup_{j=1}^3 P_{(i,j)}$.
$endgroup$
Q1)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp I read that
" A saddle point is a payoff that is simultaneously a row minimum and a column maximum."
So you must ask yourself under which conditions on $p$ and $q$ this is satisfied. Is it clear to you how to do so?
Q2)
On http://www.zweigmedia.com/RealWorld/Summary3b.html#sp again, I read
"A game is strictly determined if it has at least one saddle point."
So from the former definition this is equivalent to the payoff matrix having an entry which is a minimum of its row and a maximum of its column. A systematic way to tackle this problem would be as follows:
- Consider entry $(1,1)$. Under which values of $p$ can entry $(1,1)$ be a saddle point? Define the set of such values as $P_{(1,1)}$ ( if it is an interval of values, you may denote it $(underline{p}^{(1,1)},bar{p}^{(1,1)})$ for instance).
- Consider entry $(1,2)$. Under which values of $p$ can entry $(1,2)$ be a saddle point? Define the set of such values as $P_{(1,2)}$.
- ...
Then the set of values of $p$ such that the game is strictly determinable is $P_{(1,1)}cup P_{(1,2)}cup dots cup P_{(3,2)} cup P_{(3,3)}$ or shortly $bigcup_{i=1}^3 bigcup_{j=1}^3 P_{(i,j)}$.
answered Dec 24 '13 at 11:14
Martin Van der LindenMartin Van der Linden
1,62311027
1,62311027
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f617130%2ffinding-values-such-that-the-game-is-strictly-determinable%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown