A Secret Santa exchange can be perfectly organized and still break after assignments are sent.
Someone gets sick. A contractor leaves the team. International shipping becomes impossible. A participant realizes that the assigned gift deadline conflicts with travel.
The tempting response is to re-run the entire draw. That restores mathematical neatness, but it also creates three new problems:
- everyone must discard an assignment they may already have acted on;
- people may learn that their original giver or recipient changed;
- gifts already ordered can become unusable.
A better recovery plan preserves as many assignments as possible while restoring a complete one-giver-to-one-recipient cycle.
First decide whether a repair is safe
Use a local repair only when all of these are true:
- exactly one participant has withdrawn;
- the organizer still has the private assignment map;
- the remaining group can satisfy every exclusion rule;
- affected people have not publicly revealed their matches;
- the organizer can privately contact the small number of people whose assignments change.
If several people leave, the private map is lost, or the new exclusions make the group impossible, stop and run a fresh draw. A full redraw is inconvenient; a secretly invalid repair is worse.
The smallest repair is usually a chain splice
Imagine the original cycle contains:
Ava -> Ben -> Chloe -> Diego -> Ava
If Chloe withdraws, Ben currently gives to Chloe and Chloe gives to Diego. Remove Chloe and connect Ben to Diego:
Ava -> Ben -> Diego -> Ava
Only Ben needs a new recipient. Everyone else keeps the same assignment.
Before sending the change, verify:
- Ben is allowed to draw Diego;
- Diego is not Ben;
- the new edge does not violate a household, manager, repeat-match, or shipping rule;
- Diego still has exactly one giver;
- every remaining person is both a giver and a recipient exactly once.
If the direct splice violates a rule, look for a short alternating chain. For example, swap two or three recipient edges among unaffected participants until every edge is valid. Choose the solution that changes the fewest assignments.
Do not “just swap two people” without checking the whole map
A local swap can accidentally create:
- a self-assignment;
- two gifts going to the same person;
- a participant receiving no gift;
- a forbidden household pair;
- last year's match again;
- a shipping route the giver cannot use.
After any repair, recompute the complete set of invariants. Do not validate only the newly added edge.
A useful checklist is:
number of givers == number of remaining participants number of unique recipients == number of remaining participants no giver == recipient no edge appears in the exclusion list every participant appears once on each side Protect the information that did not need to change
Tell only the affected giver that their recipient changed. Do not send the full assignment map to the group and do not announce who was originally assigned to the person who left.
A concise private message is enough:
The participant list changed, so your Secret Santa recipient has been updated. Please use the new private assignment below and ignore the earlier one. No other action is needed.
If the person already bought a personalized gift, give them a private route to the organizer. The organizer can decide whether to reimburse, re-route, or preserve the original gift without exposing the draw.
Track states, not just names
An organizer's private record should distinguish:
- invited;
- joined;
- assigned;
- assignment viewed;
- gift ordered (optional, self-reported);
- withdrawn;
- repaired and notified.
The minimum-change rule becomes more important after someone has viewed an assignment or ordered a gift.
Do not collect unnecessary personal information. A display name, delivery method, and optional wish list are often enough. Delete addresses and other delivery details after the exchange.
When a full redraw is the right answer
Start over when:
- two or more participants withdraw at once;
- a new exclusion affects several existing edges;
- the organizer cannot prove that everyone still has one giver and one recipient;
- too many people would need changed assignments;
- the group prefers transparency over preserving prior assignments.
If you redraw, invalidate every old link or message clearly. A participant should never have to guess which assignment is current.
Test the repaired graph before notifying anyone
The same matching model used for the initial draw can validate the remaining group. I published a dependency-free implementation and a step-by-step organizer checklist in the Secret Santa Organizer Toolkit.
For a browser-based organizer flow with exclusions and private share links, Secret Santa Generator is another option. Disclosure: I maintain both the open-source reference and that browser tool.
A withdrawal should not force every participant to restart. Preserve valid edges, repair the smallest possible part of the cycle, validate the complete map, and privately notify only the people whose assignment actually changed.