Abstract
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, according to which they will choose gifts, is announced. When a participant’s turn comes, she can either open a new gift with unknown value, or steal an already opened gift with known value from someone before her in the ordering; in the second case, the person whose gift was stolen gets to make the same choice.
We model the gift exchange as a sequential game of perfect information and characterize its equilibria, showing that each player plays a threshold strategy in the subgame perfect equilibrium of the game. We compute the expected utility of players as a function of the position in the random ordering; the first player’s utility is vanishingly small relative to every other player. We then analyze a different version of the game, also played in practice, where the first player is allowed an extra turn after all presents have been opened—we show that all players have equal utility in the equilibrium of this game.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://extratv.warnerbros.com/2009/12/president_obama_christmas_gifts_white_house.php
http://www.associatedcontent.com/article/83228/the_craziest_christmas_party_game_the.html?cat=74
http://www.partygameideas.com/christmas-games/gift_exchange_2.php
Roth, A.: Unraveling, Market Design, http://marketdesigner.blogspot.com/2009/06/unraveling.html
Ausubel, L.M., Milgrom, P.: The Lovely but Lonely Vickrey Auction. Combinatorial Auctions, 17–40 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, A., Mahdian, M. (2010). Christmas Gift Exchange Games. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)