Jamie Morgenstern

Warren Center Postdoctoral Fellow in the Computer Science Department
University of Pennsylvania
Office: 321 Levine Hall
Email: 'jamiemmt' at 'cs' dot 'cmu' dot 'edu'


I am a postdoc in computer science at the University of Pennsylvania, and am fortunate to be hosted by Michael Kearns, Aaron Roth, and Rakesh Vohra. I recently completed my PhD working with Avrim Blum at Carnegie Mellon University. My interests, generally speaking, lie within the area of theoretical computer science; more specifically, I spend a lot of my time thinking about mechanism design, learning, algorithmic game theory, privacy, and approximation algorithms. To see my CV, click here.

Funding

I was 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.

Working papers

The Pseudo-Dimension of Nearly-Optimal Auctions
Jamie Morgenstern and Tim Roughgarden. Working Paper, June 2015. arXiv

Building Consensus from Balanced Splits
Avrim Blum, Jamie Morgenstern, R. Ravi and Santosh Vempala. Working Paper, June 2014.

Publications

Teaching

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

Misc.

I also like to run. Here are some kinda-recent race results.