Lataa...
Limit theorem for the Robin Hood game
In its simplest form, the Robin Hood game is described by the following urn scheme: every day the Sheriff of Nottingham puts s balls in an urn. Then Robin chooses r (r < s) balls to remove from the urn. Robin’s goal is to remove balls in such a way that none of them are left in the urn indefinite...
Tallennettuna:
| Julkaisussa: | Stat Probab Lett |
|---|---|
| Päätekijät: | , , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
2019
|
| Aiheet: | |
| Linkit: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6613391/ https://ncbi.nlm.nih.gov/pubmed/31285638 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.spl.2019.01.001 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|