# Aaron Roth

According to our database

Collaborative distances:

^{1}, Aaron Roth authored at least 78 papers between 2008 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2018

Strategic Classification from Revealed Preferences.

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Local Differential Privacy for Evolving Data.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Online Learning with an Unknown Fairness Metric.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Mitigating Bias in Adaptive Data Gathering via Differential Privacy.

Proceedings of the 35th International Conference on Machine Learning, 2018

Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness.

Proceedings of the 35th International Conference on Machine Learning, 2018

Meritocratic Fairness for Infinite and Contextual Bandits.

Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

2017

An Antifolk Theorem for Large Repeated Games.

ACM Trans. Economics and Comput., 2017

A framework for adaptive differential privacy.

PACMPL, 2017

Pricing information (and its implications): technical perspective.

Commun. ACM, 2017

Guilt-free data reuse.

Commun. ACM, 2017

Multidimensional Dynamic Pricing for Welfare Maximization.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Fairness Incentives for Myopic Agents.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Accuracy First: Selecting a Differential Privacy Level for Accuracy Constrained ERM.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Meritocratic Fairness for Cross-Population Selection.

Proceedings of the 34th International Conference on Machine Learning, 2017

Fairness in Reinforcement Learning.

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Computer-Aided Verification for Mechanism Design.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Watch and learn: optimizing from revealed preferences feedback.

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Do prices coordinate markets?

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Jointly Private Convex Programming.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The Strange Case of Privacy in Equilibrium Models.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Privacy Odometers and Filters: Pay-as-you-Go Composition.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Fairness in Learning: Classic and Contextual Bandits.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning from Rational Behavior: Predicting Solutions to Unknown Linear Programs.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Coordination Complexity: Small Information Coordinating Large Populations.

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Tight Policy Regret Bounds for Improving and Decaying Bandits.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Max-Information, Differential Privacy, and Post-selection Hypothesis Testing.

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Adaptive Learning with Robust Generalization Guarantees.

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Privacy and Truthful Equilibrium Selection for Aggregative Games.

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Preserving Statistical Validity in Adaptive Data Analysis.

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy).

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Inducing Approximately Optimal Flow Using Truthful Mediators.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Private Pareto Optimal Exchange.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy.

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Generalization in Adaptive Data Analysis and Holdout Reuse.

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Accuracy for Sale: Aggregating Data with a Variance Constraint.

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Online Learning and Profit Maximization from Revealed Preferences.

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Differential Privacy as a Tool for Mechanism Design in Large Systems.

SIGMETRICS Performance Evaluation Review, 2014

The Algorithmic Foundations of Differential Privacy.

Foundations and Trends in Theoretical Computer Science, 2014

Private matchings and allocations.

Proceedings of the Symposium on Theory of Computing, 2014

Exploiting Metric Structure for Efficient Private Query Release.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Constrained Signaling in Auction Design.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Asymptotically truthful equilibrium selection in large congestion games.

Proceedings of the ACM Conference on Economics and Computation, 2014

Bounds for the query complexity of approximate equilibria.

Proceedings of the ACM Conference on Economics and Computation, 2014

Buying private data without verification.

Proceedings of the ACM Conference on Economics and Computation, 2014

Mechanism design in large games: incentives and privacy.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Dual Query: Practical Private Query Release for High Dimensional Data.

Proceedings of the 31th International Conference on Machine Learning, 2014

Privately Solving Linear Programs.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Differential Privacy: An Economic Method for Choosing Epsilon.

Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

2013

Privacy and mechanism design.

SIGecom Exchanges, 2013

Constrained signaling for welfare and revenue maximization.

SIGecom Exchanges, 2013

A learning theory approach to noninteractive database privacy.

J. ACM, 2013

Coordination When Information is Scarce: How privacy can help.

ACM Crossroads, 2013

Differential privacy for the analyst via private equilibrium computation.

Proceedings of the Symposium on Theory of Computing Conference, 2013

Beyond worst-case analysis in private singular vector computation.

Proceedings of the Symposium on Theory of Computing Conference, 2013

Fast Private Data Release Algorithms for Sparse Queries.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

Differential privacy, equilibrium, and efficient allocation of resources.

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Buying private data at auction: the sensitive surveyor's problem.

SIGecom Exchanges, 2012

Efficiently Learning from Revealed Preference.

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Take It or Leave It: Running a Survey When Privacy Comes at a Cost.

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Iterative Constructions and Private Data Release.

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Beating randomized response on incoherent matrices.

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Conducting truthful surveys, cheaply.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Distributed Private Heavy Hitters.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Privately releasing conjunctions and the statistical query barrier.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Selling privacy at auction.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010

Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms.

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Interactive privacy via the median mechanism.

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the Equilibria of Alternating Move Games.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Differentially Private Combinatorial Optimization.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Auctions with online supply.

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

The Power of Fair Pricing Mechanisms.

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Differential Privacy and the Fat-Shattering Dimension of Linear Queries.

Proceedings of the Approximation, 2010

2009

Differentially Private Combinatorial Optimization.

Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009

2008

The Price of Malice in Linear Congestion Games.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A learning theory approach to non-interactive database privacy.

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Regret minimization and the price of total anarchy.

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

The Price of Stochastic Anarchy.

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008