Strategic behavior and database privacy

[1]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[2]  Maria-Florina Balcan,et al.  Near-Optimality in Covering Games by Exposing Global Information , 2014, TEAC.

[3]  Martin Hoefer,et al.  Selfish Service Installation in Networks , 2006, WINE.

[4]  Marco Zennaro,et al.  Long distance wireless sensor networks: simulation vs reality , 2010, NSDR '10.

[5]  Santosh S. Vempala,et al.  Fourier PCA , 2013, ArXiv.

[6]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[7]  Quoc V. Le,et al.  Tiled convolutional neural networks , 2010, NIPS.

[8]  Phong Q. Nguyen,et al.  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures , 2006, EUROCRYPT.

[9]  Pierre Comon,et al.  Independent component analysis, A new concept? , 1994, Signal Process..

[10]  Tzyy-Ping Jung,et al.  Extended ICA Removes Artifacts from Electroencephalographic Recordings , 1997, NIPS.

[11]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[12]  Martin Hoefer,et al.  Non-cooperative facility location and covering games , 2006, Theor. Comput. Sci..

[13]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[14]  R. Vershynin.  How Close is the Sample Covariance Matrix to the Actual Covariance Matrix? , 2010, 1004.3484.

[15]  Moshe Tennenholtz,et al.  Approximately optimal mechanism design via differential privacy , 2010, ITCS '12.

[16]  Georgios Piliouras,et al.  Beating the best Nash without regret , 2011, SECO.

[17]  Honglak Lee,et al.  Sparse deep belief net model for visual area V2 , 2007, NIPS.

[18]  R. Adamczak,et al.  Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles , 2009, 0903.2323.

[19]  Éva Tardos,et al.  Beyond the Nash Equilibrium Barrier , 2011, ICS.

[20]  Britta Peis,et al.  Resource Buying Games , 2012, ESA.

[21]  T. Groves.  The allocation of resources under uncertainty : the informational and incentive roles of prices and demands in a team , 1970 .

[22]  Yeheskel Bar-ness,et al.  Bootstrapping adaptive interference cancelers - Some practical limitations , 1982 .

[23]  Arpita Ghosh,et al.  Privacy and coordination: computing on databases with endogenous participation , 2013, EC '13.

[24]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[25]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[26]  Georgios Piliouras,et al.  No Regret Learning in Oligopolies: Cournot vs. Bertrand , 2010, SAGT.

[27]  Jérôme Monnot,et al.  On the Impact of Local Taxes in a Set Cover Game , 2010, SIROCCO.

[28]  David P. Williamson,et al.  Stackelberg thresholds in network routing games or the value of altruism , 2007, EC '07.

[29]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[30]  Anima Anandkumar,et al.  Tensor decompositions for learning latent variable models , 2012, J. Mach. Learn. Res..

[31]  M. Rudelson,et al.  Lp-moments of random vectors via majorizing measures , 2005, math/0507023.

[32]  Santosh S. Vempala,et al.  Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA , 2011, 1108.3329.

[33]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[34]  Erkki Oja,et al.  Independent Component Analysis , 2001 .

[35]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[36]  Larry A. Wasserman,et al.  Differential privacy with compression , 2009, 2009 IEEE International Symposium on Information Theory.

[37]  Morteza Zadimoghaddam,et al.  Constant Price of Anarchy in Network Creation Games via Public Service Advertising , 2010, WAW.

[38]  Éva Tardos,et al.  Near-Optimal Network Design with Selfish Agents , 2008, Theory Comput..

[39]  Nicole Immorlica,et al.  Coalition Formation and Price of Anarchy in Cournot Oligopolies , 2010, WINE.

[40]  Cynthia Dwork,et al.  Differential privacy and robust statistics , 2009, STOC '09.

[41]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[42]  Mitali Singh,et al.  Decentralized Utility-based Sensor Network Design , 2006, Mob. Networks Appl..

[43]  Anand D. Sarwate,et al.  Near-optimal Differentially Private Principal Components , 2012, NIPS.

[44]  Stephen Chong,et al.  Truthful mechanisms for agents that value privacy , 2011, EC.

[45]  L. Shapley,et al.  Potential Games , 1994 .

[46]  László A. Végh,et al.  LP-Based Covering Games with Low Price of Anarchy , 2012, WINE.

[47]  Aaron Roth,et al.  Beating randomized response on incoherent matrices , 2011, STOC '12.

[48]  Aaron Roth,et al.  Beyond worst-case analysis in private singular vector computation , 2012, STOC '13.

[49]  Erkki Oja,et al.  Independent Component Analysis for Identification of Artifacts in Magnetoencephalographic Recordings , 1997, NIPS.

[50]  Erkki Oja,et al.  Independent component approach to the analysis of EEG and MEG recordings , 2000, IEEE Transactions on Biomedical Engineering.

[51]  Sanjeev Arora,et al.  Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders , 2012, Algorithmica.

[52]  Chris Peikert,et al.  How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE , 2013, ACNS.

[53]  Jinwoo Shin,et al.  On the impact of global information on diffusion of innovations over social networks , 2013, INFOCOM Workshops.

[54]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[55]  Martin Hoefer.  Competitive Cost Sharing with Economies of Scale , 2009, Algorithmica.

[56]  Joseph Naor,et al.  Non-Cooperative Cost Sharing Games via Subsidies , 2010, Theory of Computing Systems.

[57]  T. Groves,et al.  Optimal Allocation of Public Goods: A Solution to the 'Free Rider Problem' , 1977 .

[58]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[59]  B. Biswal,et al.  Blind source separation of multiple signal sources of fMRI data sets using independent component analysis. , 1999, Journal of computer assisted tomography.

[60]  Aaron Roth,et al.  Selling privacy at auction , 2015, Games Econ. Behav..

[61]  Quoc V. Le,et al.  ICA with Reconstruction Cost for Efficient Overcomplete Feature Learning , 2011, NIPS.

[62]  R. Mathias.  A Bound for the Matrix Square Root with Application to Eigenvector Perturbation , 1997, SIAM J. Matrix Anal. Appl..

[63]  Georgios Piliouras,et al.  MEDIUM AND LONG-RUN PROPERTIES OF LINGUISTIC COMMUNITY EVOLUTION , 2012 .

[64]  M. Rudelson.  Random Vectors in the Isotropic Position , 1996, math/9608208.

[65]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[66]  Sara Krehbiel Georgia.  Markets for Database Privacy , 2014 .

[67]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[68]  Erkki Oja,et al.  Independent Component Analysis for Parallel Financial Time Series , 1998, International Conference on Neural Information Processing.

[69]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[70]  Yoshua. Bengio,et al.  Learning Deep Architectures for AI , 2007, Found. Trends Mach. Learn..

[71]  Aaron Roth,et al.  Take It or Leave It: Running a Survey When Privacy Comes at a Cost , 2012, WINE.

[72]  Kobbi Nissim,et al.  Redrawing the boundaries on purchasing data from privacy-sensitive individuals , 2014, ITCS.

[73]  Aaron Roth,et al.  Privacy and mechanism design , 2013, SECO.

[74]  H. Chen,et al.  Independent component analysis for human epileptic spikes extraction , 2005, Proceedings. 2005 First International Conference on Neural Interface and Control, 2005..

[75]  Sirin Tekinay,et al.  Diffusion-based Approach to Deploying Wireless Sensors to Satisfy Coverage, Connectivity and Reliability , 2007, 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services (MobiQuitous).

[76]  Christian Jutten,et al.  Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture , 1991, Signal Process..

[77]  Yu-Han Lyu,et al.  Approximately optimal auctions for selling privacy when costs are correlated with data , 2012, EC '12.

[78]  Éva Tardos,et al.  Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract , 2009, STOC '09.

[79]  P. Samuelson.  The Pure Theory of Public Expanditure , 1954 .

[80]  Hyunseung Choo,et al.  Energy-efficient Area Coverage by Sensors with Adjustable Ranges , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[81]  Maria-Florina Balcan,et al.  Improved equilibria via public service advertising , 2009, SODA.

[82]  Alan M. Frieze,et al.  Learning linear transformations , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[83]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[84]  Kobbi Nissim,et al.  Privacy-aware mechanism design , 2011, EC '12.

[85]  Alfredo García,et al.  A Game-Theoretic Approach to Efficient Power Management in Sensor Networks , 2008, Oper. Res..

[86]  John Porrill,et al.  Analysis of Optical Imaging Data Using Weak Models and ICA , 2000 .

[87]  Mechanism Design in Large Games: Incentives and Privacy , 2014 .

[88]  Adam D. Smith,et al.  Efficient, Differentially Private Point Estimators , 2008, ArXiv.

[89]  Maria-Florina Balcan,et al.  Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior , 2013, SIAM J. Comput..

[90]  Jeff S. Shamma,et al.  Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence , 2014, SODA.

[91]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[92]  R. Vershynin,et al.  Covariance estimation for distributions with 2+ε moments , 2011, 1106.2775.

[93]  Hironori Yamauchi,et al.  Signal and noise separation in medical diagnostic system based on independent component analysis , 2010, 2010 IEEE Asia Pacific Conference on Circuits and Systems.

[94]  David Xiao,et al.  Is privacy compatible with truthfulness? , 2013, ITCS '13.

[95]  Vitaly Shmatikov,et al.  Robust De-anonymization of Large Sparse Datasets , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[96]  Anima Anandkumar,et al.  A Spectral Algorithm for Latent Dirichlet Allocation , 2012, Algorithmica.

[97]  Aaron Roth,et al.  A learning theory approach to non-interactive database privacy , 2008, STOC.

[98]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).