Katrina Ligett
From Wikipedia, the free encyclopedia
Katrina Ligett | |
|---|---|
| Alma mater | Carnegie Mellon University |
| Known for | Algorithmic game theory, privacy |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Hebrew University |
| Thesis | A Learning Perspective on Selfish Behavior in Games (2009) |
| Doctoral advisor | Avrim Blum |
Katrina Ligett (Hebrew: קתרינה ליגת) is an Israeli-American computer scientist. She is a professor of computer science at the Hebrew University[1] and a Visiting Associate at California Institute of Technology. She is known for work on algorithmic game theory and privacy.
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.[2] She has been on the faculty of the California Institute of Technology since 2011.[3] Currently she is Associate Professor of Computer Science and Member of Federmann Center for the Study of Rationality at Hebrew University, as well as Visiting Associate in Computing and Mathematical Sciences at Caltech.
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.[4] 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.[5]
