Katrina Ligett
 | The topic of this article may not meet Wikipedia's notability guideline for academics. (August 2014) |
Katrina Ligett | |
|---|---|
| Nationality | American |
| Alma mater | Carnegie Mellon University |
| Known for | Algorithmic game theory, privacy |
| Scientific career | |
| Fields | Computer Science |
| Institutions | California Institute of Technology |
| Doctoral advisor | Avrim Blum |
Katrina Ligett is an American computer scientist. She is Assistant Professor of computer science and economics at the California Institute of Technology. She is known for work on algorithmic game theory and privacy.
Education
Ligett studied at Brown University, where she completed her BS degree in Mathematics and Computer Science in 2004. She then earned her MS and PhD in Computer Science from Carnegie Mellon University in 2007 and 2009, respectively. Her PhD was supervised by Avrim Blum.[1] She has been on the faculty of the California Institute of Technology since 2011.[2]
Research
Ligett's work has made notable contributions to two fields: privacy and algorithmic game theory. For example, in the field of data privacy, her work provided a foundation for the field by proving the possibility of answering exponentially many queries about a database while maintaining privacy for individuals.[3] In the field of algorithmic game theory, her work showed that efficiency guarantees proven for Nash equilibrium (so called Price of Anarchy bounds) can be extended to weaker equilibria concepts.[4]
Awards and honors
Ligett received a Microsoft Faculty Research Fellowship in 2013.[1] In the same year, she received an NSF CAREER award and a Google Faculty Research Award[5]
References
- ^ a b Microsoft Research Faculty Fellows 2013
- ^ Katrina Ligett at the Caltech Directory
- ^ A learning theory approach to noninteractive database privacy, doi:10.1145/1374376.1374464
- ^ Regret minimization and the price of total anarchy, doi:10.1145/1374376.1374430
- ^ Google Faculty Research Award Recipients