-
作者：Gallino, Santiago; Karacaoglu, Nil; Moreno, Antonio
作者单位：University of Pennsylvania; University System of Ohio; Ohio State University; Harvard University
摘要：The impact of delays has been widely studied in various offline services. The focus of this study is online services, andwe explore the impact of in-process delays-measured by website speed-on customer behavior. We leverage novel retail and website speed data to investigate how delays impact online sales and how customer sensitivity to in-process delays varies across the different stages of a customer's shopping journey. We estimate sizable adverse effects of website slowdowns on online sales....
-
作者：Zhang, Can; Ayer, Turgay; White, Chelsea C.; Bodeker, Joy N.; Roback, John D.
作者单位：Duke University; University System of Georgia; Georgia Institute of Technology; Emory University; Emory University
摘要：Platelets are critical blood products. The management of platelet inventory is particularly challenging because of its perishable nature with a short shelf life. Motivated by a platelet inventory management problem at a two-location hospital system, we study how the wastage of platelets and, more broadly, perishable products can be reduced through inventory sharing. In particular, we consider a system with two locations and a single product (e.g., a two-hospital system sharing blood products, ...
-
作者：Petra, Cosmin G.; Aravena, Ignacio
作者单位：United States Department of Energy (DOE); Lawrence Livermore National Laboratory
摘要：We present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E's Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account...
-
作者：Ararat, Cagin; Meimanjan, Nurtai
作者单位：Ihsan Dogramaci Bilkent University; Vienna University of Economics & Business
摘要：Systemic risk is concerned with the instability of a financial system whose members are interdependent in the sense that the failure of a few institutions may trigger a chain of defaults throughout the system. Recently, several systemic risk measures have been proposed in the literature that are used to determine capital requirements for the members subject to joint risk considerations. We address the problem of computing systemic risk measures for systems with sophisticated clearing mechanism...
-
作者：Kunnumkal, Sumit
作者单位：Indian School of Business (ISB)
摘要：We consider the cardinality-constrained assortment optimization problem under the nested logit model where there is a constraint that limits the number of products that can be offered within each nest. The problem is known to be intractable if the nest dissimilarity parameters are larger than one or there is a no-purchase alternative within each nest. Although these conditions often come up in practice, the existing solution approaches cannot handle them. We propose a solution method to obtain...
-
作者：Chen, Ningyuan; Gao, Pin; Kou, Steven
作者单位：University of Toronto; The Chinese University of Hong Kong, Shenzhen; Shenzhen Institute of Artificial Intelligence & Robotics for Society; Boston University
摘要：The order protect rule (OPR) in the United States generally prohibits any trade through, that is, a market order that is not executed at the best possible price among fast (electronic and automated) trading venues. By deriving upper and lower bounds for the difference in the execution costs in a dynamic model, we find that, although trade-through allows for flexible trading strategies and may benefit the liquidity demander, the benefit is insignificant in most cases, especially for small trade...
-
作者：Duchi, John; Hashimoto, Tatsunori; Namkoong, Hongseok
作者单位：Stanford University; Stanford University; Stanford University; Columbia University
摘要：While modern large-scale data sets often consist of heterogeneous subpopulations-for example, multiple demographic groups or multiple text corpora-the standard practice of minimizing average loss fails to guarantee uniformly low losses across all sub-populations. We propose a convex procedure that controls the worst case performance over all subpopulations of a given size. Our procedure comes with finite-sample (nonparametric) convergence guarantees on the worst-off subpopulation. Empirically,...
-
作者：Nakahira, Yorie; Ferragut, Andres; Wierman, Adam
作者单位：Carnegie Mellon University; University ORT Uruguay; California Institute of Technology
摘要：Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, unpredictability and instability in service capacity often incur operational and infrastructural costs. In this paper, we seek to characterize optimal distributed algorithms that maximize the predictability, stability, or both when scheduling jobs with deadlines. Specifically, we show that Exact Scheduling minimizes both the stationary mean and variance of the service...
-
作者：Hmedi, Hassan; Arapostathis, Ari; Pang, Guodong
作者单位：University of Texas System; University of Texas Austin; Rice University
摘要：We introduce a system-wide safety staffing (SWSS) parameter for multiclass multipool networks of any tree topology, Markovian or non-Markovian, in the Halfin-Whitt regime. This parameter can be regarded as the optimal reallocation of the capacity fluctuations (positive or negative) of order root n when each server pool uses a square-root staffing rule. We provide an explicit formof the SWSS as a function of the systemparameters, which is derived using a graph theoretic approach based on Gaussi...
-
作者：Benjaafar, Saif; Shen, Xiaobing
作者单位：University of Minnesota System; University of Minnesota Twin Cities
摘要：We consider the dynamic pricing problem that arises in the context of an on demand vehicle sharing system with one-way trips. Existing results show that a static pricing policy that arises from solving a maximum flow relaxation of the problem guarantees a performance ratio that is bounded by K/(N+ K-1) when travel times are negligible and by root ffiffififfi 1 O(1/ K ) otherwise, where K is the number of vehicles and N is the number of locations. In this paper, we build on these results by pro...
