BibTeX
CSL-JSON
MLA
Harvard
Analysis of the gift exchange problem
release_gdieriawpzcu7gozdogptfst4u
by
Moa Apagodu, David Applegate, N. J. A. Sloane, Doron Zeilberger
Released
as a article
.
2017
Abstract
In the gift exchange game there are n players and n wrapped gifts. When a
player's number is called, that person can either choose one of the remaining
wrapped gifts, or can "steal" a gift from someone who has already unwrapped it,
subject to the restriction that no gift can be stolen more than a total of
sigma times. The problem is to determine the number of ways that the game can
be played out, for given values of sigma and n. Formulas and asymptotic
expansions are given for these numbers. This work was inspired in part by a
2005 remark by Robert A. Proctor in the On-Line Encyclopedia of Integer
Sequences.
In text/plain format
Archived Files and Locations
application/pdf 180.7 kB
file_nsmd4dvrqvgsdmh6bqrerbzosu
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1701.08394v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links