-
作者：Fan, Jianqing; Lou, Zhipeng; Wang, Weichen; Yu, Mengxin
作者单位：Princeton University; University of California System; University of California San Diego; University of Hong Kong; Washington University (WUSTL)
摘要：This paper studies the performance of the spectral method in the estimation and uncertainty quantification of the unobserved preference scores of compared entities in a general and more realistic setup. Specifically, the comparison graph consists of hyperedges of possible heterogeneous sizes, and the number of comparisons can be as low as one for a given hyper-edge. Such a setting is pervasive in real applications, circumventing the need to specify the graph randomness and the restrictive homo...
-
作者：Soh, Seung Bum; Gurvich, Itai
作者单位：Yonsei University; Northwestern University
摘要：Staffing problems are often formulated as satisfization problems, in which the cost of servers is minimized subject to quality of service constraints. These constraints indirectly capture customers' disutility from waiting or, at least, its structure. For the problem of staffing a single-class M/M/N queue with an average speed of answer (ASA) constraint, any work-conserving policy is optimal; the problem's formulation is, in that sense, ambiguous. One optimal solution is consistent with convex...
-
作者：Ozel, Aysu; Smilowitz, Karen; Goldstein, Lila K. S.
作者单位：Northwestern University
摘要：Comprehensive community engagement in public school district design is essential to create equitable and effective enrollment policies reflective of community needs and values. We revisit the school district design problem with a focus on codesigning with community partners. We introduce a new compact formulation that incorporates multiple decisions simultaneously by assigning students in each geographic unit to a set of schools (e.g., elementary, middle, and high schools, and schools with spe...
-
作者：Feinstein, Zachary; Hey, Niklas; Rudloff, Birgit
作者单位：Stevens Institute of Technology; Vienna University of Economics & Business
摘要：In Feinstein and Rudloff (2023), it was shown that the set of Nash equilibria for any noncooperative N player game coincides with the set of Pareto optimal points of a certain vector optimization problem with nonconvex ordering cone. To avoid dealing with a nonconvex ordering cone, an equivalent characterization of the set of Nash equilibria as the intersection of the Pareto optimal points of N multi-objective problems (i.e., with the natural ordering cone) is proven. So far, algorithms to com...
-
作者：Chen, Ningyuan; Wang, Chun; Wang, Longlin
作者单位：University of Toronto; University Toronto Mississauga; University of Toronto; Tsinghua University; Harvard University
摘要：A standard assumption adopted in the multiarmed bandit (MAB) framework is that the mean rewards are constant over time. This assumption can be restrictive in the business world as decision makers often face an evolving environment in which the mean rewards are time-varying. In this paper, we consider a nonstationary MAB model with K arms whose mean rewards vary over time in a periodic manner. The unknown periods can be different across arms and scale with the length of the horizon T polynomial...
-
作者：Escribe, Celia; Hu, Michael; Levi, Retsef
作者单位：Massachusetts Institute of Technology (MIT); Harvard University; Harvard University Medical Affiliates; Massachusetts General Hospital; Massachusetts Institute of Technology (MIT)
摘要：This paper describes a fundamental online scheduling problem called the minimum peak job scheduling (MPJS) problem. In this problem, there is a sequence of arriving jobs, each with a specified required scheduled time for one unit of a scarce and reusable resource. The goal is to schedule each job upon arrival within a scheduling interval to minimize the resulting peak utilization (i.e., the maximum number of units used simultaneously throughout the entire scheduling interval). The MPJS problem...
-
作者：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...
