"Secret Santa" and the Combined Length of Spanned Cycles in a Random Permutation
Yannai A. Gonczarowski

TL;DR
This paper analyzes the probability distribution of the number of students affected in a Secret Santa game when some forget to bring gifts, providing explicit formulas and implications for related game theory problems.
Contribution
It introduces explicit formulas for the distribution, expectation, and variance of the number of students affected, connecting the problem to permutation cycle analysis and game theory.
Findings
Expected unaffected students less than 1/(m+1) when m students forget
Explicit probability formulas for all possible affected counts
Low probability of large deviations from the expected unaffected count
Abstract
In many schools throughout the United States, it is customary to hold a yearly "Secret Santa" event. With the approach of Christmas, all the students place their names in a hat; each student, in turn, draws a name out of the hat, thus becoming Secret Santa to the student whose name is drawn. On the day before Christmas break, each student places a gift in front of the locker of the student to whom she or he is Secret Santa. Unfortunately, children being children, some students might forget to bring gifts on this day. Students who do not find gifts next to their lockers, feeling cheated, angrily take their gifts back from their recipients, who in turn reclaim their gifts from their recipients, and so forth. We analyze the distribution of the number of students whose Christmas is ruined, as a function of the number of students who do not bring gifts. We give a simple, explicit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Game Theory and Applications · Auction Theory and Applications
