Nick ArnostiAssistant Professor, Department of Industrial and Systems Engineering
- Outstanding Program Committee Member (EC 2018)
- 2015 Google PhD Fellowship.
- 2014 Lieberman-Danzig Fellowship.
- Williams College Goldberg Scholar (2011)
- Witte Problem Solving Prize in Mathematics (2010, 2011)
- Williams Class of 1960’s Scholar (2010, 2011)
- Top 200 in Putnam Exam (2009, 2010)
Arnosti, N., “Greedy Matching in Bipartite Random Graphs,” forthcoming in Stochastic Systems.
N. Arnosti and T. Randolph. "Parallel Lotteries: Insights from Alaskan Hunting Permit Allocation," forthcoming in Management Science.
N. Arnosti, and S.M. Weinberg. "Bitcoin: A Natural Oligopoly," forthcoming in Management Science. Extended Abstract in Innovations in Theoretical Computer Science (ITCS) 2019.
N. Arnosti. "Greedy Matching in Bipartite Random Graphs," forthcoming in Stochastic Systems.
N. Arnosti, R. Johari and Y. Kanoria. "Managing Congestion in Matching Markets," Manufacturing & Service Operations Management (MSOM), 2021. Extended Abstract in ACM Conference on Economics and Computation (EC), 2014.
N. Arnosti and P. Shi. "Design of Lotteries and Waitlists for Affordable Housing Allocation," Management Science, 2020.
N. Arnosti and P. Shi. "How (Not) to Allocate Affordable Housing," AEA Papers and Proceedings, January 2019. Extended Abstract in ACM Conference on Economics and Computation (EC), 2017.
N. Arnosti, M. Beck, and P. Milgrom. "Adverse Selection and Auction Design for Internet Display Advertising," American Economic Review (AER), October 2016. Extended Abstract in ACM Conference on Economics and Computation (EC), 2015.
N. Arnosti, and J. Kalita. "Cutting Plane Training for Linear Support Vector Machines," IEEE Transactions on Knowledge and Data Engineering (TKDE), 2013.
N. Arnosti, R. Karpman, C. Leverson, J. Levinson, and S. Loepp. "Semi-Local Formal Fibers of Minimal Prime Ideals of Excellent Reduced Local Rings," Journal of Commutative Algebra, Vol. 4, No. 1, 2012.