Timeline for Scheduling "parent talks" at school
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 12, 2023 at 12:13 | vote | accept | Dominic van der Zypen | ||
| Jan 9, 2023 at 20:51 | history | edited | Robert Israel | CC BY-SA 4.0 |
added 486 characters in body
|
| Jan 9, 2023 at 14:35 | comment | added | Sam Hopkins | Are you suggesting that with $k=O(1)$ we will have a solution with high probability? That seems very implausible: see the comments of Random under the question... | |
| Jan 9, 2023 at 10:13 | comment | added | Dominic van der Zypen | I decided not to accept your answer yet - but of course I upvoted. I will accept your answer after a while, because the problem you mention and solve is related. I hope this is ok with you, Robert? | |
| Jan 9, 2023 at 10:10 | comment | added | Dominic van der Zypen | Thanks Robert for reformulating my question in a better way! I agree that in real life, the "convenient" slots to be selected will not be uniform - but I tried to simplify things a little. Even in the original setting (18 students, 4 "convenient" slots for every student), I had no intuition whether the probability of succeeding in making things convenient for everybody was much lower than $50\%$, much higher, or about equal. So, thanks for your simulations! | |
| Jan 9, 2023 at 6:08 | history | edited | Robert Israel | CC BY-SA 4.0 |
added 57 characters in body
|
| Jan 9, 2023 at 6:01 | history | edited | Robert Israel | CC BY-SA 4.0 |
added 211 characters in body
|
| Jan 9, 2023 at 5:39 | history | answered | Robert Israel | CC BY-SA 4.0 |