Katrina Ligett

Affiliations:
  • Hebrew University, School of Computer Science and Engineering, Jerusalem, Israel
  • California Institute of Technology, Department of Computing and Mathematical Sciences, Pasadena, CA, USA
  • Cornell University, Department of Computer Science, Ithaca, NY, USA
  • Carnegie Mellon University, Pittsburgh, PA, USA


According to our database1, Katrina Ligett authored at least 60 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Letter from SIGecom executive committee.
SIGecom Exch., 2021

Generalization in the Face of Adaptivity: A Bayesian Perspective.
CoRR, 2021

A new analysis of differential privacy's generalization guarantees (invited paper).
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Learn to Expect the Unexpected: Probably Approximately Correct Domain Generalization.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Gaming Helps! Learning from Strategic Interactions in Natural Dynamics.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Invitation to participate in the symposium on foundations of responsible computing.
SIGecom Exch., 2020

Third-Party Data Providers Ruin Simple Mechanisms.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Causal Feature Discovery through Strategic Modification.
CoRR, 2020

A New Analysis of Differential Privacy's Generalization Guarantees.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Bounded-Leakage Differential Privacy.
Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020

Privately Learning Thresholds: Closing the Exponential Gap.
Proceedings of the Conference on Learning Theory, 2020

2019
Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM.
J. Priv. Confidentiality, 2019

Beyond myopic best response (in Cournot competition).
Games Econ. Behav., 2019

Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2014-2015.
Games Econ. Behav., 2019

Achieving target equilibria in network routing games without knowing the latency functions.
Games Econ. Behav., 2019

A Necessary and Sufficient Stability Notion for Adaptive Generalization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Equal Opportunity in Online Classification with Partial Feedback.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Access to Population-Level 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
Learning Fair Classifiers: A Regularization-Inspired Approach.
CoRR, 2017

2016
Recovering Games from Perturbed Equilibrium Observations Using Convex Optimization.
CoRR, 2016

Putting Peer Prediction Under the Micro(economic)scope and Making Truth-Telling 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.
SIGecom Exch., 2015

Commitment in First-Price 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 Exch., 2014

Contention Resolution under Selfishness.
Algorithmica, 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

2013
A learning theory approach to noninteractive database privacy.
J. ACM, 2013

Information-sharing in social networks.
Games Econ. Behav., 2013

The Network Improvement Problem for Equilibrium Routing.
CoRR, 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

Privacy as a coordination game.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
The Power of Fair Pricing Mechanisms.
Algorithmica, 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

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 3-6, 2012

2011
Beating the best Nash without regret.
SIGecom Exch., 2011

Beyond the Nash Equilibrium Barrier.
Proceedings of the Innovations in Computer Science, 2011

2010
Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games.
Theory Comput., 2010

Privacy-Compatibility For General Utility Metrics
CoRR, 2010

Information-Sharing and Privacy in Social Networks
CoRR, 2010

Space-Efficient Estimation of Robust Statistics and Distribution Testing.
Proceedings of the Innovations in Computer Science, 2010

2009
Playing Games with Approximation Algorithms.
SIAM J. Comput., 2009

Differentially Private Approximation Algorithms
CoRR, 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 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

2007
Compressing rectilinear pictures and minimizing access control lists.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007


  Loading...