Jump to content

Katrina Ligett: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
Content deleted Content added
VisualWikitext
Acwierman (talk | contribs)
31 edits
←Created page with '{{Infobox scientist | boxwidth = | name = Katrina Ligett | image = | image_size = | alt = | caption...'
 
 
(33 intermediate revisions by 22 users not shown)
Line 1: Line 1:
{{short description|American computer scientist}}
{{Infobox scientist
{{Infobox scientist
| boxwidth =
| boxwidth =
Line 9: Line 10:
| birth_place =
| birth_place =
| residence =
| residence =
| nationality = {{flagicon|US}} [[US|American]]
| nationality = [[US|American]]
| fields = [[Computer Science]]
| fields = [[Computer Science]]
| workplaces = [[California Institute of Technology]]
| workplaces = [[Hebrew University]]
| alma_mater = [[Carnegie Mellon University]]
| alma_mater = [[Carnegie Mellon University]]
| doctoral_advisor = [[Avrim Blum]]
| doctoral_advisor = [[Avrim Blum]]
Line 17: Line 18:
| doctoral_students =
| doctoral_students =
| notable_students =
| notable_students =
| known_for = [[Algorithmic Game Theory]], [[Privacy]]
| known_for = [[Algorithmic game theory]], [[privacy]]
| awards =
| awards =
}}
}}


'''Katrina Ligett''' is an American computer scientist. She is a Professor of [[computer science]] at the [[Hebrew University]]<ref>{{Cite web |title=Katrina Ligett's personal home page |url=https://www.cs.huji.ac.il/~katrina//index.html |access-date=2023-12-19 |website=Hebrew University's Computer Science Department}}</ref> and Visiting Associate at [[California Institute of Technology]]. She is known for work on [[algorithmic game theory]] and [[privacy]].


==Education==
'''Katrina Ligett''' is Professor of [[computer science]] and [[economics]] at the [[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]].<ref name="msaward">[http://research.microsoft.com/en-us/collaboration/awards/msrff_all.aspx#2013 Microsoft Research Faculty Fellows 2013]</ref> She has been on the faculty of the [[California Institute of Technology]] since 2011.<ref>[http://directory.caltech.edu/personnel/katrina Katrina Ligett] at the [http://directory.caltech.edu Caltech Directory]</ref> 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.

==Academic biography==
⚫
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]].<ref name="msaward">[http://research.microsoft.com/en-us/collaboration/awards/msrff_all.aspx#2013 Microsoft Research Faculty Fellows 2013]</ref> She has been on the faculty of the [[California Institute of Technology]] since 2011.<ref>[http://directory.caltech.edu/personnel/katrina Katrina Ligett] at the [http://directory.caltech.edu Caltech Directory]</ref>


==Research==
==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 in {{cite doi|10.1145/1374376.1374464}} provided a foundation for the field by proving the possibility of answering exponentially many queries about a database while maintaining privacy for individuals. Similarly, in the field of algorithmic game theory, her work in {{cite doi|10.1145/1374376.1374430}} showed that efficiency guarantees proven for Nash equilibrium (so called [[Price of Anarchy]] bounds) can be extended to weaker equilibria concepts.
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.<ref>{{citation | title = A learning theory approach to noninteractive database privacy | pages =609| doi =10.1145/1374376.1374464| arxiv =1109.2229| year =2008| last1 =Blum| first1 =Avrim| last2 =Ligett| first2 =Katrina| last3 =Roth| first3 =Aaron| isbn =9781605580470| s2cid =53039307}}</ref> 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.<ref>{{citation | chapter = Regret minimization and the price of total anarchy | doi=10.1145/1374376.1374430| title=Proceedings of the fortieth annual ACM symposium on Theory of computing - STOC 08| pages=373| year=2008| last1=Blum| first1=Avrim| last2=Hajiaghayi| first2=Mohammadtaghi| last3=Ligett| first3=Katrina| last4=Roth| first4=Aaron| isbn=9781605580470| citeseerx=10.1.1.116.5105| s2cid=12589969}}</ref>


==Awards and honors==
==Awards and honors==


Ligett received a Microsoft Faculty Reserach Fellowship in 2013.<ref name="msaward">[http://research.microsoft.com/en-us/collaboration/awards/msrff_all.aspx#2013 Microsoft Research Faculty Fellows 2013]</ref> In the same year, she received an NSF CAREER award and a Google Faculty Research Award<ref>[http://research.google.com/university/relations/fra_recipients.html Google Faculty Research Award Recipients]</ref>
Ligett received a Microsoft Faculty Research Fellowship in 2013.<ref name="msaward"/> In the same year, she received an NSF CAREER award and a Google Faculty Research Award<ref>[http://research.google.com/university/relations/fra_recipients.html Google Faculty Research Award Recipients]</ref>


==References==
==References==
Line 41: Line 41:
* [http://users.cms.caltech.edu/~katrina/ Katrina Ligett professional home page]
* [http://users.cms.caltech.edu/~katrina/ Katrina Ligett professional home page]


{{Authority control}}
{{Persondata <!-- Metadata: see [[Wikipedia:Persondata]]. -->

| NAME = Ligett, Katrina
| ALTERNATIVE NAMES =
| SHORT DESCRIPTION = American computer scientist
| DATE OF BIRTH =
| PLACE OF BIRTH =
| DATE OF DEATH =
| PLACE OF DEATH =
}}
{{DEFAULTSORT:Ligett, Katrina}}
{{DEFAULTSORT:Ligett, Katrina}}
[[:Category:Living people]]
[[Category:Living people]]
[[:Category:California Institute of Technology faculty]]
[[Category:American computer scientists]]
[[:Category:Theoretical computer scientists]]
[[Category:American women computer scientists]]
[[Category:Brown University alumni]]
[[Category:Carnegie Mellon University alumni]]
[[Category:California Institute of Technology faculty]]
[[Category:American theoretical computer scientists]]
[[Category:American game theorists]]
[[Category:Year of birth missing (living people)]]

Latest revision as of 04:17, 20 July 2024

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

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

Education

[edit]

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

[edit]

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]

Awards and honors

[edit]

Ligett received a Microsoft Faculty Research Fellowship in 2013.[2] In the same year, she received an NSF CAREER award and a Google Faculty Research Award[6]

References

[edit]
  1. ^ "Katrina Ligett's personal home page". Hebrew University's Computer Science Department. Retrieved 2023-12-19.
  2. ^ a b Microsoft Research Faculty Fellows 2013
  3. ^ Katrina Ligett at the Caltech Directory
  4. ^ Blum, Avrim; Ligett, Katrina; Roth, Aaron (2008), A learning theory approach to noninteractive database privacy, p. 609, arXiv:1109.2229, doi:10.1145/1374376.1374464, ISBN 9781605580470, S2CID 53039307
  5. ^ Blum, Avrim; Hajiaghayi, Mohammadtaghi; Ligett, Katrina; Roth, Aaron (2008), "Regret minimization and the price of total anarchy", Proceedings of the fortieth annual ACM symposium on Theory of computing - STOC 08, p. 373, CiteSeerX 10.1.1.116.5105, doi:10.1145/1374376.1374430, ISBN 9781605580470, S2CID 12589969
  6. ^ Google Faculty Research Award Recipients
[edit]
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Katrina_Ligett&oldid=1235596156"