
浏览量:100
Katrina Ligett
Associate Professor
点击登录, 查看更多内容

Katrina received her PhD in summer 2009 from the Computer Science Department at Carnegie Mellon University, where her advisor was Avrim Blum. From fall 2009 through summer 2011, she was a postdoctoral fellow in Computer Science at Cornell University, hosted by Éva Tardos and Bobby Kleinberg. She spent spring 2011 as a visitor at the Research Group on Algorithmic Game Theory at the Rationality Center and Institute for Advanced Studies at Hebrew University in Jerusalem. From 2011-2017, Katrina was an Assistant Professor of Computer Science and Economics at Caltech.
Katrina has been affiliated with programs at the Simons Institute for Theoretical Computer Science at Berkeley, on Economics and Computation and on Algorithms and Uncertainty. She is co-organizing an upcoming program on Data Privacy.
论文共 72 篇
Learning to Prune: Speeding up Repeated Computations
A necessary and sufficient stability notion for adaptive generalization.
Special Issue on the Economics of Security and Privacy: Guest Editors' Introduction.
Accuracy First: Selecting a Differential Privacy Level for Accuracy Constrained ERM.
Adaptive Learning with Robust Generalization Guarantees.
Coordination Complexity: Small Information Coordinating Large Populations.
Putting Peer Prediction Under the Microeconomicscope and Making Truth-Telling Focal
Network improvement for equilibrium routing
Accuracy for Sale: Aggregating Data with a Variance Constraint
Finding any nontrivial coarse correlated equilibrium is hard.
Commitment in First-Price Auctions
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard.
Contention Resolution under Selfishness
Buying private data without verification
Improved bounds on the price of stability in network cost sharing games
A learning theory approach to noninteractive database privacy
Privacy and coordination: computing on databases with endogenous participation
Information-sharing in social networks.
Privacy and Data-Based Research
The Power of Fair Pricing Mechanisms
Beyond myopic best response (in Cournot competition)
Take it or leave it: running a survey when privacy comes at a cost
Beyond myopic best response (in Cournot competition)
Beyond the Nash Equilibrium Barrier.
Beating the best Nash without regret
A learning theory approach to non-interactive database privacy
Differentially private combinatorial optimization
The Power of Fair Pricing Mechanisms
Privacy-Compatibility For General Utility Metrics
Space-Efficient Estimation of Robust Statistics and Distribution Testing
Information-Sharing and Privacy in Social Networks
A simple and practical algorithm for differentially private data release
A simple and practical algorithm for differentially private data release
Differential privacy with compression
Differentially Private Approximation Algorithms
On the price of stability for undirected network design
A learning perspective on selfish behavior in games
Playing Games with Approximation Algorithms
Differentially Private Combinatorial Optimization.
The Price of Stochastic Anarchy
Regret minimization and the price of total anarchy
Compressing rectilinear pictures and minimizing access control lists
Playing games with approximation algorithms