Compressed Sensing and L1 Minimisation: Sparse Mystery-Shopper Probes and the Exact Recovery of Competitors' Hidden-Discount Matrices: chapter answers

The trade assumes that learning which of a rival's items carry a hidden discount at checkout, one not printed on the label, and how large each is, requires quoting every item in a full census, since sampling yields at best an average. This book uses compressed sensing to refute the premise of that view. As long as hidden discounts are sparse, putting items into random carts and reading only the checkout totals needs a number of quotes roughly proportional to the number of discounts times the logarithm of the ratio of items to discounts, far fewer than the items themselves, and L1 minimisation…

DOI pending · monograph page goes live after publication · 5DL-B-242 · 中文版

Illustrative model calculation, not a live quote