3 citations · 5 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
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…
cs.DS2022★ 2 cited
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…
cs.DS2019
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…