Packing Random Rectangles of Given Volume

A packing of a collection of rectangles is a disjoint subcollection. In a recent paper, Coffman et al. (1999) prove that the cardinality of a maximum packing of a family of n random rectangles in [0, 1]² is of order n^1/2. We obtain tight bounds on the same quantity when the random rectangles are of a specified volume.