Algorithms for Loot Box Design

Abstract

From Loot Boxes to Better Design: Pricing Randomized Products Randomized rewards—often described as “mystery packs” or “blind-box” mechanics—are now a familiar feature in many video games. Yet choosing a loot box’s price and the odds of each possible drop is not just a design decision; it is a challenging optimization problem. In their accepted Operations Research paper, “Algorithms for loot box design” (Han, Ryan, and Tong, forthcoming), the authors develop an algorithmic framework for designing loot boxes by selecting a purchase price and item drop probabilities to maximize expected revenue under player choice behavior. They show that the general problem is computationally hard, but also identify economically motivated restrictions on player utilities that make the design problem tractable. When the number of items is fixed, the paper provides an exact polynomial-time algorithm under one class of utility structures and efficient approximation algorithms with provable guarantees under another. The analysis also links loot-box design to classic pricing ideas, offering guidance on how to translate item-level values and rarity into transparent, well-performing randomized reward systems.