Mixing
![Can't figure out what syntax error is stopping Firebase from receiving my real-time data [duplicate]](https://lh5.googleusercontent.com/-_ruut1Bi42A/AAAAAAAAAAI/AAAAAAAAAA4/v9YnhYE-Rxw/s72-c/photo.jpg?sz=32)
Is this simple demand-based prices game a submodular game?
$begingroup$
I have this simple market game:
$I={1,2...,n}$ players
$S_i$ strategy space of each player $iin I$
- $u_i(s_i,s_{-i})=R_i(s_i)-C(s_i,s_{-i})$
There's only one type of resource. The resource is limited.
$s_i$ indicates the portion of the entire resource being used by player $i$.
The utility of player $i$ is the difference between the reward coming from using $s_i$ and the cost of buying said amount, given that the price of the single unit of resource increases as the demand increases, in other words: the more resources are used, the more they are expensive.
I want to classify this game as a submodular game. For this purpose, consider the strategy spaces to be complete lattices and $u_i$ continuous $forall i in I$.
My understanding is that, in this case, if:
$u_i$ is submodular in own strategies for each player
$u_i$ verifies decreasing differences in the strategies of the other players
the game is submodular.
Since the utilities are functions of one variable fixed the other players strategies, they are always submodular. Supposing they are also of class $C^2$, then the decreasing difference property is true if the second order mixed partial derivatives are all non-positive. This is true by definition of the cost function, since an increase in the demand always leads to an increase of the price and since the cost function is multiplied by $-1$ in the utility definition.
The best response of player $i$ can be written as
$f_i=argmax_{s_i}{u_i(s_i,s_{-i})}$
which is a maximization of a submodular function. What puzzles me is that in literature (including Topkins 1979 which is the paper that first presents submodular games) all the important results of this class of games is presented and proofed in the case in which either the game is submodular and the best response is a minimization or the game is supermodular and the best response is a maximization.
It seems to me that my game is submodular with a maximization as best response.
I see no obstacles in applying the Tarski's fixed point theorem to prove that there exists at least one N.E., but I am not so confident since this is not my area of expertise at all. I was not able to find any proof of this specific case in literature.
Can you please help me in validating or refute what I wrote above?
Thanks for your interest
game-theory fixed-point-theorems lattice-orders
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
$endgroup$
add a comment |
$begingroup$
I have this simple market game:
$I={1,2...,n}$ players
$S_i$ strategy space of each player $iin I$
- $u_i(s_i,s_{-i})=R_i(s_i)-C(s_i,s_{-i})$
There's only one type of resource. The resource is limited.
$s_i$ indicates the portion of the entire resource being used by player $i$.
The utility of player $i$ is the difference between the reward coming from using $s_i$ and the cost of buying said amount, given that the price of the single unit of resource increases as the demand increases, in other words: the more resources are used, the more they are expensive.
I want to classify this game as a submodular game. For this purpose, consider the strategy spaces to be complete lattices and $u_i$ continuous $forall i in I$.
My understanding is that, in this case, if:
$u_i$ is submodular in own strategies for each player
$u_i$ verifies decreasing differences in the strategies of the other players
the game is submodular.
Since the utilities are functions of one variable fixed the other players strategies, they are always submodular. Supposing they are also of class $C^2$, then the decreasing difference property is true if the second order mixed partial derivatives are all non-positive. This is true by definition of the cost function, since an increase in the demand always leads to an increase of the price and since the cost function is multiplied by $-1$ in the utility definition.
The best response of player $i$ can be written as
$f_i=argmax_{s_i}{u_i(s_i,s_{-i})}$
which is a maximization of a submodular function. What puzzles me is that in literature (including Topkins 1979 which is the paper that first presents submodular games) all the important results of this class of games is presented and proofed in the case in which either the game is submodular and the best response is a minimization or the game is supermodular and the best response is a maximization.
It seems to me that my game is submodular with a maximization as best response.
I see no obstacles in applying the Tarski's fixed point theorem to prove that there exists at least one N.E., but I am not so confident since this is not my area of expertise at all. I was not able to find any proof of this specific case in literature.
Can you please help me in validating or refute what I wrote above?
Thanks for your interest
game-theory fixed-point-theorems lattice-orders
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
$endgroup$
add a comment |
$begingroup$
I have this simple market game:
$I={1,2...,n}$ players
$S_i$ strategy space of each player $iin I$
- $u_i(s_i,s_{-i})=R_i(s_i)-C(s_i,s_{-i})$
There's only one type of resource. The resource is limited.
$s_i$ indicates the portion of the entire resource being used by player $i$.
The utility of player $i$ is the difference between the reward coming from using $s_i$ and the cost of buying said amount, given that the price of the single unit of resource increases as the demand increases, in other words: the more resources are used, the more they are expensive.
I want to classify this game as a submodular game. For this purpose, consider the strategy spaces to be complete lattices and $u_i$ continuous $forall i in I$.
My understanding is that, in this case, if:
$u_i$ is submodular in own strategies for each player
$u_i$ verifies decreasing differences in the strategies of the other players
the game is submodular.
Since the utilities are functions of one variable fixed the other players strategies, they are always submodular. Supposing they are also of class $C^2$, then the decreasing difference property is true if the second order mixed partial derivatives are all non-positive. This is true by definition of the cost function, since an increase in the demand always leads to an increase of the price and since the cost function is multiplied by $-1$ in the utility definition.
The best response of player $i$ can be written as
$f_i=argmax_{s_i}{u_i(s_i,s_{-i})}$
which is a maximization of a submodular function. What puzzles me is that in literature (including Topkins 1979 which is the paper that first presents submodular games) all the important results of this class of games is presented and proofed in the case in which either the game is submodular and the best response is a minimization or the game is supermodular and the best response is a maximization.
It seems to me that my game is submodular with a maximization as best response.
I see no obstacles in applying the Tarski's fixed point theorem to prove that there exists at least one N.E., but I am not so confident since this is not my area of expertise at all. I was not able to find any proof of this specific case in literature.
Can you please help me in validating or refute what I wrote above?
Thanks for your interest
game-theory fixed-point-theorems lattice-orders
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
$endgroup$
I have this simple market game:
$I={1,2...,n}$ players
$S_i$ strategy space of each player $iin I$
- $u_i(s_i,s_{-i})=R_i(s_i)-C(s_i,s_{-i})$
There's only one type of resource. The resource is limited.
$s_i$ indicates the portion of the entire resource being used by player $i$.
The utility of player $i$ is the difference between the reward coming from using $s_i$ and the cost of buying said amount, given that the price of the single unit of resource increases as the demand increases, in other words: the more resources are used, the more they are expensive.
I want to classify this game as a submodular game. For this purpose, consider the strategy spaces to be complete lattices and $u_i$ continuous $forall i in I$.
My understanding is that, in this case, if:
$u_i$ is submodular in own strategies for each player
$u_i$ verifies decreasing differences in the strategies of the other players
the game is submodular.
Since the utilities are functions of one variable fixed the other players strategies, they are always submodular. Supposing they are also of class $C^2$, then the decreasing difference property is true if the second order mixed partial derivatives are all non-positive. This is true by definition of the cost function, since an increase in the demand always leads to an increase of the price and since the cost function is multiplied by $-1$ in the utility definition.
The best response of player $i$ can be written as
$f_i=argmax_{s_i}{u_i(s_i,s_{-i})}$
which is a maximization of a submodular function. What puzzles me is that in literature (including Topkins 1979 which is the paper that first presents submodular games) all the important results of this class of games is presented and proofed in the case in which either the game is submodular and the best response is a minimization or the game is supermodular and the best response is a maximization.
It seems to me that my game is submodular with a maximization as best response.
I see no obstacles in applying the Tarski's fixed point theorem to prove that there exists at least one N.E., but I am not so confident since this is not my area of expertise at all. I was not able to find any proof of this specific case in literature.
Can you please help me in validating or refute what I wrote above?
Thanks for your interest
game-theory fixed-point-theorems lattice-orders
game-theory fixed-point-theorems lattice-orders
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
asked Jan 22 at 16:26
Eugenio MoroEugenio Moro
61
61
add a comment |
add a comment |
0
active
oldest
votes
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%2f3083366%2fis-this-simple-demand-based-prices-game-a-submodular-game%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3083366%2fis-this-simple-demand-based-prices-game-a-submodular-game%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
