-
作者：Broder, Josef; Rusmevichientong, Paat
作者单位：Cornell University; University of Southern California
摘要：We consider a stylized dynamic pricing model in which a monopolist prices a product to a sequence of T customers who independently make purchasing decisions based on the price offered according to a general parametric choice model. The parameters of the model are unknown to the seller, whose objective is to determine a pricing policy that minimizes the regret, which is the expected difference between the seller's revenue and the revenue of a clairvoyant seller who knows the values of the param...
-
作者：Chen, Li; Lee, Hau L.
作者单位：Duke University; Stanford University
摘要：The bullwhip effect, or demand information distortion, has been a subject of both theoretical and empirical studies in the operations management literature. In this paper, we develop a simple set of formulas that describe the traditional bullwhip measure as a combined outcome of several important drivers, such as finite capacity, batch-ordering, and seasonality. Our modeling framework is descriptive in nature as it features certain plausible approximations that are commonly employed in practic...
-
作者：Fischetti, Matteo; Monaci, Michele; Salvagnin, Domenico
作者单位：University of Padua
摘要：We address the exact solution of the famous esc instances of the quadratic assignment problem. These are extremely hard instances that remained unsolved-even allowing for a tremendous computing power-by using all previous techniques from the literature. During this challenging task we found that three ideas were particularly useful and qualified as a breakthrough for our approach. The present paper is about describing these ideas and their impact in solving esc instances. Our method was able t...
-
作者：Chun, So Yeon; Shapiro, Alexander; Uryasev, Stan
作者单位：Georgetown University; University System of Georgia; Georgia Institute of Technology; State University System of Florida; University of Florida
摘要：We discuss linear regression approaches to the estimation of law-invariant conditional risk measures. Two estimation procedures are considered and compared; one is based on residual analysis of the standard least-squares method, and the other is in the spirit of the M-estimation approach used in robust statistics. In particular, value-at-risk and average value-at-risk measures are discussed in detail. Large sample statistical inference of the estimators is derived. Furthermore, finite sample p...
-
作者：Gurvich, Itai; Perry, Ohad
作者单位：Northwestern University; Northwestern University
摘要：Motivated by call center cosourcing problems, we consider a service network operated under an overflow mechanism. Calls are first routed to an in-house (or dedicated) service station that has a finite waiting room. If the waiting room is full, the call is overflowed to an outside provider (an overflow station) that might also be serving overflows from other stations. We establish approximations for overflow networks with many servers under a resource-pooling assumption that stipulates, in our ...
-
作者：Huh, Woonghee Tim; Janakiraman, Ganesh
作者单位：University of British Columbia; University of Texas System; University of Texas Dallas
摘要：We study a periodically reviewed multiechelon inventory system in series such that order quantities at every stage have to be multiples of a given stage-specific batch size. The batch sizes are nested in the sense that the batch size for every stage is an integer multiple of the batch size for its downstream stage. The problem is that of determining the policy that minimizes the expected discounted sum of costs over a finite horizon. The result is that an echelon (R, nQ) policy is optimal when...
-
作者：Abouee-Mehrizi, Hossein; Balcioglu, Baris; Baron, Opher
作者单位：University of Waterloo; Sabanci University; University of Toronto
摘要：Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practica...
-
作者：Rusmevichientong, Paat; Topaloglu, Huseyin
作者单位：University of Southern California; Cornell University
摘要：We study robust formulations of assortment optimization problems under the multinomial logit choice model. The novel aspect of our formulations is that the true parameters of the logit model are assumed to be unknown, and we represent the set of likely parameter values by a compact uncertainty set. The objective is to find an assortment that maximizes the worst-case expected revenue over all parameter values in the uncertainty set. We consider both static and dynamic settings. The static setti...
-
作者：Zhang, Minjiao; Kuecuekyavuz, Simge; Yaman, Hande
作者单位：University System of Ohio; Ohio State University; Ihsan Dogramaci Bilkent University
摘要：In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two-echelon case (2-ULS). Next, we present a family of valid inequalities for m-ULS, show its strength, and give a polynomial-time separation algorithm. We establish a hiera...
-
作者：Zhang, Hao
作者单位：University of Southern California
摘要：This paper studies an infinite horizon adverse selection model with an underlying Markov information process. It introduces a graphic representation of continuation contracts and continuation payoff frontiers, namely finite policy graph, and provides an algorithm to approximate the optimal policy graph through iterations. The algorithm performs an additional step after each value iteration-replacing dominated points on the previous continuation payoff frontier by points on the new frontier and...
