Katrina Ligett
According to our database^{1},
Katrina Ligett
authored at least 42 papers
between 2006 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at www.ams.org

at orcid.org
On csauthors.net:
Bibliography
2019
Access to PopulationLevel Signaling as a Source of Inequality.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019
Learning to Prune: Speeding up Repeated Computations.
Proceedings of the Conference on Learning Theory, 2019
2018
Special Issue on the Economics of Security and Privacy: Guest Editors' Introduction.
ACM Trans. Internet Techn., 2018
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
2016
Putting Peer Prediction Under the Micro(economic)scope and Making TruthTelling Focal.
Proceedings of the Web and Internet Economics  12th International Conference, 2016
The Strange Case of Privacy in Equilibrium Models.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
Coordination Complexity: Small Information Coordinating Large Populations.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Adaptive Learning with Robust Generalization Guarantees.
Proceedings of the 29th Conference on Learning Theory, 2016
2015
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
Commitment in FirstPrice Auctions.
Proceedings of the Algorithmic Game Theory  8th International Symposium, 2015
Approximating Nash Equilibria in Tree Polymatrix Games.
Proceedings of the Algorithmic Game Theory  8th International Symposium, 2015
Accuracy for Sale: Aggregating Data with a Variance Constraint.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Truthful Linear Regression.
Proceedings of The 28th Conference on Learning Theory, 2015
2014
Network improvement for equilibrium routing.
SIGecom Exchanges, 2014
Buying private data without verification.
Proceedings of the ACM Conference on Economics and Computation, 2014
Network Improvement for Equilibrium Routing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
A learning theory approach to noninteractive database privacy.
J. ACM, 2013
Informationsharing in social networks.
Games and Economic Behavior, 2013
A tale of two metrics: simultaneous bounds on competitiveness and regret.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013
Improved bounds on the price of stability in network cost sharing games.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Privacy and coordination: computing on databases with endogenous participation.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret.
Proceedings of the COLT 2013, 2013
Privacy as a coordination game.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013
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
Beyond myopic best response (in Cournot competition).
Proceedings of the TwentyThird Annual ACMSIAM Symposium on Discrete Algorithms, 2012
A Simple and Practical Algorithm for Differentially Private Data Release.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 36, 2012
2011
Beating the best Nash without regret.
SIGecom Exchanges, 2011
Beyond the Nash Equilibrium Barrier.
Proceedings of the Innovations in Computer Science, 2011
2010
Differentially Private Combinatorial Optimization.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
The Power of Fair Pricing Mechanisms.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
SpaceEfficient Estimation of Robust Statistics and Distribution Testing.
Proceedings of the Innovations in Computer Science, 2010
Contention Resolution under Selfishness.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
On the Price of Stability for Undirected Network Design.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
Differential privacy with compression.
Proceedings of the IEEE International Symposium on Information Theory, 2009
Differentially Private Combinatorial Optimization.
Proceedings of the Parameterized complexity and approximation algorithms, 13.12., 2009
2008
A learning theory approach to noninteractive 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
2007
Playing games with approximation algorithms.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Compressing rectilinear pictures and minimizing access control lists.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
2006
Routing without regret: on convergence to nash equilibria of regretminimizing algorithms in routing games.
Proceedings of the TwentyFifth Annual ACM Symposium on Principles of Distributed Computing, 2006