Timeline for How to choose $L$ size-$m$ subsets of $\{1,\ldots,n\}$ to maximize expected max overlap with another randomly chosen subset?
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2011 at 3:50 | history | edited | Jay Howard | CC BY-SA 2.5 |
simplified (& furthered) analysis of 1 special case
|
| Jan 8, 2011 at 3:40 | history | edited | Jay Howard | CC BY-SA 2.5 |
fixed typos
|
| Jan 26, 2010 at 9:33 | history | edited | Jay Howard | CC BY-SA 2.5 |
added special cases
|
| Jan 26, 2010 at 8:53 | answer | added | Douglas Zare | timeline score: 5 | |
| Jan 26, 2010 at 8:13 | history | edited | Jay Howard | CC BY-SA 2.5 |
fixed typo
|
| Jan 26, 2010 at 8:08 | comment | added | Jay Howard | While it would be great it someone knew the answer, realistically I was hoping at least for some insight/suggestions in how to proceed and/or related results/concepts. I have played with some special cases; I could add the details to the original post, but, as I'm new, I wasn't sure if that was appropriate. (I assume they don't belong in comments, if only because of the character limit.) | |
| Jan 26, 2010 at 8:06 | history | edited | Jay Howard | CC BY-SA 2.5 |
fixed typo
|
| Jan 26, 2010 at 7:09 | comment | added | Yemon Choi | Presumably you have tried some special cases? or are you just hoping some here will just know the answer? | |
| Jan 26, 2010 at 6:44 | history | asked | Jay Howard | CC BY-SA 2.5 |