Sequential urn-ball problem: N people, n balls/person, M urns
$begingroup$
Consider $N$ people, each randomly placing $n sim Poisson(lambda)$ balls into $M$ urns (assume no person places multiple balls in the same urn). Urns are then randomly assigned an order in which they will be able to choose one ball. Assume that when an urn's turn arrives, it chooses a ball randomly. When an urn chooses a ball, a match is formed, and the owner of that ball removes all remaining balls from other urns.
I am interested in computing three probabilities:
1) The probability that a person who places exactly $n$ balls in urns forms a match with an urn.
2) The (ex ante) probability that a person forms a match. [That is, the probability that one of their balls is selected by a firm, given that people submit a stochastic number of balls, $n sim Poisson(lambda)$, for some fixed $lambda$.]
3) The (ex ante) probability that an urn forms a match. [That is, the probability of having at least one ball remaining when its turn to pick arrives, given $lambda$.]
probability sequences-and-series combinatorics
$endgroup$
add a comment |
$begingroup$
Consider $N$ people, each randomly placing $n sim Poisson(lambda)$ balls into $M$ urns (assume no person places multiple balls in the same urn). Urns are then randomly assigned an order in which they will be able to choose one ball. Assume that when an urn's turn arrives, it chooses a ball randomly. When an urn chooses a ball, a match is formed, and the owner of that ball removes all remaining balls from other urns.
I am interested in computing three probabilities:
1) The probability that a person who places exactly $n$ balls in urns forms a match with an urn.
2) The (ex ante) probability that a person forms a match. [That is, the probability that one of their balls is selected by a firm, given that people submit a stochastic number of balls, $n sim Poisson(lambda)$, for some fixed $lambda$.]
3) The (ex ante) probability that an urn forms a match. [That is, the probability of having at least one ball remaining when its turn to pick arrives, given $lambda$.]
probability sequences-and-series combinatorics
$endgroup$
add a comment |
$begingroup$
Consider $N$ people, each randomly placing $n sim Poisson(lambda)$ balls into $M$ urns (assume no person places multiple balls in the same urn). Urns are then randomly assigned an order in which they will be able to choose one ball. Assume that when an urn's turn arrives, it chooses a ball randomly. When an urn chooses a ball, a match is formed, and the owner of that ball removes all remaining balls from other urns.
I am interested in computing three probabilities:
1) The probability that a person who places exactly $n$ balls in urns forms a match with an urn.
2) The (ex ante) probability that a person forms a match. [That is, the probability that one of their balls is selected by a firm, given that people submit a stochastic number of balls, $n sim Poisson(lambda)$, for some fixed $lambda$.]
3) The (ex ante) probability that an urn forms a match. [That is, the probability of having at least one ball remaining when its turn to pick arrives, given $lambda$.]
probability sequences-and-series combinatorics
$endgroup$
Consider $N$ people, each randomly placing $n sim Poisson(lambda)$ balls into $M$ urns (assume no person places multiple balls in the same urn). Urns are then randomly assigned an order in which they will be able to choose one ball. Assume that when an urn's turn arrives, it chooses a ball randomly. When an urn chooses a ball, a match is formed, and the owner of that ball removes all remaining balls from other urns.
I am interested in computing three probabilities:
1) The probability that a person who places exactly $n$ balls in urns forms a match with an urn.
2) The (ex ante) probability that a person forms a match. [That is, the probability that one of their balls is selected by a firm, given that people submit a stochastic number of balls, $n sim Poisson(lambda)$, for some fixed $lambda$.]
3) The (ex ante) probability that an urn forms a match. [That is, the probability of having at least one ball remaining when its turn to pick arrives, given $lambda$.]
probability sequences-and-series combinatorics
probability sequences-and-series combinatorics
asked Jan 28 at 2:14
JohnJohn
255
255
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%2f3090361%2fsequential-urn-ball-problem-n-people-n-balls-person-m-urns%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%2f3090361%2fsequential-urn-ball-problem-n-people-n-balls-person-m-urns%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
