Katrina Ligett

Katrina Ligett is an American computer scientist. She is Associate Professor of computer science and economics at the Hebrew University and Visiting Associate at California Institute of Technology. She is known for work on algorithmic game theory and privacy.

Katrina Ligett
NationalityAmerican
Alma materCarnegie Mellon University
Known forAlgorithmic game theory, privacy
Scientific career
FieldsComputer Science
InstitutionsHebrew University
Doctoral advisorAvrim Blum

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] 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.[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
  1. Microsoft Research Faculty Fellows 2013
  2. Katrina Ligett at the Caltech Directory
  3. Blum, Avrim; Ligett, Katrina; Roth, Aaron (2008), "A learning theory approach to non-interactive database privacy", A learning theory approach to noninteractive database privacy, p. 609, arXiv:1109.2229, doi:10.1145/1374376.1374464, ISBN 9781605580470
  4. Blum, Avrim; Hajiaghayi, Mohammadtaghi; Ligett, Katrina; Roth, Aaron (2008), "Regret minimization and the price of total anarchy", Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08, p. 373, CiteSeerX 10.1.1.116.5105, doi:10.1145/1374376.1374430, ISBN 9781605580470
  5. Google Faculty Research Award Recipients
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.