Sparse covers for sums of indicators
Name
Daskalakis_Sparse covers.pdf
Size
242.55 KB
Format
Adobe PDF
Checksum (MD5)
04f8bcb1602cab6cd8de1ecb2b327910
Author(s)
Papadimitriou, Christos
Daskalakis, Konstantinos
Date Issued
November 2014
Journal
Probability Theory and Related Fields
Publisher
Springer-Verlag
Citation
Daskalakis, Constantinos, and Christos Papadimitriou. “Sparse Covers for Sums of Indicators.” Probab. Theory Relat. Fields 162, no. 3–4 (November 2, 2014): 679–705.
Version
Original manuscript
Abstract
For all n, ε > 0), we show that the set of Poisson Binomial distributions on n variables admits a proper ε-cover in total variation distance of size n[superscript 2] + n · (1/ε)[superscript O(log[superscript 2] (1/ε)), which can also be computed in polynomial time. We discuss the implications of our construction for approximation algorithms and the computation of approximate Nash equilibria in anonymous games.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00440-014-0582-8
