3 citations · 5 across the 2 of their papers we have counts for
4 papers
Optimizing Inventory Placement for a Downstream Online Matching Problem
Boris Epstein, Will Ma
We study the inventory placement problem of splitting units of a single item across warehouses in advance of a downstream online matching problem that represents the dynamic fu…
Selection and Ordering Policies for Hiring Pipelines via Linear Programming
Boris Epstein, Will Ma
Motivated by hiring pipelines, we study three selection and ordering problems in which applicants for a finite set of positions must be interviewed or sent offers. There is a finit…
Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality
José Correa, Andrés Cristi, Boris Epstein +1
We take a unifying approach to single selection optimal stopping problems with random arrival order and independent sampling of items. In the problem we consider, a decision maker…
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
José Correa, Andrés Cristi, Boris Epstein +1
The secretary problem or the game of Googol are classic models for online selection problems that have received significant attention in the last five decades. We consider a varian…