Research Experience

Ongoing Projects:

• Fundraising for Education: Optimizing Crowdfunding Platforms
  with Rad Niazadeh (Chicago Booth)

Working Papers:

• Optimal Bayesian Online Allocation of Reusable Resources
  Generalized classical online resource allocation theory to the reusable setting by developing a time-invariant admission policy that guarantees ex-post feasibility and matches the information-theoretic tight bounds of non-reusable models
  with Rad Niazadeh (Chicago Booth), Pranav Nuti (Chicago Booth)

• Stationary Online Contention Resolution Schemes
  Created the S-OCRS framework to unify the design of online selection algorithms, achieving optimal selectability and resolving open problems across various feasibility environments, like matchings and matroids
  with Rad Niazadeh (Chicago Booth), Pranav Nuti (Chicago Booth)

• Real-Time Personalized Order Holding
  Designing practical approximation algorithms for the online order holding problem to enjoy the benefits of catching cancellations and multiorder consolidations
  with Will Ma (Columbia GSB) and Linwei Xin (Chicago Booth)
  Major at Management Science

  • Featured in Chicago Booth Review:
    At the E-Commerce Warehouse, a Distribution Dilemma
    How E-commerce Platforms Should Deal with Your Multiple Orders

Publications:

• Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring
  Incorporating ex-ante constraints in different aspects and variations of the sequential search problem
  with Vahideh Manshadi (Yale SOM) and Rad Niazadeh (Chicago Booth)
  Accepted at Management Science, EAAMO 2024
  • Featured in Chicago Booth Review:
    Algorithms and AI Can Make Hiring More Diverse
  • Third Place, IBM Service Science Best Student Paper Award — INFORMS Annual Meeting 2023