Disclosure control on multi-way tables by means of the shuttle algorithm: extensions and experiments
Lucia Buzzigoli, Antonio Giusti · COMPSTAT · 2000
In this paper we re-examine our algorithm for calculating the lower and upper bounds of an array given the complete set of its marginals, proposing some extensions. The algorithm has some interesting properties that can be useful in various fields of application, such as statistical disclosure control of count tables. These properties involve both theoretical and computational issues: in particular, the algorithm has relevant links with probabilistic and statistical aspects (e.g. Fréchet and Bonferroni bounds) and is particularly easy to implement, has a low storage requirement and is very fast.