770: All the Girls - Revision history

162.158.130.52: duplicate "in" removed

2023-09-07T12:34:44Z

duplicate "in" removed

While False: /* Explanation */ attempt to avoid “shitty”

2022-12-08T22:29:50Z

‎Explanation: attempt to avoid “shitty”

SilverTheTerribleMathematician: /* Explanation */

2022-12-08T22:20:44Z

‎Explanation

Jacky720: rv

2022-05-04T21:10:49Z

Show changes

Ex Kay Cee Dee at 20:03, 4 May 2022

2022-05-04T20:03:07Z

Show changes

While False: Undo revision 240409 by Ex Kay Cee Dee (talk)

2022-05-04T18:16:19Z

Undo revision 240409 by Ex Kay Cee Dee (talk)

Show changes

Ex Kay Cee Dee at 17:17, 4 May 2022

2022-05-04T17:17:27Z

Show changes

108.162.221.13: /* Explanation */ A very tenuous relationship is not a reference

2016-01-28T17:09:42Z

‎Explanation: A very tenuous relationship is not a reference

108.162.221.13: /* Explanation */ deleting absurd supposition

2016-01-28T16:23:17Z

‎Explanation: deleting absurd supposition

199.27.128.75 at 22:29, 26 August 2015

2015-08-26T22:29:54Z

@@ Line 12: / Line 12: @@
 In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as unreliable and selfish as he initially appeared.
-This comic is related with {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get in used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.
+This comic is related with {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.
 In the comic [[Cueball]] and [[Megan]] could be a couple arranged through a stable marriage algorithm. In most cases that would mean that they both have potential partners that they would prefer over the one they're with, and the only reason that they aren't with that person is that their love was unrequited. That leaves both of them with a certain amount of emotional baggage that most people would consider detrimental to stable marriage. In short, while a stable marriage algorithm may provide good solutions to certain matching problems, it may not be the best way to produce actual stable marriages.

@@ Line 10: / Line 10: @@
 A young couple ([[Cueball]] and [[Megan]]) are in love. In the first panel, Cueball says he's lucky to have Megan, a perfectly fine thing to say to someone when you're in love.{{Citation needed}} In the second panel, Cueball tells Megan he loves her most out of all the girls in the world, which is again a perfectly fine thing to say when you're in love. Trouble sets in, however, in the third panel, where Cueball offers his qualifying statement, that he loves Megan the most of the subset of girls who also love Cueball back.
-In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as shitty as we all thought he was originally. The world can be a cruel place.
+In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as unreliable and selfish as he initially appeared.
 This comic is related with {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get in used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.

@@ Line 8: / Line 8: @@
 ==Explanation==
-A young couple ([[Cueball]] and [[Megan]]) are in love. In the first panel, Cueball says he's lucky to have Megan, a perfectly fine thing to say to someone when you're in love. In the second panel, Cueball tells Megan he loves her most out of all the girls in the world, which is again a perfectly fine thing to say when you're in love. Trouble sets in, however, in the third panel, where Cueball offers his qualifying statement, that he loves Megan the most of the subset of girls who also love Cueball back.
+A young couple ([[Cueball]] and [[Megan]]) are in love. In the first panel, Cueball says he's lucky to have Megan, a perfectly fine thing to say to someone when you're in love.{{Citation needed}} In the second panel, Cueball tells Megan he loves her most out of all the girls in the world, which is again a perfectly fine thing to say when you're in love. Trouble sets in, however, in the third panel, where Cueball offers his qualifying statement, that he loves Megan the most of the subset of girls who also love Cueball back.
 In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as shitty as we all thought he was originally. The world can be a cruel place.

@@ Line 12: / Line 12: @@
 In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as shitty as we all thought he was originally. The world can be a cruel place.
-It's also most likely a reference to the {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get in used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.
+This comic is related with {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get in used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.
-In the comic [[Cueball]] and [[Megan]] appear to be a couple arranged through a stable marriage algorithm. In most cases that would mean that they both have potential partners that they would prefer over the one they're with, and the only reason that they aren't with that person is that their love was unrequited. That leaves both of them with a certain amount of emotional baggage that most people would consider detrimental to stable marriage. In short, while a stable marriage algorithm may provide good solutions to certain matching problems, it may not be the best way to produce actual stable marriages.
+In the comic [[Cueball]] and [[Megan]] could be a couple arranged through a stable marriage algorithm. In most cases that would mean that they both have potential partners that they would prefer over the one they're with, and the only reason that they aren't with that person is that their love was unrequited. That leaves both of them with a certain amount of emotional baggage that most people would consider detrimental to stable marriage. In short, while a stable marriage algorithm may provide good solutions to certain matching problems, it may not be the best way to produce actual stable marriages.
 ==Transcript==

@@ Line 10: / Line 10: @@
 A young couple ([[Cueball]] and [[Megan]]) are in love. In the first panel, Cueball says he's lucky to have Megan, a perfectly fine thing to say to someone when you're in love. In the second panel, Cueball tells Megan he loves her most out of all the girls in the world, which is again a perfectly fine thing to say when you're in love. Trouble sets in, however, in the third panel, where Cueball offers his qualifying statement, that he loves Megan the most of the subset of girls who also love Cueball back.
-Now, on its surface it would appear that Cueball is making a hollow statement, in that the subset of girls who love him back must be smaller than the set of all the girls in the world, and we assume, because we are nerds, that that subset is probably only a few girls in size. To be optimistic, though, presume that Cueball, due to his smooth head and sentimental heart, is loved by nearly all the girls in the world, and so his sentiment is still very sweet{{Citation needed}}.
+In the title text, written in Cueball's voice, we have another compliment/qualifier pair. Cueball assures Megan that he'll never leave her—so long as some other girl is with someone. Cueball clearly has an unrequited love for another, and so really is being as shitty as we all thought he was originally. The world can be a cruel place.
 It's also most likely a reference to the {{w|stable marriage problem}}, which is usually stated as: Given ''n'' men and ''n'' women, can they all be married off in such a way that there is no possible "adulterous" pairing that both the man and woman would prefer over their current partner? It turns out the answer is yes, and there are even algorithms that can be used to find such a set of marriages. However, such algorithms don't usually give people their first choice, just their first choice among potential partners who prefer them to all the alternatives. The algorithms also favor either the men or the women, so one side will typically get closer to their ideal preferences than the other. Such algorithms do get in used in situations like assigning medical students to residencies (technically it's a polygamous generalization, but it's basically the same idea), in which case it's biased in favor of the medical students.