Research Experience

Ongoing Projects:

• Fundraising for Education: Optimizing Crowdfunding Platforms
  Design dynamic assortment policies for crowdfunding platforms to prevent “project starvation” and maximize the value of fully funded campaigns.
  with Rad Niazadeh (Chicago Booth)

Working Papers:

• Optimal Bayesian Online Allocation of Reusable Resources
  Generalize 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
  Create 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)

• Online Job Selection: Reward Rate vs. Remaining Value (formerly Real-Time Personalized Order Holding)
  Introduce an online resource allocation framework and index-based policies with theoretical guarantees to optimize the trade-off between keeping an ongoing job to harvest its remaining value vs. preempting it to serve a new request in limited capacity systems.
  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
  Design socially-responsible sequential search framework for algorithmic hiring and resource allocation. Develop dual-adjusted index policies and primal-dual algorithms to satisfy ex-ante constraints efficiently.
  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