Timeline for Fraction of the sets receive each color
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 24, 2017 at 6:35 | history | bounty ended | Karo | ||
| S Nov 24, 2017 at 6:35 | history | notice removed | Karo | ||
| Nov 24, 2017 at 6:35 | vote | accept | Karo | ||
| Nov 22, 2017 at 22:19 | answer | added | domotorp | timeline score: 4 | |
| Nov 22, 2017 at 10:19 | comment | added | domotorp | Are you familiar with the methods used e.g. in this paper? arxiv.org/abs/1704.02921 | |
| Nov 22, 2017 at 9:36 | comment | added | Karo | @domotorp Both of those cases are easy. For 2 the optimal d is 1/2. For $r_i\geq m_i$ it is 0 (e.g. n=1). | |
| Nov 22, 2017 at 8:02 | comment | added | domotorp | Why 3 colors, what happens for 2? Why $r_i\ge m_i-1$, what happens for $r_i\ge m_i$? | |
| Nov 21, 2017 at 21:37 | comment | added | fedja | Looks like you are quite desperate to get an answer: you asked the question just two days ago and already put a bounty on it :lol: Let people think a bit ;-). I'm betting on 1/3 with some stupid algorithm of the sort "keep three balls in the bank, award one to the color that cannot get rich from that (i.e. would not get a true maximum in $\ge k/3$ sets) and then take one ball from a rich color to fill the bank. If no such award is possible, distribute the bank in any way and you are done". Unfortunately, I cannot prove termination and am not even sure if no extra twists are needed. | |
| S Nov 21, 2017 at 14:08 | history | bounty started | Karo | ||
| S Nov 21, 2017 at 14:08 | history | notice added | Karo | Draw attention | |
| Nov 19, 2017 at 9:57 | history | asked | Karo | CC BY-SA 3.0 |