Small contingency tables with large gaps

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multi-way tables.
6 pages

Keywords

Optimization and Control, Commutative Algebra, Statistics Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/130543

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0405038
 http://arxiv.org/abs/math/0405038

Collections

arXiv