-
作者：Lingenbrink, David; Iyera, Krishnamurthy
作者单位：Cornell University
摘要：We consider the problem of optimal information sharing in an unobservable single-server queue offering service at a fixed price to a Poisson arrival of delay-sensitive customers. The service provider observes the queue and may share state information with arriving customers. The customers, who are Bayesian and strategic, incorporate this information into their beliefs before deciding whether to join the queue. We pose the following question: Which signaling mechanism should the service provide...
-
作者：Nagarajan, Mahesh; Sosic, Greys; Tong, Chunyang
作者单位：University of British Columbia; University of Southern California; Tongji University
摘要：Stable alliance structures among critical (monopoly) component suppliers in a decentralized assembly system are somewhat well understood. However, when there are competing suppliers for any particular component, less is known about such alliances. The intent of this paper is to address some of the theoretical issues that pose challenges in analyzing stable supplier coalitions in such assembly systems. We examine a simple assembly system in which suppliers sell n distinct complementary componen...
-
作者：Solak, Senay; Bayram, Armagan; Gumus, Mehmet; Zhuo, Yueran
作者单位：University of Massachusetts System; University of Massachusetts Amherst; McGill University
摘要：A dramatic increase in U.S. mortgage foreclosures during and after the great economic recession of 2007-2009 had devastating impacts on the society and the economy. In response to such negative impacts, nonprofit community development corporations (CDCs) throughout the United States use various resources, such as grants and lines of credit, in acquiring and redeveloping foreclosed housing units to support neighborhood stabilization and revitalization. Given that the cost of all such acquisitio...
-
作者：Song, Eunhye; Nelson, Barry L.
作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park; Northwestern University
摘要：When input distributions to a simulation model are estimated from real-world data, they naturally have estimation error causing input uncertainty in the simulation output. If an optimization via simulation (OvS) method is applied that treats the input distributions as correct, then there is a risk of making a suboptimal decision for the real world, which we call input model risk. This paper addresses a discrete OvS (DOvS) problem of selecting the real-world optimal from among a finite number o...
-
作者：Whitt, Ward; Zhang, Xiaopei
作者单位：Columbia University
摘要：Motivated by our recent study of patient flow data from an Israeli emergency department (ED), we establish a sample path periodic Little's law (PLL), which extends the sample path Little's law (LL). The ED data analysis led us to propose a periodic stochastic process to represent the aggregate ED occupancy level, with the length of a periodic cycle being 1 week. Because we conducted the ED data analysis over successive hours, we construct our PLL in discrete time. The PLL helps explain the rem...
-
作者：Braverman, Anton; Dai, J. G.; Liu, Xin; Ying, Lei
作者单位：Northwestern University; Cornell University; The Chinese University of Hong Kong, Shenzhen; Shenzhen Research Institute of Big Data; The Chinese University of Hong Kong, Shenzhen; Arizona State University; Arizona State University-Tempe
摘要：This paper considers a closed queueing network model of ridesharing systems, such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car flow in the network to optimize system-wide utility functions, for example, the availability of empty cars when a passenger arrives. We establish both process-level and steady-state convergence of the queueing network to a fluid limit in a large market regime where demand for rides and supply of cars tend to infini...
-
作者：Davarnia, Daniel; Richard, Jean-Philippe P.; Icyuz-Ay, Ece; Taslimi, Bijan
作者单位：Iowa State University; Iowa State University; University of Minnesota System; University of Minnesota Twin Cities; State University System of Florida; University of Florida
摘要：We study network models where flows cannot be split or merged when passing through certain nodes (i.e., for such nodes, each incoming arc flow must be matched to an outgoing arc flow of identical value). This requirement, which we call no-split no-merge (NSNM), appears in railroad applications in which train compositions can only be modified at yards where necessary equipment is available. This combinatorial requirement is crucial when formulating problems occurring in the unit train business....
-
作者：Ata, Baris; Lee, Deishin; Sonmez, Erkut
作者单位：University of Chicago; Western University (University of Western Ontario); University of Nebraska System; University of Nebraska Lincoln
摘要：Gleaning programs organize volunteer gleaners to harvest a variety of leftover crops that are donated by farmers for the purpose of feeding food-insecure individuals. Thus, the gleaning process simultaneously reduces food waste and food insecurity. However, the operationalization of this process is challenging because gleaning relies on two uncertain sources of input: the food and labor supplies. The purpose of this paper is to help gleaning organizations increase the (value-weighted) volume o...
-
作者：Feldman, Jacob; Paul, Alice; Topaloglu, Huseyin
作者单位：Washington University (WUSTL); Brown University
摘要：We study a customer choice model that captures purchasing behavior when there is a limit on the number of times that a customer will substitute among the offered products. Under this model, we assume each customer is characterized by a ranked preference list of products and, upon arrival, will purchase the highest ranking offered product. Because we restrict ourselves to settings in which customers consider a limited number of products, we assume that these rankings contain at most k products....
-
作者：Bertsimas, Dimitris; Korolko, Nikita; Weinstein, Alexander M.
作者单位：Massachusetts Institute of Technology (MIT)
摘要：The decision of how to allocate subjects to treatment groups is of great importance in experimental clinical trials for novel investigational drugs, a multibillion-dollar industry. Statistical power, the ability of an experiment to detect a positive treatment effect when one exists, depends in part on the similarity of the groups in terms of measurable covariates that affect the treatment response. We present a novel algorithm for online allocation that leverages robust mixed-integer optimizat...
