Packing measure and dimension of random fractals

We consider random fractals generated by random recursive constructions. We prove that the box-counting and packing dimensions of these random fractals, K, equals α, their almost sure Hausdorff dimension. We show that some "almost deterministic" conditions known to ensure that the Hausdorff measure satisfies 0 < ℋ^α(K) < ∞ also imply that the packing measure satisfies 0 < ℘^α(K) < ∞. When these conditions are not satisfied, it is known 0 = ℋ ^α(K). Correspondingly, we show that in this case ℘ ^α(K) = ∞,-provided a random strong open set condition is satisfied. We also find gauge functions θ(t) so that the ℘ ^θ-packing measure is finite.