-
作者：Jin, Ying; Ren, Zhimei; Zhou, Zhengyuan
作者单位：University of Pennsylvania; New York University
摘要：The growing availability of observational data has ushered in an exciting new era of personalized data-driven decision making. A key impediment to this vision is that observational data are generally prone to unobserved confounding, so inferential schemes that assume it away-as is often done in the literature-are inadequate. In this paper, we introduce the f-sensitivity model, which characterizes the violation of unconfoundedness by assuming that the selection bias because of unmeasured confou...
-
作者：Chen, Yilun; Kanoria, Yash; Kumar, Akshit; Zhang, Wenxin
作者单位：The Chinese University of Hong Kong, Shenzhen; Columbia University; Yale University
摘要：Motivated by matching platforms that match agents in a centralized manner, we study dynamic two-sided matching in a setting where both customers (demand) and service providers (supply) are heterogeneous and the pool of service providers is limited. We model heterogeneity on the two sides of the market by demand weight vectors drawn independently and identically distributed (i.i.d.) from some distribution and supply feature vectors drawn i.i.d. from a (possibly) different distribution. The matc...
-
作者：Winschermann, Leoni; Antoniadis, Antonios; Gerards, Marco E. T.; Hoogsteen, Gerwin; Hurink, Johann
作者单位：University of Twente
摘要：Because of the ongoing electrification of transport in combination with limited power grid capacities, efficient ways to schedule the charging of electric vehicles (EVs) are needed for the operation of, for example, large parking lots. Common approaches such as model predictive control repeatedly solve a corresponding offline problem. In this work, we first present and analyze the flow-based offline charging scheduler (FOCS), an offline algorithm to derive an optimal EV charging schedule for a...
-
作者：Huh, Woonghee Tim; Paat, Joseph; Queyranne, Maurice
作者单位：University of British Columbia
摘要：We study a dynamic assortment optimization problem over a finite selling horizon with exogenously fixed initial inventory for multiple products. The manager offers an assortment in each period. The assortment cannot depend on arriving customer types because the manager does not see the customer type before making the assortment decision and thus cannot treat customer types differently. Focusing on an online setting where all products have the same price, we show a competitive ratio cannot be h...
-
作者：Mendelson, Gal; Kuang, Xu
作者单位：Technion Israel Institute of Technology; Stanford University
摘要：Load balancing across parallel servers is an important class of congestion control problems that arise in service systems. An effective load balancer relies heavily on accurate, real-time congestion information to make routing decisions. However, obtaining such information can impose significant communication overheads, especially in demanding applications such as those found in modern data centers. We introduce a framework for communication-aware load balancing and design new load balancing a...
-
作者：Yu, Man; Zheng, Shaohui; Chen, Jiguang
作者单位：Hong Kong University of Science & Technology; Xiamen University
摘要：This paper characterizes joint order fulfillment and inventory policies for assemble-to-order generalized W systems, in which k products are assembled from a common component and k product-specific (dedicated) components. We consider a periodicreview system and focus on nested fulfillment policies, in which orders are fulfilled in decreasing order of profit margins. We prove that the optimal fulfillment policy of a twoproduct W system is nested. For systems with more than two products, althoug...
-
作者：Benade, Gerdus; Halpern, Daniel; Psomas, Alexandros
作者单位：Boston University; Harvard University; Purdue University System; Purdue University
摘要：We consider the fundamental problem of fairly and efficiently allocating T indivisible items among n agents with additive preferences. Items become available over a sequence of rounds, and every item must be allocated immediately and irrevocably before the next one arrives. Previous work shows that when the agents' valuations for the items are drawn from known distributions, it is possible (under mild assumptions) to find allocations that are envy-free with high probability and Pareto efficien...
-
作者：Angelopoulos, Spyros; Lidbetter, Thomas; Panagiotou, Konstantinos
作者单位：Centre National de la Recherche Scientifique (CNRS); Rutgers University System; Rutgers University Newark; Rutgers University New Brunswick; University of Munich
摘要：We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, or prediction, on the Hider's position. The objective is to establish tight tradeoffs between the consistency of a search strategy (i.e., its worst-case expected payoff assuming the prediction is correct) and its robustness (i.e., the worst-case expected payoff without any assumptions on the quality of the prediction). Our stu...
-
作者：You, Zhengzhong; Yang, Yu; Wang, Xinshang; Yin, Wotao
作者单位：State University System of Florida; University of Florida; State University System of Florida; University of Florida
摘要：Branching is one of the most important components in branch-price-and-cut (BPC) algorithms for solving vehicle routing problems (VRPs) exactly. However, learning to branch is much more challenging in BPC than in branch-and-cut algorithms that are used for solving general mixed integer programs because branching, in this case, is generally performed by adding a dense constraint to the restricted master problem (RMP), and meanwhile, the variables in the RMP change constantly. To address such cha...
-
作者：Chen, Zhuoxin; Ma, Will
作者单位：Tsinghua University; Columbia University; Columbia University
摘要：In the newsvendor problem, the goal is to guess the number that will be drawn from some distribution, with asymmetric consequences for guessing too high versus too low. In the data-driven version, the distribution is unknown, and one must work with samples from the distribution. The data-driven newsvendor problem has been studied under many variants: additive versus multiplicative regret, high-probability versus expectation bounds, and different distribution classes. This paper studies all com...
