posted on 2004-04-20, 00:00authored byAdrian Dobra, Stephen E. Fienberg
We describe new results for upper and lower bounds on the entries in multi-way tables of counts based on a set of released and possibly overlapping marginal tables which have practical import for assessing disclosure risk. In particular, we present a generalized version of the shuttle algorithm proposed by Buzzigoli and Giusti that is proven to compute sharp integer bounds for an arbitrary set of fixed marginals.