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.
Funding 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.
Impartial Peer Review
David Kurokawa, Omer Lev Jamie Morgenstern, Ariel
Privacy-preserving Public Information in Sequential Games
Avrim Blum, Jamie Morgenstern,
Ankit Sharma, Adam Smith.
Nikhil Devanur, Jamie Morgenstern,
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?
Simina Branzei, Ioannis Carragianis, Jamie Morgenstern,
and Ariel D. Procaccia.
On Maxsum Fair Cake Divisions.
Steven J. Brams, Michal Feldman, Jamie Morgenstern, John K. Lai, and Ariel D. Procaccia.
An Algorithm with Additive Error for Near-Perfect Phylogeny Construction.
Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or
A Proof-Carrying Filesystem with Revocable and Use-Once Certificates.
Jamie Morgenstern, Deepak Garg and Frank
within Dependently-Typed Programming.(ICFP'10)
Jamie Morgenstern, Daniel
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.