Limit theorem for the Robin Hood game

Omer Angel, Anastasios Matzavinos and Alexander Roitershtein

Statistics & Probability Letters, 2019, vol. 149, issue C, 9-15

Abstract: 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 (rKeywords: Urn scheme; Limit theorems; Extreme order statistics; Coupon collector problem; Fréchet’s distribution (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715219300070
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:149:y:2019:i:c:p:9-15

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2019.01.001

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().