-
作者：Jacobson, Evin Uzun; Argon, Nilay Tanik; Ziya, Serhan
作者单位：Imperial College London; University of North Carolina; University of North Carolina Chapel Hill
摘要：In the aftermath of mass-casualty events, key resources (such as ambulances and operating rooms) can be overwhelmed by the sudden jump in patient demand. To ration these resources, patients are assigned different priority levels, a process that is called triage. According to triage protocols in place, each patient's priority level is determined based on that patient's injuries only. However, recent work from the emergency medicine literature suggests that when determining priorities, resource ...
-
作者：Ulu, Canan; Honhon, Dorothee; Alptekinoglu, Aydin
作者单位：University of Texas System; University of Texas Austin; Eindhoven University of Technology; Southern Methodist University
摘要：How should a firm modify its product assortment over time when learning about consumer tastes? In this paper, we study dynamic assortment decisions in a horizontally differentiated product category for which consumers' diverse tastes can be represented as locations on a Hotel ling line. We presume that the firm knows all possible consumer locations, comprising a finite set, but does not know their probability distribution. We model this problem as a discrete-time dynamic program; each period, ...
-
作者：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...
-
作者：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...
-
作者：Candogan, Ozan; Bimpikis, Kostas; Ozdaglar, Asuman
作者单位：Massachusetts Institute of Technology (MIT); Stanford University
摘要：We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers who are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In particular, each consumer's usage level depends directly on the usage of her neighbors in the social network structure. Thus, the monopolist's optimal pricing strategy may involve offering discounts to certain agents who have a central position in the underlying...
-
作者：Yaman, Hande; Karasan, Oya Ekin; Kara, Bahar Y.
作者单位：Ihsan Dogramaci Bilkent University
摘要：Inspired by a real-life problem faced by one of the largest ground-based cargo companies of Turkey, the current study introduces a new facet to the hub location literature. The release time scheduling and hub location problem aims to select a specified number of hubs from a fixed set of demand centers, to allocate each demand center to a hub, and to decide on the release times of trucks from each demand center in such a way that the total amount of cargo guaranteed to be delivered to every pot...
-
作者：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...
-
作者：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...
-
作者：Reed, Josh; Tezcan, Tolga
作者单位：New York University; University of Rochester
摘要：We Obtain a heavy traffic limit for the GI/M/n + GI queue, which includes the entire patience time distribution. Our main approach is to scale the hazard rate function of the patience time distribution in such a way that our resulting diffusion approximation contains the entire hazard rate function. We then show through numerical studies that for various performance measures, our approximations tend to outperform those commonly used in practice. The robustness of our results is also demonstrat...
-
作者：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 ...
