Jamie Morgenstern

Ph.D. Student in the Computer Science Department
School of Computer Science
Carnegie Mellon University
Office: 9221 Gates Hillman Center
Email: 'jamiemmt' at 'cs' dot 'cmu' dot 'edu'

I am a computer science PhD student at Carnegie Mellon University. My advisor is Avrim Blum. I am generally interested in theory, specifically mechanism design, algorithmic game theory, privacy, and approximation algorithms. I spent the summer of 2012 at Alcatel-Lucent Labs. For the summer of 2013, I worked with Nikhil Devanur at Microsoft Research Redmond.


I am fortunate to be supported by the Simons Award for Graduate Students in Theoretical Computer Science for 2014-2016. Previously, I was supported by an NSF GFRP fellowship, as well as the Microsoft Research Graduate Women's Scholarship.

Curriculum Vitae



  • Private Pareto Optimal Exchange   arXiv
  • Sampath Kannan, Jamie Morgenstern, Ryan Rogers, Aaron Roth.

  • Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)   arXiv
  • Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiewei Steven Wu.

  • Learning Valuation Distributions from Partial Observation   arXiv
  • Avrim Blum, Yishay Mansour, Jamie Morgenstern.

  • Privacy-preserving Public Information in Sequential Games   arXiv
  • Avrim Blum, Jamie Morgenstern, Ankit Sharma, Adam Smith.

  • Building Consensus with Balanced Splits
  • Avrim Blum, Jamie Morgenstern, R. Ravi, Santosh Vempala.

  • Impartial Peer Review
  • David Kurokawa, Omer Lev Jamie Morgenstern, Ariel Procaccia.

  • Draft Auctions arXiv
  • Nikhil Devanur, Jamie Morgenstern, Vasilis Syrgkanis.

  • Hierarchical Community Decomposition Via Oblivious Routing Techniques (Conference on Social Networks (COSN) '13)
  • William Sean Kennedy, Jamie Morgenstern, Gordon Wilfong, Lisa Zhang.

  • How Bad is Selfish Voting? (AAAI'13)
  • Simina Branzei, Ioannis Carragianis, Jamie Morgenstern, and Ariel D. Procaccia.

  • On Maxsum Fair Cake Divisions. (AAAI'12)
  • Steven J. Brams, Michal Feldman, Jamie Morgenstern, John K. Lai, and Ariel D. Procaccia.

  • An Algorithm with Additive Error for Near-Perfect Phylogeny Construction. (APPROX '12)
  • Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet.

  • A Proof-Carrying Filesystem with Revocable and Use-Once Certificates. (STM'11)
  • Jamie Morgenstern, Deepak Garg and Frank Pfenning. code

  • Security-Typed Programming within Dependently-Typed Programming.(ICFP'10)
  • Jamie Morgenstern, Daniel Licata. code



    I was the instructor for 15122, Principles of Imperative Programming, for summer 2012.


    I also like to run. Here are a few recent race results.