The secret santa problem.

Liberti, Leo and Raimondi, Franco (2008) The secret santa problem. Lecture Notes in Computer Science, 5034 . pp. 271-279. ISSN 0302-9743


This item is available in the Library Catalogue


Consider a digraph where the vertices represent people and an arc (i, j) represents the possibility of i giving a gift to j. The basic question we pose is whether there is an anonymity-preserving “gift assignment” such that each person makes and receives exactly one gift, and such that no person i can infer the remaining gift assignments from the fact that i is assigned to give a gift to j. We formalize this problem as a graph property involving vertex disjoint circuit covers, give a polynomial algorithm to decide this property for any given graph and provide a computational validation of the algorithm.

Item Type:Article
Research Areas:School of Science and Technology > Science & Technology
Citations on ISI Web of Science:0
ID Code:5279
Useful Links:
Deposited On:29 Apr 2010 16:17
Last Modified:29 Jul 2014 13:57

Repository staff only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year