Name
Affiliation
Papers
KATRINA LIGETT
Cornell University, Ithaca, NY
58
Collaborators
Citations 
PageRank 
90
923
66.19
Referers 
Referees 
References 
1310
707
614
Search Limit
1001000
Title
Citations
PageRank
Year
A new analysis of differential privacy’s generalization guarantees (invited paper)00.342021
Learn To Expect The Unexpected: Probably Approximately Correct Domain Generalization00.342021
Algorithmic Learning Theory 2021: Preface.00.342021
Gaming Helps! Learning From Strategic Interactions In Natural Dynamics00.342021
Privately Learning Thresholds: Closing the Exponential Gap00.342020
Letter from SIGecom executive committee00.342020
Bounded-Leakage Differential Privacy.00.342020
Invitation to participate in the symposium on foundations of responsible computing00.342020
A New Analysis of Differential Privacy's Generalization Guarantees.00.342020
Learning to Prune: Speeding up Repeated Computations00.342019
Equal Opportunity in Online Classification with Partial Feedback.00.342019
A necessary and sufficient stability notion for adaptive generalization.00.342019
A Necessary and Sufficient Stability Notion for Adaptive Generalization00.342019
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2014-2015.00.342019
Access to Population-Level Signaling as a Source of Inequality.10.342019
Special Issue on the Economics of Security and Privacy: Guest Editors’ Introduction00.342018
Third-Party Data Providers Ruin Simple Mechanisms00.342018
Accuracy First: Selecting a Differential Privacy Level for Accuracy Constrained ERM.20.362017
Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM.00.342017
Learning Fair Classifiers: A Regularization-Inspired Approach.00.342017
Adaptive Learning with Robust Generalization Guarantees.120.662016
Coordination Complexity: Small Information Coordinating Large Populations00.342016
Putting Peer Prediction Under the Micro(economic)scope and Making Truth-telling Focal.70.462016
Recovering Games from Perturbed Equilibrium Observations Using Convex Optimization.00.342016
Finding any nontrivial coarse correlated equilibrium is hard.60.502015
Approximating Nash Equilibria in Tree Polymatrix Games70.482015
Truthful Linear Regression50.522015
The Strange Case of Privacy in Equilibrium Models10.362015
Accuracy for Sale: Aggregating Data with a Variance Constraint150.722015
Commitment in First-Price Auctions10.372015
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions80.842014
Network improvement for equilibrium routing20.422014
Buying private data without verification70.512014
Improved bounds on the price of stability in network cost sharing games160.782013
Privacy and coordination: computing on databases with endogenous participation171.102013
Information-sharing in social networks.10.372013
A learning theory approach to noninteractive database privacy30718.872013
The Network Improvement Problem for Equilibrium Routing.20.392013
Privacy as a coordination game00.342013
A tale of two metrics: simultaneous bounds on competitiveness and regret231.042013
Take it or leave it: running a survey when privacy comes at a cost362.242012
A simple and practical algorithm for differentially private data release1173.982012
The Power of Fair Pricing Mechanisms00.342012
Beating the best Nash without regret110.692011
Beyond the Nash Equilibrium Barrier.181.052011
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games636.522010
Differentially private combinatorial optimization472.212010
Privacy-Compatibility For General Utility Metrics00.342010
Information-Sharing and Privacy in Social Networks30.522010
Contention Resolution under Selfishness20.372010
  • 1
  • 2