Qualified majorities consensus algorithms and Block chain algorithms
$begingroup$
I have a question below. Could you please help me to find the answers or reference of document about it?
Let $A = f(a_1 ;... ; a_n)$ be a set and suppose that $t$ elements of $A$ are colored red; the remaining ones are blue. Every set of $[(n+t+1)/2]$ or more elements from A is called a qualified majority.
a) Every two qualified majorities have one blue element in common. Explain why.
b) Describe further properties of set systems with qualified majorities.
c) Generalize the model from elements that are all equal by adding a weight to each element. Describe weighted qualified majorities and state some of their properties.
I appreciate for your helps. thanks keyvan
computational-mathematics
$endgroup$
add a comment |
$begingroup$
I have a question below. Could you please help me to find the answers or reference of document about it?
Let $A = f(a_1 ;... ; a_n)$ be a set and suppose that $t$ elements of $A$ are colored red; the remaining ones are blue. Every set of $[(n+t+1)/2]$ or more elements from A is called a qualified majority.
a) Every two qualified majorities have one blue element in common. Explain why.
b) Describe further properties of set systems with qualified majorities.
c) Generalize the model from elements that are all equal by adding a weight to each element. Describe weighted qualified majorities and state some of their properties.
I appreciate for your helps. thanks keyvan
computational-mathematics
$endgroup$
add a comment |
$begingroup$
I have a question below. Could you please help me to find the answers or reference of document about it?
Let $A = f(a_1 ;... ; a_n)$ be a set and suppose that $t$ elements of $A$ are colored red; the remaining ones are blue. Every set of $[(n+t+1)/2]$ or more elements from A is called a qualified majority.
a) Every two qualified majorities have one blue element in common. Explain why.
b) Describe further properties of set systems with qualified majorities.
c) Generalize the model from elements that are all equal by adding a weight to each element. Describe weighted qualified majorities and state some of their properties.
I appreciate for your helps. thanks keyvan
computational-mathematics
$endgroup$
I have a question below. Could you please help me to find the answers or reference of document about it?
Let $A = f(a_1 ;... ; a_n)$ be a set and suppose that $t$ elements of $A$ are colored red; the remaining ones are blue. Every set of $[(n+t+1)/2]$ or more elements from A is called a qualified majority.
a) Every two qualified majorities have one blue element in common. Explain why.
b) Describe further properties of set systems with qualified majorities.
c) Generalize the model from elements that are all equal by adding a weight to each element. Describe weighted qualified majorities and state some of their properties.
I appreciate for your helps. thanks keyvan
computational-mathematics
computational-mathematics
edited Jan 21 at 11:15


Henrik
6,03592030
6,03592030
asked Jan 21 at 10:49
keyvankeyvan
12
12
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%2f3081731%2fqualified-majorities-consensus-algorithms-and-block-chain-algorithms%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%2f3081731%2fqualified-majorities-consensus-algorithms-and-block-chain-algorithms%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