Loading...
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...
Na minha lista:
| Udgivet i: | Stat Probab Lett |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2019
|
| Fag: | |
| Online adgang: | 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 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|