Timeline for answer to What's a replacement for "married couples" in combinatorics problems? by Misha Lavrov
Current License: CC BY-SA 3.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2021 at 10:34 | comment | added | Dan Fox | This answer is good. The original problem of pairing couples is somehow artificial anyway. The context of matching in employment or admissions is not as it's done widely in practice. | |
| Mar 6, 2018 at 14:41 | comment | added | Xander Henderson♦ | I'm okay with the fact that no one got my Spice Girls reference last week, but if they don't get Scrubs and House, we are all doomed! | |
| Mar 6, 2018 at 4:32 | comment | added | pjs36 | That’s great! I couldn’t think of a non-gendered version where each of the two groups have preferences for choosing members of the other group, as in the stable marriage problem. This fits the bill perfectly. | |
| Mar 6, 2018 at 0:09 | review | First posts | |||
| Mar 6, 2018 at 1:11 | |||||
| Mar 6, 2018 at 0:06 | history | answered | Misha Lavrov | CC BY-SA 3.0 |