Načítá se...
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...
Uloženo v:
| Vydáno v: | Stat Probab Lett |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2019
|
| Témata: | |
| On-line přístup: | 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 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|