Researcher

Nicole Immorlica

Nicole Immorlica is a theoretical computer scientist who applies algorithms and economics to the design of markets and AI systems. At MIT, she earned a BS, MEng, and PhD; she completed postdoctoral work at Microsoft Research and CWI, served on Northwestern's EECS faculty, and joined Microsoft in 2012. Her 2014 pricing paper proposed a revenue mechanism for additive buyers, while a 2024 paper with Brendan Lucier and Aleksandrs Slivkins modeled generative AI as an economic agent. She chaired ACM SIGecom from 2019 to 2023; her 2005 paper with Mohammad Mahdian won SIGecom's 2023 Test of Time Award, and ACM named her a Fellow in 2023. Since 2025, she is a professor of computer science at Yale and a researcher at Microsoft; her Yale work uses game theory to study whether proprietary AI models align with users' intentions.

Born
1978
Works
269
Citations
8,806
h-index
42

Years link to their sources. Publication numbers from OpenAlex, as of 22 October 2026.

Timeline

  1. 2000–2005

    Degrees at MIT

    She earns a BS at MIT in 2000, an MEng there in 2001, and a PhD in theoretical computer science in 2005.

  2. 2005–2013

    Postdocs and Northwestern

    From 2005 to 2007, she completes a postdoc in Microsoft Research's Theory Group; from 2007 to 2008, she is a postdoc in CWI's PNA1 Group. From 2008 to 2013, she serves as an assistant professor of electrical engineering and computer science at Northwestern.

  3. 2012–2025

    Senior Principal Researcher

    She joins Microsoft as a researcher in 2012. Before joining Yale in 2025, she is a Senior Principal Researcher at Microsoft Research New England and leads its Economics and Computation group. Her work uses theoretical computer science and economics to study sociotechnical systems.

  4. 2014

    A mechanism for additive buyers

    In 2014, she coauthors “A Simple and Approximately Optimal Mechanism for an Additive Buyer” with Moshe Babaioff, Brendan Lucier, and S. Matthew Weinberg. It compares separate-item pricing with bundle pricing and achieves a constant-factor approximation to the seller's optimal revenue.

  5. 2019–2023

    SIGecom chair and honors

    She chairs ACM SIGecom from 2019 to 2023. In 2023, her 2005 paper with Mohammad Mahdian, “Marriage, Honesty, and Stability,” wins SIGecom's Test of Time Award, and ACM names her a Fellow.

  6. 2024

    Generative AI as an agent

    With Brendan Lucier and Aleksandrs Slivkins, she coauthors “Generative AI as Economic Agents” in 2024. The paper models each user as paired with an AI agent they can consult before acting in a game; the AI and user may have different information and preferences.

  7. 2026

    A hashing award and AI alignment

    Her 2004 paper with Mayur Datar, Piotr Indyk, and Vahab S. Mirrokni, “Locality-Sensitive Hashing Scheme Based on p-Stable Distributions,” wins the SoCG Test of Time Award in 2026. In 2026, she uses game theory at Yale to study whether proprietary AI models' actions align with users' intentions.

  8. Since 2025

    Professor at Yale

    She joins Yale as a professor of computer science in 2025 and continues as a researcher at Microsoft. In 2026, she is a professor of computer science and economics at Yale.

Career

  1. Since 2025Yale UniversityProfessor of computer science and economics
  2. Since 2012MicrosoftResearcher
  3. Since 2005Microsoft ResearchPostdoctoral researcher
  4. 2008–2013Northwestern UniversityAssistant professor of electrical engineering and computer science
  5. 2007–2008National Research Institute for Mathematics and Computer Science in the NetherlandsPostdoctoral researcher
  6. 2007–2009NWO-I
  7. 2003–2005MIT CSAIL

Education

  1. 2005Massachusetts Institute of TechnologyPhD
  2. 2001Massachusetts Institute of TechnologyMEng
  3. 2000Massachusetts Institute of TechnologyBS

Most-cited works

  1. Locality-sensitive hashing scheme based on p-stable distributions2004 · 2,965 citationsWith Piotr Indyk
  2. Correlation clustering in general weighted graphs2006 · Theoretical Computer Science · 283 citations
  3. Dynamics of bid optimization in online advertisement auctions2007 · International World Wide Web Conference (WWW) · 225 citations
  4. Multi-unit auctions with budget-constrained bidders2005 · ACM Conference on Electronic Commerce (EC) · 221 citations
  5. Matroids, secretary problems, and online mechanisms2007 · 208 citationsWith Robert Kleinberg

Sources and credits

Photo: We have no published photo of Nicole Immorlica yet. Send us a free-licensed photo.

  1. Nicole Immorlica at Microsoft Research microsoft.com. Checked 21 October 2026.
  2. About immorlica.com. Checked 21 October 2026.
  3. Advancing the Field of CS+Economics mccormick.northwestern.edu. Checked 21 October 2026.
  4. Yale Engineering welcomes five new faculty members engineering.yale.edu. Checked 21 October 2026.
  5. A Simple and Approximately Optimal Mechanism for an Additive Buyer arxiv.org. Checked 21 October 2026.
  6. ACM SIGecom: Officers sigecom.org. Checked 21 October 2026.
  7. ACM SIGecom: Test of Time Award sigecom.org. Checked 21 October 2026.
  8. Nicole Immorlica at Microsoft Research: News & Awards microsoft.com. Checked 21 October 2026.
  9. Generative AI as Economic Agents arxiv.org. Checked 21 October 2026.
  10. Computational Geometry awards computational-geometry.org. Checked 21 October 2026.
  11. Can we trust AI models? Yale researchers explore the roots of chatbot errors news.yale.edu. Checked 21 October 2026.