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 Warren Center postdoc in computer science and economics 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 research interests lie at the intersection of machine learning and economics; I spend a lot of my time thinking about machine learning for mechanism design, algorithmic game theory, privacy, and approximation algorithms. To see my CV, click here.


Vasilis Syrgkanis and I gave a tutorial entitled "Algorithmic Game Theory and Data Science" at EC this year. My slides, along with screenshots of the grand table of results for the sample complexity of learning auctions and some related links, are now online!


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


Ph.D, Market Algorithms: Incentives, Learning, and Privacy (Defended May 2015)
Original CMU Tech Report (Not updated for typos)


FATML 2016Fairness in Linear Bandit Problems. Matthew Joseph, Michael Kearns, Jamie Morgenstern, Seth Neel, and Aaron Roth.
FATML 2016 Fair Learning in Markovian Environments. Shahin Jabbari, Matthew Joseph, Michael Kearns, Jamie Morgenstern, and Aaron Roth.
WINE 2016 Strategic Network Formation with Attack and Immunization Sanjeev Goyal, Shahin Jabbari, Michael Kearns, Sanjeev Khanna, Jamie Morgenstern.arxiv
NIPS 2016 Fairness in Learning: Classic and Contextual Bandits. Matthew Joseph, Michael Kearns, Jamie Morgenstern, and Aaron Roth.arxiv
EC 2016Simple Mechanisms for Agents with Complements Michal Feldman, Ophir Friedler, Jamie Morgenstern, Guy Reinerarxiv
COLT 2016Learning Simple Auctions Jamie Morgenstern, Tim Roughgardenarxiv
STOC 2016Do Prices Coordinate Markets? (short version)Justin Hsu, Jamie Morgenstern, Ryan Rogers, Aaron Roth, Rakesh Vohraarxiv
NIPS 2015 The Pseudo-Dimension of Nearly Optimal Auctions

Selected for a spotlight presentation, along with 3.6% of submissions.

Jamie Morgenstern and Tim Roughgardenarxiv
EC 2015Private Pareto-Optimal ExchangeSampath Kannan, Jamie Morgenstern, Ryan Rogers, and Aaron Rotharxiv
EC 2015Simple Auctions with Simple StrategiesNikhil Devanur, Jamie Morgenstern, Vasilis Syrgkanis, S. Matthew Weinberg
EC 2015Learning What's Going On: Reconstruction Preferences and Priorities from Opaque TransactionsAvrim Blum, Yishay Mansour, Jamie Morgensternarxiv
IJCAI 2015Impartial Peer ReviewDavid Kurokawa, Omer Lev, Jamie Morgenstern, Ariel Procaccia
SODA 2015Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)Sampath Kannan, Jamie Morgenstern, Aaron Roth, Steven Wuarxiv
AAAI 2015Learning Valuation Distributions from Partial ObservationAvrim Blum, Yishay Mansour, Jamie Morgensternarxiv
ITCS 2015Privacy-preserving Public Information in Sequential GamesAvrim Blum, Jamie Morgenstern, Ankit Sharma, Adam Smitharxiv
AAAI 2013How Bad is Selfish Voting?Simina Brânzei, Ioannis Caragiannis, Jamie Morgenstern, Ariel D. Procaccia
COSN 2013 Hierarchical community decomposition via oblivious routing techniques William Sean Kennedy, Jamie Morgenstern, Gordon Wilfong, Lisa Zhang
APPROX 2012Additive Approximation for Near-Perfect Phylogeny ConstructionPranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet
AAAI 2012On Maxsum Fair Cake DivisionsSteven J. Brams, Michal Feldman, John K. Lai, Jamie Morgenstern, Ariel D. Procaccia
STM 2011A proof-carrying File system with Revocable and Use-once Certificates (Conference on Security and Trust Management)Jamie Morgenstern, Deepak Garg, Frank Pfenning
ICFP 2010Security-typed Programming Within Dependently Typed ProgrammingJamie Morgenstern, Dan Licata