University of Southern California

Hamid Nazerzadeh
Assistant Professor of Data Sciences and Operations Management

USC Marshall School of Business
Los Angeles, CA 90089-0808

Phone: 
213-740-0172
Education: 
PhD, Stanford University; BS, Sharif University of Technology

Overview

Hamid Nazerzadeh's research interests include market design, revenue management, and optimization algorithms and his research has been published in journals that include Management Science, Operations Research, and ACM Transactions on Algorithms. He was awarded Yahoo! Ph.D. Student Fellowship and is a recipient of Google Faculty Research Award. Prior to joining USC, he was a post-doctoral researcher at Microsoft, New England Lab. He holds several patents on Internet advertising and cloud computing services.

Research

Candogan, O., Chayes, J., Borgs, C., Lobel, I., and Nazer-Zadeh, H. (2014) "Optimal Multi-Period Pricing with Service Guarantees," Management Science, 60 (7), 792-1811.
Goel, A., and Nazer-Zadeh, H. (2014) "Price Based Protocols For Fair Resource Allocation: Convergence Time Analysis and Extension to Leontief Utilities.," ACM Transactions on Algorithms , 10 (2), 5.
Mirrokni, V., and Nazer-Zadeh, H. (2014) "Deals or no Deals: Designing Contracts for Online Advertising,".
Celis, E., Lewis, G., Mobious, M., and Nazer-Zadeh, H. (2014) "Buy-it-now or Take-a-chance: Price Discrimination through Randomized Auctions," Management Science, 60 (12), 2927-2848.
Kakade, S., Lobel, I., and Nazer-Zadeh, H. (2013) "Optimal Dynamic Mechanism Design and the Virtual Pivot Mechanism," Operations Research, 61 (4), 837-854.
Feige, U., Immorlica, N., Mirrokni, V., and Nazer-Zadeh, H. (2013) "PASS Approximation: A Framework for Analyzing and Designing Heuristics," Algorithmica, 66 (2), 450-478.
Nazer-Zadeh, H., Saberi, A., and Vohra, R. (2013) "Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising," Operations Research, 61 (1), 98-111.
Mahdian, M., Nazer-Zadeh, H., and Saberi, A. (2012) "Online Optimization with Uncertain Information," ACM Transactions on Algorithms , 8 (1).