-
作者：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...
-
作者：Hall, Georgina; Massoulie, Laurent
作者单位：INSEAD Business School; Inria
摘要：In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known graph isomorphism problem and appears in many applications, including social network deanonymization and cellular biology. Our focus here is on partial recovery; that is, we look for a one-to-one mapping that is correct on a fraction of the nodes of the graph ...
-
作者：Bendotti, Pascale; Chretienne, Philippe; Fouilhoux, Pierre; Pass-Lanneau, Adele
作者单位：Electricite de France (EDF); Centre National de la Recherche Scientifique (CNRS); Sorbonne Universite
摘要：In project scheduling with uncertain processing times, the decision maker often needs to compute a baseline schedule in advance while guaranteeing that some jobs will not be rescheduled later. Standard robust approaches either produce a schedule with a very large makespan or offer no guarantee on starting times of the jobs. The concept of anchor-robustness is introduced as a middle ground between these approaches. A subset of jobs is said to be anchored if the starting times of its jobs in the...
-
作者：Dogan, Serhat; Yildiz, Kemal
作者单位：Ihsan Dogramaci Bilkent University
摘要：We consider an agent who is endowed with two sets of orderings: pro-and con orderings. For each choice set, if an alternative is the top-ranked by a pro-ordering (con-ordering), then this is a pro (con) for choosing that alternative. The alternative with more pros than cons is chosen from each choice set. Each ordering may have a weight reflecting its salience. In this case, the probability that an alternative is chosen equals the difference between the total weights of its pros and cons. We s...
-
作者：Bachmat, Eitan; Erland, Sveinung; Jaehn, Florian; Neumann, Simone
作者单位：Ben-Gurion University of the Negev; Simons Foundation; Western Norway University of Applied Sciences; Helmut Schmidt University
摘要：Managerial optimization challenges in service industries often entail the need to ensure customer satisfaction. For example, in airplane boarding, the boarding time should be minimized, but to ensure customer satisfaction, the process must not be too stressful for passengers. However, many authors assume that total boarding time minimization and customer satisfaction are complementary goals, even though there is little empirical knowledge on the topic. We challenge this assumption and contend ...
-
作者：Cao, Yufeng; Rusmevichientong, Paat; Topaloglu, Huseyin
作者单位：Shanghai Jiao Tong University; University of Southern California
摘要：We consider assortment optimization problems when customers choose under a mixture of independent demand and multinomial logit models. In the assortment optimization setting, each product has a fixed revenue associatedwith it. The customers choose among the products according to our mixture choice model. The goal is to find an assortment that maximizes the expected revenue from a customer. We show that we can find the optimal assortment by solving a linear program. We establish that the optima...
-
作者：Mazumder, Rahul; Radchenko, Peter; Dedieuc, Antoine
作者单位：Massachusetts Institute of Technology (MIT); University of Sydney
摘要：We study a seemingly unexpected and relatively less understood overfitting aspect of a fundamental tool in sparse linear modeling-best subset selection-which minimizes the residual sum of squares subject to a constraint on the number of nonzero coefficients. Whereas the best subset selection procedure is often perceived as the gold standard in sparse learning when the signal-to-noise ratio (SNR) is high, its predictive performance deteriorates when the SNR is low. In particular, it is outperfo...
-
作者：Lim, Eunji; Glynn, Peter W.
作者单位：Adelphi University; Stanford University
摘要：This paper is concerned with the use of simulation in computing predictors in settings in which real-world observations are collected. A major challenge is that the state description underlying the simulation will typically include information that is not observed in the real system. This makes it challenging to initialize simulations that are aligned with the most recent observation collected in the real-world system, especially when the simulation does not visit the most recently observed va...
