The secret santa problem.

Liberti, Leo and Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713 (2008) The secret santa problem. Lecture Notes in Computer Science, 5034 . pp. 271-279. ISSN 0302-9743 [Article] (doi:10.1007/978-3-540-68880-8_26)

[img]
Preview
PDF
Download (410kB) | Preview

Abstract

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: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
A. > School of Science and Technology > Computer Science > Foundations of Computing group
A. > School of Science and Technology > Computer Science > Intelligent Environments group
A. > School of Science and Technology > Computer Science > SensoLab group
ISI Impact: 0
Item ID: 5279
Useful Links:
Depositing User: Franco Raimondi
Date Deposited: 29 Apr 2010 16:17
Last Modified: 15 Jun 2021 10:49
URI: https://eprints.mdx.ac.uk/id/eprint/5279

Actions (login required)

View Item View Item

Statistics

Downloads
Activity Overview
359Downloads
445Hits

Additional statistics are available via IRStats2.