Does there exist an algorithm that outputs a maximum weight transversal and has a stable matching?
up vote
0
down vote
favorite
If you have some bipartite graph with an adjacency matrix that represents the weights of the edges of that particular bipartite graph, then the Hungarian algorithm outputs a maximum weight transversal. However if you would apply this to a marriage problem, where you have a bipartite graph with an equal amount of men and women that need to be paired with each other for marriage where the weights would represent the combined 'happiness/utility' between the pair, then when applying the Hungarian algorithm it will give you a maximized sum of these weights, but this matching will not guarantee to be a stable matching. Now I have found that there exists an algorithm called the Gale-Shapely algorithm that always finds a stable matching when you have an equal number of vertices in both classes of a bipartite graph. But if I understood it correctly, a stable matching does not have to mean that the sum of the edge weights in the matching is maximized. Now my question becomes: Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching? Or is this still an open problem in graph theory to find such an algorithm?
Correct me if my explanation above about the Hungarian algorithm and Gale-Shapely algorithm is wrong, I am not a mathematics students.
graph-theory algorithms matching-theory
asked Nov 27 at 14:37
Kroko
113
|
show 9 more comments
up vote
0
down vote
favorite
If you have some bipartite graph with an adjacency matrix that represents the weights of the edges of that particular bipartite graph, then the Hungarian algorithm outputs a maximum weight transversal. However if you would apply this to a marriage problem, where you have a bipartite graph with an equal amount of men and women that need to be paired with each other for marriage where the weights would represent the combined 'happiness/utility' between the pair, then when applying the Hungarian algorithm it will give you a maximized sum of these weights, but this matching will not guarantee to be a stable matching. Now I have found that there exists an algorithm called the Gale-Shapely algorithm that always finds a stable matching when you have an equal number of vertices in both classes of a bipartite graph. But if I understood it correctly, a stable matching does not have to mean that the sum of the edge weights in the matching is maximized. Now my question becomes: Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching? Or is this still an open problem in graph theory to find such an algorithm?
Correct me if my explanation above about the Hungarian algorithm and Gale-Shapely algorithm is wrong, I am not a mathematics students.
graph-theory algorithms matching-theory
asked Nov 27 at 14:37
Kroko
113
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
1
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54
|
show 9 more comments
up vote
0
down vote
favorite
up vote
0
down vote
favorite
If you have some bipartite graph with an adjacency matrix that represents the weights of the edges of that particular bipartite graph, then the Hungarian algorithm outputs a maximum weight transversal. However if you would apply this to a marriage problem, where you have a bipartite graph with an equal amount of men and women that need to be paired with each other for marriage where the weights would represent the combined 'happiness/utility' between the pair, then when applying the Hungarian algorithm it will give you a maximized sum of these weights, but this matching will not guarantee to be a stable matching. Now I have found that there exists an algorithm called the Gale-Shapely algorithm that always finds a stable matching when you have an equal number of vertices in both classes of a bipartite graph. But if I understood it correctly, a stable matching does not have to mean that the sum of the edge weights in the matching is maximized. Now my question becomes: Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching? Or is this still an open problem in graph theory to find such an algorithm?
Correct me if my explanation above about the Hungarian algorithm and Gale-Shapely algorithm is wrong, I am not a mathematics students.
graph-theory algorithms matching-theory
asked Nov 27 at 14:37
Kroko
113
If you have some bipartite graph with an adjacency matrix that represents the weights of the edges of that particular bipartite graph, then the Hungarian algorithm outputs a maximum weight transversal. However if you would apply this to a marriage problem, where you have a bipartite graph with an equal amount of men and women that need to be paired with each other for marriage where the weights would represent the combined 'happiness/utility' between the pair, then when applying the Hungarian algorithm it will give you a maximized sum of these weights, but this matching will not guarantee to be a stable matching. Now I have found that there exists an algorithm called the Gale-Shapely algorithm that always finds a stable matching when you have an equal number of vertices in both classes of a bipartite graph. But if I understood it correctly, a stable matching does not have to mean that the sum of the edge weights in the matching is maximized. Now my question becomes: Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching? Or is this still an open problem in graph theory to find such an algorithm?
Correct me if my explanation above about the Hungarian algorithm and Gale-Shapely algorithm is wrong, I am not a mathematics students.
graph-theory algorithms matching-theory
graph-theory algorithms matching-theory
asked Nov 27 at 14:37
Kroko
113
asked Nov 27 at 14:37
Kroko
113
edited Nov 27 at 14:42
asked Nov 27 at 14:37
Kroko
113
asked Nov 27 at 14:37
Kroko
113
asked Nov 27 at 14:37
Kroko
113
113
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
1
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54
|
show 9 more comments
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
1
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
1
1
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54
|
show 9 more comments
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%2f3015847%2fdoes-there-exist-an-algorithm-that-outputs-a-maximum-weight-transversal-and-has%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3015847%2fdoes-there-exist-an-algorithm-that-outputs-a-maximum-weight-transversal-and-has%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
What do you mean by "Does there exist an algorithm that outputs a maximum weight transveral and has a stable matching?". In general, a maximum weighted matching need not be stable, so the two solutions are necessarily different. You have to pick which of the two best represents what you want
– Federico
Nov 27 at 14:46
Yes so indeed as I understood a maximum weighted matching need not be stable. So suppose I would apply the Hungarian algorithm on a marriage problem. Where there are 5 men and 5 woman to be paired with each other where the edges represent the happiness of a men i and a woman j being paired with each other. Then the algorithm would output me a matching such that the sum of these weights is maximized, but the marriages not to be stable. So my question is, is there an algorithm that gives me a matching such that the it gives me a maximum weighted matching and is also a stable matching?
– Kroko
Nov 27 at 14:50
1
Why do you think such a matching exists? Or are you asking for an algorithm that finds such a matching if one exists, and otherwise demonstrates that none exists?
– saulspatz
Nov 27 at 14:52
So it has two give you two different solutions in general. Well, just run the Hungarian algorithm and then the Gale-Shapley algorithm
– Federico
Nov 27 at 14:52
@salspatz I'm asking whether there exists an algorithm that finds me a matching M, such that M is a maximum weight matching and simultaneously stable.
– Kroko
Nov 27 at 14:54