Distinguishing Distributions When Samples Are Strategically Transformed
暂无分享,去创建一个
[1] Daniel M. Kane,et al. Testing Identity of Structured Distributions , 2014, SODA.
[2] Ariel D. Procaccia,et al. Strategyproof Linear Regression in High Dimensions , 2018, EC.
[3] Vincent Conitzer,et al. Complexity of Mechanism Design with Signaling Costs , 2015, AAMAS.
[4] Annie Liang,et al. Optimal and Myopic Information Acquisition , 2017, EC.
[5] Aaron Roth,et al. Strategic Classification from Revealed Preferences , 2017, EC.
[6] Nicole Immorlica,et al. Optimal Data Acquisition for Statistical Estimation , 2017, EC.
[7] Christos H. Papadimitriou,et al. Strategic Classification , 2015, ITCS.
[8] Ariel D. Procaccia,et al. Collaborative PAC Learning , 2017, NIPS.
[9] Jerry R. Green,et al. Partially Verifiable Information and Mechanism Design , 1986 .
[10] Yishay Mansour,et al. Efficient PAC Learning from the Crowd , 2017, COLT.
[11] Ariel D. Procaccia,et al. Algorithms for strategyproof classification , 2012, Artif. Intell..
[12] Lan Yu. Mechanism design with partial verification and revelation principle , 2010, Autonomous Agents and Multi-Agent Systems.
[13] Aaron Roth,et al. Learning from Rational Behavior: Predicting Solutions to Unknown Linear Programs , 2016, NIPS.
[14] Vincent Conitzer,et al. When Samples Are Strategically Selected , 2019, ICML.
[15] Vincent Conitzer,et al. The Revelation Principle for Mechanism Design with Reporting Costs , 2016, EC.
[16] Nicole Immorlica,et al. The Disparate Effects of Strategic Manipulation , 2018, FAT.
[17] M. Spence. Job Market Signaling , 1973 .
[18] Gregory Valiant,et al. An Automatic Inequality Prover and Instance Optimal Identity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Ariel D. Procaccia,et al. Incentive compatible regression learning , 2008, SODA '08.