We describe new results for sharp upper and lower bounds on the entries in multi-way tables of counts based on a set of released and possibly overlapping marginal tables. In particular, we present a generalized version of the shuttle algorithm proposed by Buzzigoli and Giusti that computes sharp integer bounds for an arbitrary set of fixed marginals. We also present two examples which illustrate the practical import of the bounds for assessing disclosure risk.

}, isbn = {978-3-7908-0047-0}, doi = {10.1007/978-3-642-57410-8_1}, url = {http://dx.doi.org/10.1007/978-3-642-57410-8_1}, author = {Adrian Dobra and Stephen E. Fienberg}, editor = {Haitovsky, Yoel and Ritov, Yaacov and Lerche, HansRudolf} }