Given an input graph Gin =(V,E_in), we consider the problem of designing a sparse subgraph G = (V, E) with E ⊆ E_in that supports a large matching after some nodes in V are randomly deleted. We study three families of sparse graph designs (namely, Clusters, Rings, and Erdős-Rényi graphs) and...

As consumers are offered an ever-increasing number of options for almost every purchase decision in online retail, understanding the impact of assortment size on consumer choice decisions––especially on both search and purchase behavior––is critical. Our research speaks to this question...

With the increasing availability of data, the adoption of algorithms has become almost a necessity for businesses. Since algorithms often require human involvement, understanding how humans perceive algorithms is instrumental to the success of algorithm design in operations. In particular, the...

Conventional optimization algorithms that prescribe order packing instructions (which items to pack in which sequence in which box) focus on box volume utilization yet tend to overlook human behavioral deviations. We observe that packing workers at the warehouses of Alibaba Group deviate from...